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.~Process.~Lett. AND Volume=42
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on approximate linear programming
Nimrod Megiddo
Information Processing Letters
42
, 1992, pp. 53
On the structural grammatical inference problem for some classes of context-free grammars
Erkki Mäkinen
Information Processing Letters
42
, 1992, pp. 1-5
Towards an understanding of unbounded variables in asynchronous systems
Ambuj K. Singh
Information Processing Letters
42
, 1992, pp. 7-17
A linear time algorithm for graph partition problems
L.H. Clark
,
F. Shahrokhi
,
L.A. Székely
Information Processing Letters
42
, 1992, pp. 19-24
A lower bound for the nondeterministic space complexity of context-free recognition
Helmut Alt
,
Viliam Geffert
,
Kurt Mehlhorn
Information Processing Letters
42
, 1992, pp. 25-27
Detecting cycles through three fixed vertices in a graph
Herbert Fleischner
,
Gerhard J. Woeginger
Information Processing Letters
42
, 1992, pp. 29-33
Computing the minimum weight triangulation of a set of linearly ordered points
Henk Meijer
,
David Rappaport
Information Processing Letters
42
, 1992, pp. 35-38
On the routing problem in faulty supercubes
Arunabha Sen
,
Abhijit Sengupta
,
Subir Bandyopadhyay
Information Processing Letters
42
, 1992, pp. 39-46
Effective use of memory in iterative deepening search
U.K. Sarkar
,
P.P. Chakrabarti
,
S. Ghose
,
S.C. De Sarkar
Information Processing Letters
42
, 1992, pp. 47-52
Optimal time bounds for some proximity problems in the plane
Alok Aggarwal
,
Herbert Edelsbrunner
,
Prabhakar Raghavan
,
Prasoon Tiwari
Information Processing Letters
42
, 1992, pp. 55-60
Scheduling real-time computations with separation constraints
Ching-Chih Han
,
Kwei-Jay Lin
Information Processing Letters
42
, 1992, pp. 61-66
Additive weights of a special class of nonuniformly distributed backtrack trees
Uwe Trier
Information Processing Letters
42
, 1992, pp. 67-76
Batch checking with applications to linear functions
Ronitt Rubinfeld
Information Processing Letters
42
, 1992, pp. 77-80
An almost-constant round interactive zero-knowledge proof
Mike Burmester
Information Processing Letters
42
, 1992, pp. 81-87
The parallel complexity of coarsest set partition problems
Sang Cho
,
Dung T. Huynh
Information Processing Letters
42
, 1992, pp. 89-94
Optimal total exchange for a 3-D torus of processors
Brigitte Plateau
,
Denis Trystam
Information Processing Letters
42
, 1992, pp. 95-102
A LISP programming exercise
Jan L.A. van de Snepscheut
Information Processing Letters
42
, 1992, pp. 103-108
Detecting embedded Horn structure in propositional logic
V. Chandru
,
J.N. Hooker
Information Processing Letters
42
, 1992, pp. 109-111
An optimal algorithm for reconstructing a binary tree
V. Kamakoti
,
C. Pandu Rangan
Information Processing Letters
42
, 1992, pp. 113-115
A note on the reconstruction of a binary tree from its traversals
Naveen Gabrani
,
Priti Shankar
Information Processing Letters
42
, 1992, pp. 117-119
Complexity of the closest vector problem in a lattice generated by
(0,1)
-matrix
Boleslaw K. Szymanski
,
Balaram Sinharoy
Information Processing Letters
42
, 1992, pp. 121-126
Which finite monoids are syntactic monoids of rational
\omega
-languages
Phan Trung Huy
,
Igor Livotsky
,
Do Long Van
Information Processing Letters
42
, 1992, pp. 127-132
On the editing distance between unordered labeled trees
Kaizhong Zhang
,
Rick Statman
,
Dennis Shasha
Information Processing Letters
42
, 1992, pp. 133-139
Optimal value for the Newton-Raphson division algorithm
A. Parker
,
J.O. Hamblen
Information Processing Letters
42
, 1992, pp. 141-144
Average case complexity under the universal distribution equals worst-case complexity
Ming Li
,
Paul M.B. Vitányi
Information Processing Letters
42
, 1992, pp. 145-149
Seiten 1
2
3
>