default search action
Acta Informatica, Volume 37
Volume 37, Number 1, 2000
- Youichi Kobuchi, Takashi Saito, Hidenobu Nunome:
Semantics analysis through elementary meanings. 1-19 - Desh Ranjan, Enrico Pontelli
, Gopal Gupta:
Data structures for order-sensitive predicates in parallel nondeterministic systems. 21-43 - Béatrice Bérard, Claudine Picaronny:
Accepting Zeno words: a way toward timed refinements. 45-81
Volume 37, Number 2, 2000
- Amir M. Ben-Amram, Neil D. Jones:
Computational complexity via programming languages: constant factors do matter. 83-120 - Danny Dubé, Marc Feeley:
Efficiently building a parse tree from a regular expression. 121-144 - Stefan Andrei, Manfred Kudlek, Radu Stefan Niculescu:
Some results on the Collatz problem. 145-160
Volume 37, Number 3, 2000
- Soma Chaudhuri, Martha J. Kosa, Jennifer L. Welch:
One-write algorithms for multivalued regular and atomic registers. 161-192 - Bo-Ting Yang, Paul Gillard:
The class Steiner minimal tree problem: a lower bound and test problem generation. 193-211 - Hendrik Jan Hoogeboom, Nike van Vugt:
Fair sticker languages. 213-225
Volume 37, Number 4/5, 2001
- Manfred Broy:
Letter from the Editor. 227-228 - Rob J. van Glabbeek, Ursula Goltz:
Refinement of actions and equivalence notions for concurrent systems. 229-327 - Annabelle McIver
Demonic, angelic and unbounded probabilistic choices in sequential programs. 329-354 - Philippe Chanzy, Luc Devroye, Carlos Zamora-Cura:
Analysis of range search for random k-d trees. 355-383
Volume 37, Number 6, 2001
- Ian J. Hayes
A sequential real-time refinement calculus. 385-448 - Ferucio Laurentiu Tiplea, Erkki Mäkinen, Corina Apachite:
Synchronized extension systems. 449-465
Volume 37, Number 7, 2001
- Flavio Corradini, Marco Pistore
'Closed Interval Process Algebra' versus 'Interval Process Algebra'. 467-509 - Henning Fernau
Parallel communicating grammar systems with terminal transmission. 511-540
Volume 37, Number 8, 2001
- Joseph M. Morris, Alexander Bunkenburg:
A theory of bunches. 541-561 - Luc Moreau
A construction of distributed reference counting. 563-595 - Arturo Carpi, Aldo de Luca:
Periodic-like words, periodicity, and boxes. 597-618
Volume 37, Number 9, 2001
- Changwook Kim:
Efficient recognition algorithms for boundary and linear eNCE graph languages. 619-632 - John Aycock, R. Nigel Horspool, Jan Janousek
Even faster generalized LR parsing. 633-651 - Laurent Alonso, René Schott:
On the tree inclusion problem. 653-670 - Shin-ichi Morimoto, Masataka Sassa:
Yet another generation of LALR parsers for regular right part grammars. 671-697
Volume 37, Number 10, 2001
- Sergio Greco
Extending stratified datalog to capture complexity classes ranging from P to QH. 699-725 - Rob van Stee, Johannes A. La Poutré:
Running a job on a collection of partly available machines, with on-line restarts. 727-742 - Kim S. Larsen
Relaxed balance for search trees with local rebalancing. 743-763 - Jan Ramon, Maurice Bruynooghe:
A polynomial time computable metric between point sets. 765-780
Volume 37, Number 11-12, 2001
- Eike Best, Raymond R. Devillers, Maciej Koutny:
Recursion and Petri nets. 781-829 - Egidio Astesiano, Gianna Reggio:
Labelled transition logic: an outline. 831-879 - Ram Chakka, Peter G. Harrison
A Markov modulated multi-server queue with negative customers - The MM CPP/GE/c/L G-queue. 881-919
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 2024-11-19 20:48 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: