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=120
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A normal form problem for unlabeled boundary NLC graph languages
Koichi Yamazaki
Information and Computation
120
(1), 1995, pp. 1-10
A parametrization scheme for classifying models of PAC learnability
Shai Ben-David
,
Gyora M. Benedek
,
Yishay Mansour
Information and Computation
120
(1), 1995, pp. 11-21
Vector analysis of threshold functions
Vwani Roychowdhury
,
Kai-Yeung Siu
,
Alon Orlitsky
,
Thomas Kailath
Information and Computation
120
(1), 1995, pp. 22-31
Dynamical systems, measures, and fractals via domain theory
Abbas Edalat
Information and Computation
120
(1), 1995, pp. 32-48
The global power of additional queries to random oracles
Ronald V. Book
,
Jack H. Lutz
,
David M., Jr. Martin
Information and Computation
120
(1), 1995, pp. 49-54
Equivalence of
NC^k
and
AC^{k-1}
closures of
NP
and other classes
Mitsunori Ogihara
Information and Computation
120
(1), 1995, pp. 55-58
Recursion theoretic properties of frequency computation and bounded queries
Martin Kummer
,
Frank Stephan
Information and Computation
120
(1), 1995, pp. 59-77
On monadic
NP
vs monadic
coNP
Ronald Fagin
,
Larry J. Stockmeyer
,
Moshe Y. Vardi
Information and Computation
120
(1), 1995, pp. 78-92
Optimal amortized distributed consensus
Amotz Bar-Noy
,
Xiaotie Deng
,
Juan A. Garay
,
Tiko Kameda
Information and Computation
120
(1), 1995, pp. 93-100
Incremental and decremental evaluation of transitive closure by first-order queries
Guozhu Dong
,
Jianwen Su
Information and Computation
120
(1), 1995, pp. 101-106
Kripke logical relations and PCF
Peter W. O'Hearn
,
Jon G. Riecke
Information and Computation
120
(1), 1995, pp. 107-116
Automata on infinite trees with counting constraints
Danièle Beauquier
,
Damian Niwiński
Information and Computation
120
(1), 1995, pp. 117-125
Algorithms for detecting morphic images of a word
Jean Neraud
Information and Computation
120
(1), 1995, pp. 126-148
The bounds of Skolem functions and their applications
Shih Ping Tung
Information and Computation
120
(1), 1995, pp. 149-154
Characterizations of monotonic and dual monotonic language learning
Thomas Zeugmann
,
Steffen Lange
,
Shyam Kapur
Information and Computation
120
(2), 1995, pp. 155-173
Algebraic theories for name-passing calculi
Joachim Parrow
,
Davide Sangiorgi
Information and Computation
120
(2), 1995, pp. 174-197
Complexity classes of optimization functions
Heribert Vollmer
,
Klaus W. Wagner
Information and Computation
120
(2), 1995, pp. 198-219
The expressive power of complex values in object-based data models
Jan Van den Bussche
,
Jan Paredaens
Information and Computation
120
(2), 1995, pp. 220-236
On parallel computations with banded matrices
Victor Y. Pan
,
Isdor Sobze
,
Antoine Atinkpahoun
Information and Computation
120
(2), 1995, pp. 237-250
Negation as instantiation
Alessandra di Pierro
,
Maurizio Martelli
,
Catuscia Palamidessi
Information and Computation
120
(2), 1995, pp. 263-278
Testing equivalence for mobile processes
Michele Boreale
,
Rocco de Nicola
Information and Computation
120
(2), 1995, pp. 279-303
Approximable sets
Richard Beigel
,
Martin Kummer
,
Frank Stephan
Information and Computation
120
(2), 1995, pp. 304-314
Computational complexity of arithmetical sentences
Shih Ping Tung
Information and Computation
120
(2), 1995, pp. 315-325
Lower bounds on universal traversal sequences based on chains of length five
Jonathan Buss
,
Martin Tompa
Information and Computation
120
(2), 1995, pp. 326-329