default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 3
Volume 3, Number 1, March 1992
- Stephan Olariu, James L. Schwing, Jingyuan Zhang:
Optimal Parallel Encoding and Decoding Algorithms for Trees. 1-10 - Sergio De Agostino, Rossella Petreschi:
On PVchunk Operations and Matrogenic Graphs. 11-20 - Ahmed Saoudi:
Pushdown Automata on Infinite Trees and Nondeterministic Context-Free Programs. 21-39 - Paola Campadelli, Anna Morpurgo:
Learning Classes of Linearly Separable Boolean Functions from Positive Examples. 41-54 - Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci:
Analysis and Implementation of Parallel Uniform Hashing. 55-63 - Juraj Hromkovic, Katsushi Inoue, Branislav Rovan, Anna Slobodová, Itsuo Takanami, Klaus W. Wagner:
On the Power of One-Way Synchronized Alternating Machines with Small Space. 65-79 - Claude Marché:
The Word Problem of ACD-Ground Theories is Undecidable. 81-97 - John Case, Sanjay Jain, Arun Sharma:
On Learning Limiting Programs. 93-115
Volume 3, Number 2, June 1992
- Kamal Lodaya, Ramaswamy Ramanujam, P. S. Thiagarajan:
Temporal Logics for Communicating Sequential Agents: I. 117-159 - Alexei P. Stolboushkin:
On the Computing Power of Programs with Sets. 161-186 - Alberto Bertoni, Paolo Massazza, Nicoletta Sabadini:
Holonomic Generating Functions and Context Free Languages. 181-191 - Wiebe van der Hoek, John-Jules Ch. Meyer:
Making Some Issues of Implicit Knowledge Explicit. 193-223 - Frank J. Oles:
When is a Category of Many-Sorted Algebras Cartesian Closed? 225-231
Volume 3, Number 3, September 1992
- Ahmed Saoudi, David E. Muller, Paul E. Schupp:
Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers. 233-244 - Stephen L. Bloom, Zoltán Ésik:
Iteration Algebras. 245-302 - P. Krishnan:
A Calculus of Timed Communicating Systems. 303-322 - Y. Cheng, Frank K. Hwang, Ian F. Akyildiz, D. Frank Hsu:
Routing Algorithms for Double Loop Networks. 323-331 - David J. Pym:
A Unification Algorithm for the lambda-Pi-Calculus. 333-378 - S. Antonelli, Susanna Pelagatti:
On the Complexity of the Mapping Problem for Massively Parallel Architectures. 379-387
Volume 3, Number 4, December 1992
- Manfred Droste:
Concurrent Automata and Domains. 389-418 - Francine Blanchet-Sadri:
The Dot-Depth of a Generating Class of Aperiodic Monoids is Computable. 419-442 - Madhavan Mukund:
Petri Nets and Step Transition Systems. 443-478 - Thomas Ottmann, Derick Wood:
Updating Binary Trees with Constant Linkage Cost. 479-501
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 2026-03-23 11:53 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:
