Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Comput. AND Volume=95
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fault-tolerant critical section management in asynchronous environments
Amotz Bar-Noy
,
Danny Dolev
,
Daphne Koller
,
David Peleg
Information and Computation
95
(1), 1991, November, pp. 1-20
Iterated stack automata and complexity classes
Joost Engelfriet
Information and Computation
95
(1), 1991, November, pp. 21-75
Optimal canonization of all substrings of a string
A. Apostolico
,
M. Crochemore
Information and Computation
95
(1), 1991, November, pp. 76-95
Oracle branching programs and Logspace versus
\P
David A. Mix Barrington
,
Pierre McKenzie
Information and Computation
95
(1), 1991, November, pp. 96-115
Nonlinear lower bounds on the number of processors of circuits with sublinear separators
Juraj Hromkovic̑
Information and Computation
95
(2), 1991, December, pp. 117-128
Equivalence of models for polynomial learnability
David Haussler
,
Michael Kearns
,
Nick Littlestone
,
Manfred K. Warmuth
Information and Computation
95
(2), 1991, December, pp. 129-161
Learning in the presence of partial explanations
Sanjay Jain
,
Arun Sharma
Information and Computation
95
(2), 1991, December, pp. 162-191
Process expressions and Hoare's logic: Showing an irreconcilability of context-free recursion with Scott's induction rule
Alban Ponse
Information and Computation
95
(2), 1991, December, pp. 192-217
On finding the minimum bandwidth of interval graphs
R. Mahesh
,
C. Pandu Rangan
,
Aravind Srinivasan
Information and Computation
95
(2), 1991, December, pp. 218-224
Correctness and efficiency of pattern matching algorithms
Livio Colussi
Information and Computation
95
(2), 1991, December, pp. 225-251