External Links

    Journal: J. Comput. Syst. Sci.

    Volume 76, Issue 8

    697 -- 708Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang. Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph
    709 -- 726Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer. Connected facility location via random facility sampling and core detouring
    727 -- 740Michael R. Fellows, Jiong Guo, Iyad A. Kanj. The parameterized complexity of some minimum label problems
    741 -- 750Saehwa Kim. Dual ceiling protocol for real-time synchronization under preemption threshold scheduling
    751 -- 758Dekel Tsur. Sequencing by hybridization in few rounds
    759 -- 777Ofer Dekel, Felix A. Fischer, Ariel D. Procaccia. Incentive compatible regression learning
    778 -- 791Tony Tan. On pebble automata for data languages with decidable emptiness problem
    792 -- 811Christian Glaßer. Space-efficient informational redundancy
    812 -- 836Nadja Betzler, Britta Dorn. Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
    837 -- 846Tomás Masopust. Simple restriction in context-free rewriting
    861 -- 871Arto Salomaa. Subword balance, position indices and power sums
    872 -- 878Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo. Betweenness parameterized above tight lower bound
    879 -- 883David Gamarnik, Dmitriy Katz. A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
    884 -- 900Shlomi Dolev, Ronen I. Kat, Elad Michael Schiller. When consensus meets self-stabilization

    Volume 76, Issue 7

    509 -- 523Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay. Isomorphism and canonization of tournaments and hypertournaments
    524 -- 531Faisal N. Abu-Khzam. A kernelization algorithm for d-Hitting Set
    532 -- 537Joachim Wehler. Simplified proof of the blocking theorem for free-choice Petri nets
    538 -- 560Bart Kuijpers, Walied Othman. Trajectory databases: Data models, uncertainty and complete query languages
    561 -- 578Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor. Generalized modal satisfiability
    579 -- 592Hubie Chen, Omer Giménez. Causal graphs and structurally restricted planning
    593 -- 608Henning Fernau, Michael Kaufmann, Mathias Poths. Comparing trees via crossing minimization
    609 -- 633Miroslav Ciric, Aleksandar Stamenkovic, Jelena Ignjatovic, Tatjana Petkovic. Fuzzy relation equations and reduction of fuzzy automata
    634 -- 649Miki Hermann, Reinhard Pichler. Counting complexity of propositional abduction
    650 -- 662Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo. Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
    663 -- 685Jesús Arias-Fisteus, Norberto Fernández García, Luis Sánchez Fernández, Carlos Delgado Kloos. Hashing and canonicalizing Notation 3 graphs
    686 -- 696S. Muthukrishnan, Gopal Pandurangan. Thresholding random geometric graph properties motivated by ad hoc sensor networks

    Volume 76, Issue 6

    389 -- 0Jinjun Chen, Lizhe Wang. Special issue: Scientific workflow 2009
    390 -- 402Ping Yang, Shiyong Lu, Mikhail I. Gofman, Zijiang Yang. Information flow analysis of scientific workflows
    403 -- 415Rafael Tolosana-Calasanz, José Ángel Bañares, Pedro Álvarez, Joaquín Ezpeleta, Omer F. Rana. An uncoordinated asynchronous checkpointing model for hierarchical scientific workflows
    416 -- 427Wanchun Dou, J. Leon Zhao, Shaokun Fan. A collaborative scheduling approach for service-driven scientific workflow execution
    428 -- 446Scott Callaghan, Ewa Deelman, Dan Gunter, Gideon Juve, Philip Maechling, Christopher Brooks, Karan Vahi, Kevin Milner, Robert Graves, Edward Field, David Okaya, Thomas Jordan. Scaling up workflow-based applications
    447 -- 463Daniel Zinn, Shawn Bowers, Sven Köhler, Bertram Ludäscher. Parallelizing XML data-streaming workflows via MapReduce
    464 -- 474Jinjun Chen, Yun Yang. Localising temporal constraints in scientific workflows
    475 -- 489Jiangang Ma, Jinli Cao, Yanchun Zhang. Efficiently supporting secure and reliable collaboration in scientific workflows
    490 -- 508Jacek Sroka, Jan Hidders, Paolo Missier, Carole A. Goble. A formal semantics for the Taverna 2 workflow model

    Volume 76, Issue 5

    281 -- 282Wilfrid Hodges, Ruy J. G. B. de Queiroz. Editors foreword for JCSS WoLLIC 2008
    283 -- 301Christophe Calvès, Maribel Fernández. Matching and alpha-equivalence check for nominal terms
    302 -- 323Olivier Danvy, Jacob Johannsen. Inter-deriving semantic artifacts for object-oriented programming
    324 -- 332Anuj Dawar. Homomorphism preservation on quasi-wide classes
    333 -- 346Santiago Figueira, Daniel Gorín, Rafael Grimson. On the formal semantics of IF-like logics
    347 -- 355Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao. Adversary lower bounds for nonadaptive quantum algorithms
    356 -- 372Ilya Mezhirov, Nikolay K. Vereshchagin. On abstract resource semantics and computability logic
    373 -- 388Livio Robaldo. Interpretation and inference with maximal referential terms

    Volume 76, Issue 3-4

    154 -- 203Nikolaj Bjørner, Andreas Blass, Yuri Gurevich. Content-dependent chunking for differential compression, the local maximum approach
    204 -- 221Michael Dom, Jiong Guo, Rolf Niedermeier. Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
    222 -- 232Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc. Communication algorithms with advice
    233 -- 250Sanjay Jain, Frank Stephan. Numberings optimal for learning
    251 -- 266Alexander Okhotin. Decision problems for language equations
    267 -- 277Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum. An approximation trichotomy for Boolean #CSP
    278 -- 280Benjamin I. P. Rubinstein, Peter L. Bartlett, J. Hyam Rubinstein. Corrigendum to Shifting: One-inclusion mistake bounds and sample compression [J. Comput. System Sci 75 (1) (2009) 37-59]

    Volume 76, Issue 2

    103 -- 114Marko Samer, Stefan Szeider. Constraint satisfaction with bounded treewidth revisited
    115 -- 124Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild. Pattern matching with don t cares and few errors
    125 -- 143H. M. W. Verbeek, Moe Thandar Wynn, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede. Reduction rules for reset/inhibitor nets
    144 -- 152Jean Daligault, Gregory Gutin, Eun Jung Kim, Anders Yeo. FPT algorithms and kernels for the Directed k-Leaf problem

    Volume 76, Issue 1

    1 -- 2Radim Belohlávek, Rudolf Kruse. Editor s foreword
    3 -- 20Radim Belohlávek, Vilém Vychodil. Discovery of optimal factors in binary data via a novel method of matrix decomposition
    21 -- 33Christian Borgelt. A conditional independence algorithm for learning undirected graphical models
    34 -- 48Petr Hájek, Martin Holena, Jan Rauch. The GUHA method and its meaning for data mining
    49 -- 62Eyke Hüllermeier, Johannes Fürnkranz. On predictive accuracy and risk minimization in pairwise label ranking
    63 -- 76Guoqing Liu, Vladik Kreinovich. Fast convolution and Fast Fourier Transform under interval and fuzzy uncertainty
    77 -- 87Matthias Steinbrecher, Rudolf Kruse. Visualizing and fuzzy filtering for discovering temporal trajectories of association rules
    88 -- 102Karam Gouda, Mosab Hassaan, Mohammed J. Zaki. Prism: An effective approach for frequent sequence mining via prime-block encoding
    runs on