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=35
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A short proof of the lexical addressing algorithm
Mitchell Wand
Information Processing Letters
35
, 1990, pp. 1-5
An
O(n\log n)
feasibility algorithm for preemptive scheduling of
n
independent jobs on a hypercube
Mohan Ahuja
,
Yahui Zhu
Information Processing Letters
35
, 1990, pp. 7-11
Computing the longest diagonal of a simple polygon
Alok Aggarwal
,
Subhash Suri
Information Processing Letters
35
, 1990, pp. 13-18
A model of reconfiguration in communicating sequential processes
Jeremy Jacob
Information Processing Letters
35
, 1990, pp. 19-22
Polygon nesting and robustness
Chderjit L. Bajaj
,
Tamal Dey
Information Processing Letters
35
, 1990, pp. 23-32
A public key cryptosystem based on Lyndon words
Rani Siromoney
,
Lisa Mathew
Information Processing Letters
35
, 1990, pp. 33-36
Dynamic deferred data structuring
Yu-Tai Ching
,
Kurt Mehlhorn
,
Michiel H.M. Smid
Information Processing Letters
35
, 1990, pp. 37-40
Routing in times square mode
E. Lodi
,
F. Luccio
,
L. Pagli
Information Processing Letters
35
, 1990, pp. 41-48
The cover time of a regular expander is
O(n\log n)
Ronitt Rubinfeld
Information Processing Letters
35
, 1990, pp. 49-51
Counterexample to a conjecture of Szymanski on hypercube routing
Anna Lubiw
Information Processing Letters
35
, 1990, pp. 57-61
Probabilistic self-stabilization
Tod Herman
Information Processing Letters
35
, 1990, pp. 63-67
Efficient expansion of factored expressions
G.R. Guenther
Information Processing Letters
35
, 1990, pp. 69-72
On a cyclic string-to-string correction problem
Maurice Maes
Information Processing Letters
35
, 1990, pp. 73-78
Pipelining tree-structured algorithms on SIMD architectures
D.T. Barnard
,
D.B. Skillicorn
Information Processing Letters
35
, 1990, pp. 79-84
Simplified linear-time Jordan sorting and polygon clipping
Khun Yee Fung
,
Tina M. Nicholl
,
Robert E. Tarjan
,
Christopher J. van Wyk
Information Processing Letters
35
, 1990, pp. 85-92
Obtaining lazy evaluation with continuations in scheme
Ching-lin Wang
Information Processing Letters
35
, 1990, pp. 93-97
Efficient simulation of circuits by EREW PRAMs
Ingo Wegener
Information Processing Letters
35
, 1990, pp. 99-102
On attribute grammars without attribute synthesis
Martha Sideris
Information Processing Letters
35
, 1990, pp. 103-109
A note on ambiguity in context-free grammars
Tom Altman
,
George Logothetis
Information Processing Letters
35
, 1990, pp. 111-114
Checking functional consistency in deductive databases
Erik Lambrichts
,
Peter Nees
,
Jan Paredaens
,
Peter Peelman
,
L. Tanca
Information Processing Letters
35
, 1990, pp. 115-120
Parallel construction of minimal suffix and factor automata
Maxime Crochemore
,
Wojciech Rytter
Information Processing Letters
35
, 1990, pp. 121-128
A metric for traces
Marta Z. Kwiatkowska
Information Processing Letters
35
, 1990, pp. 129-135
Hidden line elimination for isooriented rectangles
K. Mehlhorn
,
S. Näher
,
C. Uhrig
Information Processing Letters
35
, 1990, pp. 137-143
Endmarkers can make a difference
Moshe Y. Vardi
Information Processing Letters
35
, 1990, pp. 145-148
Linear algorithm for optimal path cover problem on interval graphs
Srinivasa Rao Arikati
,
C. Pandu Rangan
Information Processing Letters
35
, 1990, pp. 149-153
Seiten 1
2
3
>