default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 204
Volume 204, Number 1, January 2006
- Claus-Peter Schnorr:
Fast LLL-type lattice reduction. 1-25 - Yoav Rodeh, Ofer Strichman
:
Building small equality graphs for deciding equality logic with uninterpreted functions. 26-59 - Robin Milner:
Pure bigraphs: Structure and dynamics. 60-122 - Sanjay Jain, Efim B. Kinber:
Learning languages from positive data and a finite number of queries. 123-175
Volume 204, Number 2, February 2006
- Ricard Gavaldà, Pascal Tesson, Denis Thérien:
Learning expressions and programs over monoids. 177-209 - Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion:
Implicit complexity over an arbitrary structure: Quantifier alternations. 210-230 - Samy Abbes, Albert Benveniste:
True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures. 231-274 - Tzvika Hartman, Ron Shamir:
A simpler and faster 1.5-approximation algorithm for sorting by transpositions. 275-290 - Niv Buchbinder, Erez Petrank:
Lower and upper bounds on obtaining history independence. 291-337
Volume 204, Number 3, March 2006
- Luca Paolini:
A stable programming language. 339-375 - Roberto Giacobazzi, Francesco Ranzato:
Incompleteness of states w.r.t. traces in model checking. 376-407 - Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
On model-checking timed automata with stopwatch observers. 408-433
Volume 204, Number 4, April 2006
- Jirí Adámek, Stefan Milius:
Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004. 435-436 - Venanzio Capretta, Tarmo Uustalu, Varmo Vene:
Recursive coalgebras from comonads. 437-468 - Corina Cîrstea:
A modular approach to defining and characterising notions of simulation. 469-502 - Vincent Danos, Josée Desharnais, François Laviolette, Prakash Panangaden:
Bisimulation and cocongruence for probabilistic systems. 503-523 - Marcelo P. Fiore, Sam Staton:
Comparing operational models of name-passing process calculi. 524-560 - Bart Jacobs:
Distributive laws for the coinductive solution of recursive equations. 561-587 - Marco Kick, John Power, Alex Simpson:
Coalgebraic semantics for timed processes. 588-609 - Lawrence S. Moss, Ignacio D. Viglizzo:
Final coalgebras for functors on measurable spaces. 610-636 - Yde Venema:
Automata and fixed point logic: A coalgebraic perspective. 637-678
Volume 204, Number 5, May 2006
- Sergio Flesca, Filippo Furfaro, Sergio Greco:
Weighted path queries on semistructured databases. 679-696 - Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari:
Broadcast in the rendezvous model. 697-712 - Alexander Rabinovich:
Quantitative analysis of probabilistic lossy channel systems. 713-740 - Lars Eirik Danielsen, T. Aaron Gulliver, Matthew Geoffrey Parker:
Aperiodic propagation criteria for Boolean functions. 741-770 - Paulo Mateus, Amílcar Sernadas:
Weakly complete axiomatization of exogenous quantum propositional logic. 771-794 - György Dósa, Yong He:
Bin packing problems with rejection penalties and their dual problems. 795-815 - Marta Arias, Aaron Feigelson, Roni Khardon, Rocco A. Servedio:
Polynomial certificates for propositional classes. 816-834 - Vikraman Arvind, Piyush P. Kurur:
Graph Isomorphism is in SPP. 835-852
Volume 204, Number 6, June 2006
- Achim Blumensath, Bruno Courcelle:
Recognizability, hypergraph operations, and logical types. 853-919 - Blaise Genest, Dietrich Kuske, Anca Muscholl:
A Kleene theorem and model checking algorithms for existentially bounded communicating automata. 920-956 - Jakob Grue Simonsen:
On modularity in infinitary term rewriting. 957-988 - Wei Luo, Oliver Schulte:
Mind change efficient learning. 989-1011
Volume 204, Number 7, July 2006
- John T. Baldwin, Marco Mazzucco:
Determined theories and limit laws. 1013-1022 - Alexander Rabinovich, Philippe Schnoebelen:
BTL2 and the expressive power of ECTL+. 1023-1044 - Yuxin Deng, Davide Sangiorgi:
Ensuring termination by typability. 1045-1082 - Jan A. Bergstra, Cornelis A. Middelburg:
Splitting bisimulations and retrospective conditions. 1083-1138 - Jirí Adámek, Stefan Milius:
Terminal coalgebras and free iterative theories. 1139-1172 - Lihua Liu, Zhengjun Cao:
On computing ordN(2) and its application. 1173-1178 - Jiqiang Lv:
On two DES implementations secure against differential power analysis in smart-cards. 1179-1193
Volume 204, Number 8, August 2006
- Christian Haack, Alan Jeffrey:
Pattern-matching spi-calculus. 1195-1263 - Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan:
Variations on U-shaped learning. 1264-1294 - David Nowak:
Synchronous structures. 1295-1324
Volume 204, Number 9, September 2006
- Peter Steffen, Robert Giegerich:
Table design in dynamic programming. 1325-1345 - Martin Lange:
The alternation hierarchy in fixpoint logic with chop is strict too. 1346-1367 - Håkan L. S. Younes, Reid G. Simmons:
Statistical probabilistic model checking with a focus on time-bounded properties. 1368-1409
Volume 204, Number 10, October 2006
- Alessandro Armando, Christophe Ringeissen:
Special issue on combining logical systems. 1411-1412 - Franz Baader, Silvio Ghilardi, Cesare Tinelli:
A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. 1413-1452 - Harald Ganzinger, Viorica Sofronie-Stokkermans, Uwe Waldmann:
Modular proof systems for partial functions with Evans equality. 1453-1492 - Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani:
Efficient theory combination via boolean search. 1493-1525 - Ting Zhang, Henny B. Sipma, Zohar Manna:
Decision procedures for term algebras with integer constraints. 1526-1574 - Jia Meng, Claire Quigley, Lawrence C. Paulson:
Automation for interactive proof: First prototype. 1575-1596
Volume 204, Number 11, November 2006
- Volker Diekert, Paul Gastin:
Pure future local temporal logics are expressively complete for Mazurkiewicz traces. 1597-1619 - Johan van Benthem, Jan van Eijck, Barteld P. Kooi:
Logics of communication and change. 1620-1662 - Emanuel Kieronski:
On the complexity of the two-variable guarded fragment with transitive guards. 1663-1703 - Nir Ailon, Bernard Chazelle:
Information theory in property testing and monotonicity testing in higher dimension. 1704-1717 - Cristian S. Calude, Michael Stay:
Natural halting probabilities, partial randomness, and zeta functions. 1718-1739
Volume 204, Number 12, December 2006
- Arto Salomaa, Sheng Yu:
Subword conditions and subword histories. 1741-1755 - Ernst-Erich Doberkat:
Eilenberg-Moore algebras for stochastic relations. 1756-1781 - Salvador Lucas:
Proving termination of context-sensitive rewriting by transformation. 1782-1846
- Christian Herrmann:
Corrigendum to "On the undecidability of implications between embedded multivalued database dependencies" [Inform. and Comput. 122(1995) 221-235]. 1847-1851
- Jia Meng, Claire Quigley, Lawrence C. Paulson:
Erratum to "Automation for interactive proof: First prototype" [Inform. and Comput. 204(2006) 1575-1596]. 1852
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-01 15:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
