External Links

    Journal: Inf. Comput.

    Volume 204, Issue 9

    1325 -- 1345Peter Steffen, Robert Giegerich. Table design in dynamic programming
    1346 -- 1367Martin Lange. The alternation hierarchy in fixpoint logic with chop is strict too
    1368 -- 1409Håkan L. S. Younes, Reid G. Simmons. Statistical probabilistic model checking with a focus on time-bounded properties

    Volume 204, Issue 8

    1195 -- 1263Christian Haack, Alan Jeffrey. Pattern-matching spi-calculus
    1264 -- 1294Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan. Variations on U-shaped learning
    1295 -- 1324David Nowak. Synchronous structures

    Volume 204, Issue 7

    1013 -- 1022John T. Baldwin, Marco Mazzucco. Determined theories and limit laws
    1023 -- 1044Alexander Rabinovich, Ph. Schnoebelen. BTL::2:: and the expressive power of ECTL:::+:::
    1045 -- 1082Yuxin Deng, Davide Sangiorgi. Ensuring termination by typability
    1083 -- 1138Jan A. Bergstra, C. A. Middelburg. Splitting bisimulations and retrospective conditions
    1139 -- 1172. Terminal coalgebras and free iterative theories
    1173 -- 1178Lihua Liu, Zhengjun Cao. On computing ord::N::(2) and its application
    1179 -- 1193Jiqiang Lv. On two DES implementations secure against differential power analysis in smart-cards

    Volume 204, Issue 6

    853 -- 919Achim Blumensath, Bruno Courcelle. Recognizability, hypergraph operations, and logical types
    920 -- 956Blaise Genest, Dietrich Kuske, Anca Muscholl. A Kleene theorem and model checking algorithms for existentially bounded communicating automata
    957 -- 988Jakob Grue Simonsen. On modularity in infinitary term rewriting
    989 -- 1011Wei Luo, Oliver Schulte. Mind change efficient learning

    Volume 204, Issue 5

    679 -- 696Sergio Flesca, Filippo Furfaro, Sergio Greco. Weighted path queries on semistructured databases
    697 -- 712Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari. Broadcast in the rendezvous model
    713 -- 740Alexander Rabinovich. Quantitative analysis of probabilistic lossy channel systems
    741 -- 770Lars Eirik Danielsen, T. Aaron Gulliver, Matthew G. Parker. Aperiodic propagation criteria for Boolean functions
    771 -- 794Paulo Mateus, Amílcar Sernadas. Weakly complete axiomatization of exogenous quantum propositional logic
    795 -- 815György Dósa, Yong He. Bin packing problems with rejection penalties and their dual problems
    816 -- 834Marta Arias, Aaron Feigelson, Roni Khardon, Rocco A. Servedio. Polynomial certificates for propositional classes
    835 -- 852Vikraman Arvind, Piyush P. Kurur. Graph Isomorphism is in SPP

    Volume 204, Issue 4

    435 -- 436Jirí Adámek, Stefan Milius. Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004
    437 -- 468Venanzio Capretta, Tarmo Uustalu, Varmo Vene. Recursive coalgebras from comonads
    469 -- 502Corina Cîrstea. A modular approach to defining and characterising notions of simulation
    503 -- 523Vincent Danos, Josee Desharnais, François Laviolette, Prakash Panangaden. Bisimulation and cocongruence for probabilistic systems
    524 -- 560Marcelo P. Fiore, Sam Staton. Comparing operational models of name-passing process calculi
    561 -- 587Bart Jacobs. Distributive laws for the coinductive solution of recursive equations
    588 -- 609Marco Kick, John Power, Alex Simpson. Coalgebraic semantics for timed processes
    610 -- 636Lawrence S. Moss, Ignacio D. Viglizzo. Final coalgebras for functors on measurable spaces
    637 -- 678Yde Venema. Automata and fixed point logic: A coalgebraic perspective

    Volume 204, Issue 3

    339 -- 375Luca Paolini. A stable programming language
    376 -- 407Roberto Giacobazzi, Francesco Ranzato. Incompleteness of states w.r.t. traces in model checking
    408 -- 433Thomas Brihaye, Véronique Bruyère, Jean-François Raskin. On model-checking timed automata with stopwatch observers

    Volume 204, Issue 2

    177 -- 209Ricard Gavaldà, Pascal Tesson, Denis Thérien. Learning expressions and programs over monoids
    210 -- 230Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. Implicit complexity over an arbitrary structure: Quantifier alternations
    231 -- 274Samy Abbes, Albert Benveniste. True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
    275 -- 290Tzvika Hartman, Ron Shamir. A simpler and faster 1.5-approximation algorithm for sorting by transpositions
    291 -- 337Niv Buchbinder, Erez Petrank. Lower and upper bounds on obtaining history independence

    Volume 204, Issue 12

    1741 -- 1755Arto Salomaa, Sheng Yu. Subword conditions and subword histories
    1756 -- 1781Ernst-Erich Doberkat. Eilenberg-Moore algebras for stochastic relations
    1782 -- 1846Salvador Lucas. Proving termination of context-sensitive rewriting by transformation
    1847 -- 1851Christian Herrmann. Corrigendum to On the undecidability of implications between embedded multivalued database dependencies [Inform. and Comput. 122(1995) 221-235]
    1852 -- 0Jia Meng, Claire Quigley, Lawrence C. Paulson. Erratum to Automation for interactive proof: First prototype [Inform. and Comput. 204(2006) 1575-1596]

    Volume 204, Issue 11

    1597 -- 1619Volker Diekert, Paul Gastin. Pure future local temporal logics are expressively complete for Mazurkiewicz traces
    1620 -- 1662Johan van Benthem, Jan van Eijck, Barteld P. Kooi. Logics of communication and change
    1663 -- 1703Emanuel Kieronski. On the complexity of the two-variable guarded fragment with transitive guards
    1704 -- 1717Nir Ailon, Bernard Chazelle. Information theory in property testing and monotonicity testing in higher dimension
    1718 -- 1739Cristian S. Calude, Michael Stay. Natural halting probabilities, partial randomness, and zeta functions

    Volume 204, Issue 10

    1411 -- 1412Alessandro Armando, Christophe Ringeissen. Special issue on combining logical systems
    1413 -- 1452Franz Baader, Silvio Ghilardi, Cesare Tinelli. A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
    1453 -- 1492Harald Ganzinger, Viorica Sofronie-Stokkermans, Uwe Waldmann. Modular proof systems for partial functions with Evans equality
    1493 -- 1525Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani. Efficient theory combination via boolean search
    1526 -- 1574Ting Zhang, Henny B. Sipma, Zohar Manna. Decision procedures for term algebras with integer constraints
    1575 -- 1596Jia Meng, Claire Quigley, Lawrence C. Paulson. Automation for interactive proof: First prototype

    Volume 204, Issue 1

    1 -- 25Claus-Peter Schnorr. Fast LLL-type lattice reduction
    26 -- 59Yoav Rodeh, Ofer Strichman. Building small equality graphs for deciding equality logic with uninterpreted functions
    60 -- 122Robin Milner. Pure bigraphs: Structure and dynamics
    123 -- 175Sanjay Jain, Efim B. Kinber. Learning languages from positive data and a finite number of queries
    runs on