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
[1]
Hilfe
Suche: Journal=Inf.~Comput. AND YEAR=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Loop circuits and their relation to Razborov's approximation model
Katsutoshi Nakayama
,
Akira Maruoka
Information and Computation
119
(2), 1995, pp. 154-159
Infinitary logic and inductive definability over finite structures
Anuj Dawar
,
Steven Lindell
,
Scott Weinstein
Information and Computation
119
(2), 1995, pp. 160-175
Second order isomorphic types: A proof theoretic study on second order
\lambda
-calculus with surjective pairing and terminal object
Roberto di Cosmo
Information and Computation
119
(2), 1995, pp. 176-201
Intersection and union types: Syntax and semantics
Franco Barbanera
,
Mariangiola Dezani-Ciancaglini
,
Ugo de'Liguoro
Information and Computation
119
(2), 1995, pp. 202-230
The complexity of selecting maximal solutions
Zhi-Zhong Chen
,
Seinosuke Toda
Information and Computation
119
(2), 1995, pp. 231-239
New results on the star problem in trace monoids
Yves Métivier
,
Gwénaël Richomme
Information and Computation
119
(2), 1995, pp. 240-251
Universal retractions on
DI
-domains
Xavier Gouy
,
Ying Jiang
Information and Computation
119
(2), 1995, pp. 252-257
Improved dynamic dictionary matching
Amihood Amir
,
Martin Farach
,
Ramana M. Idury
,
Johannes A. la Poutré
,
Alejandro A. Schäffer
Information and Computation
119
(2), 1995, pp. 258-282
Simplifying the design of knowledge-based algorithms using knowledge consistency
Gil Neiger
Information and Computation
119
(2), 1995, pp. 283-293
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
Seiten
<
1
2
3
4
>