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
[2]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
How to prevent interaction of functional and inclusion dependencies
Mark Levene
,
George Loizou
Information Processing Letters
71
(3-4), 1999, pp. 115-125
Tree precedence in scheduling: The strong-weak distinction
M. Dror
,
W. Kubiak
,
J.Y.-T. Leung
Information Processing Letters
71
(3-4), 1999, pp. 127-134
A matched approximation bound for the sum of a greedy coloring
Amotz Bar-Noy
,
Magnús M. Halldórsson
,
Guy Kortsarz
Information Processing Letters
71
(3-4), 1999, pp. 135-140
An interesting way to partition a number
P.C.P. Bhatt
Information Processing Letters
71
(3-4), 1999, pp. 141-148
Hamming weights of correlation immune Boolean functions
Subhamoy Maitra
,
Palash Sarkar
Information Processing Letters
71
(3-4), 1999, pp. 149-153
A simple bivalency proof that
t
-resilient consensus requires
t+1
rounds
Marcos Kawazoe Aguilera
,
Sam Toueg
Information Processing Letters
71
(3-4), 1999, pp. 155-158
The complexity of some complementation problems
David A. Plaisted
,
Gregory Kucherov
Information Processing Letters
71
(3-4), 1999, pp. 159-165
The cost of graceful degradation for omission failures
Prasad Jayanti
,
Tushar Deepak Chandra
,
Sam Toueg
Information Processing Letters
71
(3-4), 1999, pp. 167-172
Min of mat is not necessarily mat
Jürgen Dassow
,
Gheorghe Păun
Information Processing Letters
71
(5-6), 1999, pp. 175-177
Cyclic arrangements and Roudneff's conjecture in the space
J.L. Ramírez Alfonsín
Information Processing Letters
71
(5-6), 1999, pp. 179-182
Selecting small ranks in EREW PRAM
Sarnath Ramnath
,
Venkatesh Raman
Information Processing Letters
71
(5-6), 1999, pp. 183-186
A note on randomized mutual search
Zvi Lotker
,
Boaz Patt-Shamir
Information Processing Letters
71
(5-6), 1999, pp. 187-191
Counter machines
Arkadiusz Wojna
Information Processing Letters
71
(5-6), 1999, pp. 193-197
A fast algorithm for building lattices
Lhouari Nourine
,
Olivier Raynaud
Information Processing Letters
71
(5-6), 1999, pp. 199-204
A linear-time algorithm for solving the center problem on weighted cactus graphs
Yu-Feng Lan
,
Yue-Li Wang
,
Hitoshi Suzuki
Information Processing Letters
71
(5-6), 1999, pp. 205-212
On temporal aggregate processing based on time points
Jong Soo Kim
,
Sung Tak Kang
,
Myoung Ho Kim
Information Processing Letters
71
(5-6), 1999, pp. 213-220
Structural tolerance and Delaunay triangulation
Manuel Abellanas
,
Ferran Hurtado
,
Pedro A. Ramos
Information Processing Letters
71
(5-6), 1999, pp. 221-227
Communication errors in the
\pi
-calculus are undecidable
Vasco T. Vasconcelos
,
António Ravara
Information Processing Letters
71
(5-6), 1999, pp. 229-233
A note on deflection worm routing on meshes
Antonios Symvonis
Information Processing Letters
71
(5-6), 1999, pp. 235-239
Parametricity and variants of Girard's
J
operator
Robert Harper
,
John C. Mitchell
Information Processing Letters
70
(1), 1999, pp. 1-5
Loopless generation of Gray codes for
k
-ary trees
James F. Korsh
,
Paul LaFollette
Information Processing Letters
70
(1), 1999, pp. 7-11
On edge-disjoint spanning trees in hypercubes
Benjamin Barden
,
Ran Libeskind-Hadas
,
Janet Davis
,
William Williams
Information Processing Letters
70
(1), 1999, pp. 13-16
Maximum weight triangulation and graph drawing
Cao An Wang
,
Francis Y. Chin
,
Bo Ting Yang
Information Processing Letters
70
(1), 1999, pp. 17-22
On finite representations of infinite-state behaviours
Antonín Kuc̑era
Information Processing Letters
70
(1), 1999, pp. 23-30
In-place sorting with fewer moves
Jyrki Katajainen
,
Tomi A. Pasanen
Information Processing Letters
70
(1), 1999, pp. 31-37
Seiten
<
1
2
3
4
5
6
7
>