default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 165
Volume 165, Number 1, February 2001
- Giovanni Pighizzini
:
How Hard Is Computing the Edit Distance? 1-13 - François Fages, Paul Ruet, Sylvain Soliman:
Linear Concurrent Constraint Programming: Operational and Phase Semantics. 14-41 - Vincenzo Auletta, Pino Persiano:
Optimal Pebble Motion on a Tree. 42-68 - Werner Kuich:
Pushdown Tree Automata, Algebraic Tree Systems, and Algebraic Tree Series. 69-99 - Rosario Gennaro, Pankaj Rohatgi:
How to Sign Digital Streams. 100-116
Volume 165, Number 2, 15 March 2001
- Samson Abramsky, Luca Aceto, Anna Ingólfsdóttir:
Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218. 119-122 - Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree. 123-143 - Roberto Baldoni, Jean-Michel Hélary, Michel Raynal:
Rollback-Dependency Trackability: A Minimal Characterization and Its Protocol. 144-173 - Alberto Bertoni, Marco Carpentieri:
Regular Languages Accepted by Quantum Automata. 174-182 - Georg Gottlob, Reinhard Pichler:
Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models. 183-207
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-12-04 01:27 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:
