default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 158
Volume 158, Number 1, April 2000
- Petr Jancar
:
Decidability of Bisimilarity for One-Counter Processes. 1-17 - Torben Hagerup:
Parallel Preprocessing for Path Queries without Concurrent Reading. 18-28 - Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe:
Tally NP Sets and Easy Census Functions. 29-52 - Yair Bartal, Marek Chrobak, Lawrence L. Larmore:
A Randomized Algorithm for Two Servers on the Line. 53-69
Volume 158, Number 2, May 2000
- Eytan H. Modiano, Anthony Ephremides:
Communication Protocols for Secure Distributed Computation of Binary Functions. 71-97 - Ulla Koppenhagen, Ernst W. Mayr:
Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups. 98-124 - Hans van Maaren:
A Short Note on Some Tractable Cases of the Satisfiability Problem. 125-130
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-10-22 02:19 CEST 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:
