default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 95
Volume 95, Number 1, 1991
- Amotz Bar-Noy, Danny Dolev
, Daphne Koller, David Peleg:
Fault-Tolerant Critical Section Management in Asynchronous Environments. 1-20 - Joost Engelfriet:
Iterated Stack Automata and Complexity Classes. 21-75 - Alberto Apostolico, Maxime Crochemore:
Optimal Canonization of All Substrings of a String. 76-95 - David A. Mix Barrington, Pierre McKenzie:
Oracle branching programs and Logspace versus P. 96-115
Volume 95, Number 2, 1991
- Juraj Hromkovic:
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators. 117-128 - David Haussler, Michael J. Kearns, Nick Littlestone, Manfred K. Warmuth:
Equivalence of Models for Polynomial Learnability. 129-161 - Sanjay Jain, Arun Sharma:
Learning in the Presence of Partial Explanations. 162-191 - Alban Ponse:
Process Expressions and Hoare's Logic: Showing an Irreconcilability of Context-Free Recursion with Scott's Induction Rule. 192-217 - R. Mahesh, C. Pandu Rangan, Aravind Srinivasan:
On Finding the Minimum Bandwidth of Interval Graphs. 218-224 - Livio Colussi:
Correctness and Efficiency of the Pattern Matching Algorithms. 225-251
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-07-25 18:56 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:
