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=74
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On bounded occurrence constraint satisfaction
Johan Håstad
Information Processing Letters
74
(1-2), 2000, pp. 1-6
A force-directed algorithm that preserves edge-crossing properties
François Bertault
Information Processing Letters
74
(1-2), 2000, pp. 7-13
Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order
Manfred Göbel
Information Processing Letters
74
(1-2), 2000, pp. 15-18
Approximating low-congestion routing and column-restricted packing problems
Alok Baveja
,
Aravind Srinivasan
Information Processing Letters
74
(1-2), 2000, pp. 19-25
The
\exists\forall^2
fragment of the first-order theory of atomic set constraints is
\Pi^0_1
-hard
Jean-Marc Talbot
Information Processing Letters
74
(1-2), 2000, pp. 27-33
On rewrite constraints and context unification
Joachim Niehren
,
Sophie Tison
,
Ralf Treinen
Information Processing Letters
74
(1-2), 2000, pp. 35-40
Variations on computing reciprocals of power series
Arnold Schönhage
Information Processing Letters
74
(1-2), 2000, pp. 41-46
Farmer's theorem revisited
Margus Veanes
Information Processing Letters
74
(1-2), 2000, pp. 47-53
A rely-guarantee discipline for open distributed systems design
Carlos H.C. Duarte
,
Tom Maibaum
Information Processing Letters
74
(1-2), 2000, pp. 55-63
On a generalized modularization theorem
Theodosis Dimitrakos
,
Tom Maibaum
Information Processing Letters
74
(1-2), 2000, pp. 65-71
Trackless online algorithms for the server problem
Wolfgang W. Bein
,
Lawrence L. Larmore
Information Processing Letters
74
(1-2), 2000, pp. 73-79
An algorithm for finding a
k
-median in a directed tree
Antoine Vigneron
,
Lixin Gao
,
Mordecai J. Golin
,
Giuseppe F. Italiano
,
Bo Li
Information Processing Letters
74
(1-2), 2000, pp. 81-88
Worst case examples for operations on OBDDs
Ingo Wegener
Information Processing Letters
74
(3-4), 2000, pp. 91-96
On the isomorphism of expressions
Sarnath Ramnath
,
Peiyi Zhao
Information Processing Letters
74
(3-4), 2000, pp. 97-102
On finding medians of weighted discrete points
Kuo-Liang Chung
Information Processing Letters
74
(3-4), 2000, pp. 103-106
Path-based depth-first search for strong and biconnected components
Harold N. Gabow
Information Processing Letters
74
(3-4), 2000, pp. 107-114
Finding and counting small induced subgraphs efficiently
Ton Kloks
,
Dieter Kratsch
,
Haiko Müller
Information Processing Letters
74
(3-4), 2000, pp. 115-121
A fast cost scaling algorithm for submodular flow
Satoru Iwata
,
S. Thomas McCormick
,
Maiko Shigeno
Information Processing Letters
74
(3-4), 2000, pp. 123-128
Recognizing cographs and threshold graphs through a classification of their edges
Stavros D. Nikolopoulos
Information Processing Letters
74
(3-4), 2000, pp. 129-139
A conservative scheme for parallel interval narrowing
Laurent Granvilliers
,
Gaétan Hains
Information Processing Letters
74
(3-4), 2000, pp. 141-146
A necessary condition for constructive negation in constraint logic programming
Agostino Dovier
,
Enrico Pontelli
,
Gianfranco Rossi
Information Processing Letters
74
(3-4), 2000, pp. 147-156
Generating all maximal models of a Boolean expression
Dimitris J. Kavvadias
,
Martha Sideri
,
Elias C. Stavropoulos
Information Processing Letters
74
(3-4), 2000, pp. 157-162
Statistical delay analysis on an ATM switch with self-similar input traffic
Joseph Kee-Yin Ng
,
Shibin Song
,
Wei Zhao
Information Processing Letters
74
(3-4), 2000, pp. 163-173
On distribution properties of sequences with perfect linear complexity profile
Markus Schneider
Information Processing Letters
74
(3-4), 2000, pp. 175-182
Triangulations without minimum-weight drawing
Cao An Wang
,
Francis Y. Chin
,
Boting Yang
Information Processing Letters
74
(5-6), 2000, pp. 183-189
Seiten 1
2
>