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=87
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of finding balanced oneway cuts
Uriel Feige
,
Orly Yahalom
Information Processing Letters
87
(1), 2003, pp. 1-5
Exact complexity of Exact-Four-Colorability
Jörg Rothe
Information Processing Letters
87
(1), 2003, pp. 7-12
Detecting directed 4-cycles still faster
Friedrich Eisenbrand
,
Fabrizio Grandoni
Information Processing Letters
87
(1), 2003, pp. 13-15
A note on an expressiveness hierarchy for multi-exit iteration
Luca Aceto
,
Wan Fokkink
,
Anna Ingólfsdóttir
Information Processing Letters
87
(1), 2003, pp. 17-23
Functions that have read-once branching programs of quadratic size are not necessarily testable
Beate Bollig
,
Ingo Wegener
Information Processing Letters
87
(1), 2003, pp. 25-29
Non-clairvoyant scheduling for weighted flow time
Jae-Hoon Kim
,
Kyung-Yong Chwa
Information Processing Letters
87
(1), 2003, pp. 31-37
Tighter constant-factor time hierarchies
Amir M. Ben-Amram
Information Processing Letters
87
(1), 2003, pp. 39-44
k
-tuple domination in graphs
Chung-Shou Liao
,
Gerard J. Chang
Information Processing Letters
87
(1), 2003, pp. 45-50
Acyclic and
k
-distance coloring of the grid
Guillaume Fertin
,
Emmanuel Godard
,
André Raspaud
Information Processing Letters
87
(1), 2003, pp. 51-58
Optimal one-page tree embeddings in linear time
Robert A. Hochberg
,
Matthias F. Stallmann
Information Processing Letters
87
(2), 2003, pp. 59-66
On computing the semi-sum of two integers
Salvatore Ruggieri
Information Processing Letters
87
(2), 2003, pp. 67-71
Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor
Richard Nock
,
Tapio Elomaa
,
Matti Kääriäinen
Information Processing Letters
87
(2), 2003, pp. 73-78
Quantum zero-error algorithms cannot be composed
Harry Buhrman
,
Ronald de Wolf
Information Processing Letters
87
(2), 2003, pp. 79-84
The number of tests required to search an unordered table
Michael L. Fredman
Information Processing Letters
87
(2), 2003, pp. 85-88
Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
Chin-Chia Wu
,
Wen-Chiung Lee
Information Processing Letters
87
(2), 2003, pp. 89-93
Maximum number of edges joining vertices on a cube
Khaled A.S. Abdel-Ghaffar
Information Processing Letters
87
(2), 2003, pp. 95-99
A simple factor-3 approximation for labeling points with circles
Minghui Jiang
,
Jianbo Qian
,
Zhongping Qin
,
Binhai Zhu
,
Robert Cimikowski
Information Processing Letters
87
(2), 2003, pp. 101-105
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Tseng-Kuei Li
,
Chang-Hsiung Tsai
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Information Processing Letters
87
(2), 2003, pp. 107-110
Inclusion-exclusion for
k
-CNF formulas
Kazuyuki Amano
,
Kazuo Iwama
,
Akira Maruoka
,
Kenshi Matsuo
,
Akihiro Matsuura
Information Processing Letters
87
(2), 2003, pp. 111-117
Waiting time and complexity for matching patterns with automata
M. Crochemore
,
V.T. Stefanov
Information Processing Letters
87
(3), 2003, pp. 119-125
Using stable sets to bound the chromatic number
D. de Werra
,
P. Hansen
Information Processing Letters
87
(3), 2003, pp. 127-131
Axiomatizing functional dependencies in the higher-order entity-relationship model
Sven Hartmann
,
Anne Hoffmann
,
Sebastian Link
,
Klaus-Dieter Schewe
Information Processing Letters
87
(3), 2003, pp. 133-137
Inequality of finite behaviors of rational weight finite automata is in
R
B. Litow
Information Processing Letters
87
(3), 2003, pp. 139-145
A note on finding all homogeneous set sandwiches
Michel Habib
,
Emmanuelle Lebhar
,
Christophe Paul
Information Processing Letters
87
(3), 2003, pp. 147-151
A linear time recognition algorithm for proper interval graphs
B.S. Panda
,
Sajal K. Das
Information Processing Letters
87
(3), 2003, pp. 153-161
Seiten 1
2
3
>