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=118
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient 2-dimensional approximate matching of half-rectangular figures
Amihood Amir
,
Martin Farach
Information and Computation
118
(1), 1995, pp. 1-11
Negation and constraint logic programming
Peter J. Stuckey
Information and Computation
118
(1), 1995, pp. 12-33
A simple randomized sieve algorithm for the closest-pair problem
Samir Khuller
,
Yossi Matias
Information and Computation
118
(1), 1995, pp. 34-37
Generalized OM-bisimulation
Walter Vogler
Information and Computation
118
(1), 1995, pp. 38-47
Fast identification of geometric objects with membership queries
William J. Bultman
,
Wolfgang Maass
Information and Computation
118
(1), 1995, pp. 48-64
Sample sizes for threshold networks with equivalences
John Shawe-Taylor
Information and Computation
118
(1), 1995, pp. 65-72
Quantifying the amount of verboseness
Richard Beigel
,
Martin Kummer
,
Frank Stephan
Information and Computation
118
(1), 1995, pp. 73-90
Decidability of regularity and related properties of ground normal form languages
Gregory Kucherov
,
Mohamed Tajine
Information and Computation
118
(1), 1995, pp. 91-100
Testing language containment for
\omega
-automata using BDDs
Hervé J. Touati
,
Robert K. Brayton
,
Robert Kurshan
Information and Computation
118
(1), 1995, pp. 101-109
On the recognition of families of graphs with local computations
Igor Litovsky
,
Yves Métivier
,
Wiesƚaw Zielonka
Information and Computation
118
(1), 1995, pp. 110-119
Parallel reductions in
\lambda
-calculus
Masako Takahashi
Information and Computation
118
(1), 1995, pp. 120-127
Safety analysis versus type inference
Jens Palsberg
,
Michael I. Schwartzbach
Information and Computation
118
(1), 1995, pp. 128-141
Timing verification by successive approximation
R. Alur
,
A. Itai
,
R.P. Kurshan
,
M. Yannakakis
Information and Computation
118
(1), 1995, pp. 142-157
Atomic broadcast: From simple message diffusion to Byzantine agreement
Flaviu Cristian
,
Houtan Aghili
,
Ray Strong
,
Danny Dolev
Information and Computation
118
(1), 1995, pp. 158-179
Recursive data types in algebraically
\omega
-complete categories
Jiȓí Adámek
Information and Computation
118
(2), 1995, pp. 181-190
Transition systems, event structures, and unfoldings
M. Nielsen
,
G. Rozenberg
,
P.S. Thiagarajan
Information and Computation
118
(2), 1995, pp. 191-207
How inductive inference strategies discover their errors
Rūsiņs̆ Freivalds
,
Efim B. Kinber
,
Rolf Wiehagen
Information and Computation
118
(2), 1995, pp. 208-226
Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits
Rolf Niedermeier
,
Peter Rossmanith
Information and Computation
118
(2), 1995, pp. 227-245
Full abstraction and expressive completeness for FP
Joseph Y. Halpern
,
Edward L. Wimmers
Information and Computation
118
(2), 1995, pp. 246-271
Split and ST bisimulation semantics
Roberto Gorrieri
,
Cosimo Laneve
Information and Computation
118
(2), 1995, pp. 272-288
Regular languages defined with generalized quantifiers
Howard Straubing
,
Denis Thérien
,
Wolfgang Thomas
Information and Computation
118
(2), 1995, pp. 289-301
On embeddings in cycles
Juraj Hromkovic̑
,
Vladimír Müller
,
Ondrej Sýkora
,
Imrich Vrt̑o
Information and Computation
118
(2), 1995, pp. 302-305
Deciding branching bisimilarity of normed context-free processes is in
\Sigma_2^p
Didier Caucal
,
Dung T. Huynh
,
Lu Tian
Information and Computation
118
(2), 1995, pp. 306-315
On the learnability of infinitary regular sets
Oded Maler
,
Amir Pnueli
Information and Computation
118
(2), 1995, pp. 316-326
Economy of description for single-valued transducers
Andreas Weber
,
Reinhard Klemm
Information and Computation
118
(2), 1995, pp. 327-340