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=123
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Semantics of inhibitor nets
Ryszard Janicki
,
Maciej Koutny
Information and Computation
123
(1), 1995, November, pp. 1-16
Gossiping in vertex-disjoint paths mode in
d
-dimensional grids and planar graphs
Juraj Hromkovic̑
,
Ralf Klasing
,
Elena A. Stöhr
,
Hubert Wagener
Information and Computation
123
(1), 1995, November, pp. 17-28
Fast comparison of evolutionary trees
Martin Farach
,
Mikkel Thorup
Information and Computation
123
(1), 1995, November, pp. 29-37
On the structure of parametrized problems in NP
Liming Cai
,
Jianer Chen
,
Rodney Downey
,
Michael Fellows
Information and Computation
123
(1), 1995, November, pp. 38-49
Complexity of identification and dualization of positive boolean functions
Jan C. Bioch
,
Toshihide Ibaraki
Information and Computation
123
(1), 1995, November, pp. 50-63
On the intrinsic complexity of learning
Rūsiņs̆ Freivalds
,
Efim Kinber
,
Carl H. Smith
Information and Computation
123
(1), 1995, November, pp. 64-71
Fast parallel space allocation, estimation, and integer sorting
Hannah Bast
,
Torben Hagerup
Information and Computation
123
(1), 1995, November, pp. 72-110
Approximate matching for two families of trees
Fabrizio Luccio
,
Linda Pagli
Information and Computation
123
(1), 1995, November, pp. 111-120
Circuit lower bounds à la Kolmogorov
Lance Fortnow
,
Sophie Laplante
Information and Computation
123
(1), 1995, November, pp. 121-126
The subtree max gap problem with application to parallel string covering
Omar Berkman
,
Costas S. Iliopoulos
,
Kunsoo Park
Information and Computation
123
(1), 1995, November, pp. 127-137
A hierarchy of language families learnable by regular language learning
Yuji Takada
Information and Computation
123
(1), 1995, November, pp. 138-145
Exact learning Boolean functions via the monotone theory
Nader H. Bshouty
Information and Computation
123
(1), 1995, November, pp. 146-153
Connection management without retaining information
Hagit Attiya
,
Shlomi Dolev
,
Jennifer L. Welch
Information and Computation
123
(2), 1995, December, pp. 155-171
The expressive power of finitely many generalized quantifiers
Anuj Dawar
,
Lauri Hella
Information and Computation
123
(2), 1995, December, pp. 172-184
On the relation between BDDs and FDDs
Bernd Becker
,
Rolf Drechsler
,
Ralph Werchner
Information and Computation
123
(2), 1995, December, pp. 185-197
Efficient inference of object types
Jens Palsberg
Information and Computation
123
(2), 1995, December, pp. 198-209
The availability of quorum systems
David Peleg
,
Avishai Wool
Information and Computation
123
(2), 1995, December, pp. 210-223
Language learning from texts: Mindchanges, limited memory, and monotonicity
Efim Kinber
,
Frank Stephan
Information and Computation
123
(2), 1995, December, pp. 224-241