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=Theor.~Comput.~Sci. AND Volume=84
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Languages and scanners
D. Beauquier
,
J.-E. Pin
Theoretical Computer Science
84
, 1991, pp. 3-21
Constant-round perfect zero-knowledge computationally convincing protocols
Gilles Brassard
,
Claude Crépeau
,
Moti Yung
Theoretical Computer Science
84
, 1991, pp. 23-52
Maximal codes with bounded deciphering delay
Véronique Bruyère
Theoretical Computer Science
84
, 1991, pp. 53-76
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
Bernard Chazelle
,
Herbert Edelsbrunner
,
Leonidas J. Guibas
,
Micha Sharir
Theoretical Computer Science
84
, 1991, pp. 77-105
A pointer-free data structure for merging heaps and min-max heaps
Giorgio Gambosi
,
Enrico Nardelli
,
Maurizio Talamo
Theoretical Computer Science
84
, 1991, pp. 107-126
Shortest paths without a map
Christos H. Papadimitriou
,
Mihalis Yannakakis
Theoretical Computer Science
84
, 1991, pp. 127-150
On zero-testing and interpolation of
k
-sparse multivariate polynomials over finite fields
Michael Clausen
,
Andreas Dress
,
Johannes Grabmeier
,
Marek Karpinski
Theoretical Computer Science
84
, 1991, pp. 151-164
Generalized automata on infinite trees and Muller-McNaughton's theorem
A. Saoudi
Theoretical Computer Science
84
, 1991, pp. 165-177
Optimal covering of cacti by vertex-disjoint paths
Shlomo Moran
,
Yaron Wolfstahl
Theoretical Computer Science
84
, 1991, pp. 179-197
Bounded queries to SAT and the Boolean hierarchy
Richard Beigel
Theoretical Computer Science
84
, 1991, pp. 199-223
Computations over finite monoids and their test complexity
Bernd Becker
,
Uwe Sparmann
Theoretical Computer Science
84
, 1991, pp. 225-250
Bounded delay L codes
H.A. Maurer
,
A. Salomaa
,
D. Wood
Theoretical Computer Science
84
, 1991, pp. 265-279
Deterministic soliton automata with a single exterior mode
J. Dassow
,
H. Jürgensen
Theoretical Computer Science
84
, 1991, pp. 281-292
Multidimensional trees
William A. Baldwin
,
George O. Strawn
Theoretical Computer Science
84
, 1991, pp. 293-311