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=67
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Strongly sequential and inductively sequential term rewriting systems
Michael Hanus
,
Salvador Lucas
,
Aart Middeldorp
Information Processing Letters
67
(1), 1998, pp. 1-8
Uniform multipaging reduces to paging
Vincenzo Liberatore
Information Processing Letters
67
(1), 1998, pp. 9-12
Successful visual human-computer interaction is undecidable
Paolo Bottoni
,
Stefano Levialdi
,
Gheorghe Păun
Information Processing Letters
67
(1), 1998, pp. 13-19
A data-parallel algorithm for minimum-width tree layout
Wuu Yang
Information Processing Letters
67
(1), 1998, pp. 21-28
A variation on the zero-one law
Andreas Blass
,
Yuri Gurevich
,
Vladik Kreinovich
,
Luc Longpré
Information Processing Letters
67
(1), 1998, pp. 29-30
The homogeneous set sandwich problem
Márcia R. Cerioli
,
Hazel Everett
,
Celina M.H. de Figueiredo
,
Sulamita Klein
Information Processing Letters
67
(1), 1998, pp. 31-35
Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes
Jan Johannsen
Information Processing Letters
67
(1), 1998, pp. 37-41
Extending reduction orderings to ACU-compatible reduction orderings
Uwe Waldmann
Information Processing Letters
67
(1), 1998, pp. 43-49
Finding the detour-critical edge of a shortest path between two nodes
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Information Processing Letters
67
(1), 1998, pp. 51-54
Improved algorithms for group testing with inhibitors
Annalisa de Bonis
,
Ugo Vaccaro
Information Processing Letters
67
(2), 1998, pp. 57-64
On fixed priority scheduling, offsets and co-prime task periods
N.C. Audsley
,
A. Burns
Information Processing Letters
67
(2), 1998, pp. 65-69
Coloring random graphs
Michael Krivelevich
,
Benny Sudakov
Information Processing Letters
67
(2), 1998, pp. 71-74
Learning nearly monotone
k
-term DNF
Jorge Castro
,
David Guijarro
,
Víctor Lavín
Information Processing Letters
67
(2), 1998, pp. 75-79
On Kolmogorov complexity in the real Turing machine setting
J.L. Montaña
,
Luis M. Pardo
Information Processing Letters
67
(2), 1998, pp. 81-86
A lower bound for depth-3 circuits with MOD
m
-gates
Vince Grolmusz
Information Processing Letters
67
(2), 1998, pp. 87-90
Fast nondeterministic recognition of context-free languages using two queues
Burton Rosenberg
Information Processing Letters
67
(2), 1998, pp. 91-93
Kleene's three-valued logic and process algebra
Jan A. Bergstra
,
Alban Ponse
Information Processing Letters
67
(2), 1998, pp. 95-103
A linear time algorithm for the bottleneck Traveling Salesman problem on a Halin graph
Jeffrey Mark Phillips
,
Abraham P. Punnen
,
S.N. Kabadi
Information Processing Letters
67
(2), 1998, pp. 105-110
Automata and forbidden words
M. Crochmore
,
F. Mignosi
,
A. Restivo
Information Processing Letters
67
(3), 1998, pp. 111-117
Transition systems from event structures revisited
Mila Majster-Cederbaum
,
Markus Roggenbach
Information Processing Letters
67
(3), 1998, pp. 119-124
An approximation algorithm for the maximum Traveling Salesman problem
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
67
(3), 1998, pp. 125-130
Randomized group testing for mutually obscuring defectives
Peter Damaschke
Information Processing Letters
67
(3), 1998, pp. 131-135
Optimal alphabetic trees for binary search
T.C. Hu
,
P.A. Tucker
Information Processing Letters
67
(3), 1998, pp. 137-140
An optimal parallel algorithm for sorting multisets
Sanguthevar Rajasekaran
Information Processing Letters
67
(3), 1998, pp. 141-143
Weakest preconditions for pure Prolog programs
Dino Pedreschi
,
Salvatore Ruggieri
Information Processing Letters
67
(3), 1998, pp. 145-150
Seiten 1
2
3
>