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=96
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Embedding the incomplete hypercube in books
Jywe-Fei Fang
,
Kuan-Chou Lai
Information Processing Letters
96
(1), 2005, pp. 1-6
On the dynamic extent of delimited continuations
Dariusz Biernacki
,
Olivier Danvy
,
Chung-chieh Shan
Information Processing Letters
96
(1), 2005, pp. 7-17
Modified subset sum heuristics for bin packing
Alberto Caprara
,
Ulrich Pferschy
Information Processing Letters
96
(1), 2005, pp. 18-23
Optimal many-to-one routing on the mesh with constant queues
Andrea Pietracaprina
,
Geppino Pucci
Information Processing Letters
96
(1), 2005, pp. 24-29
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Alain Finkel
,
Jérôme Leroux
Information Processing Letters
96
(1), 2005, pp. 30-35
A mutual exclusion algorithm with optimally bounded bypasses
K. Alagarsamy
Information Processing Letters
96
(1), 2005, pp. 36-40
Visibility representation of plane graphs via canonical ordering tree
Huaming Zhang
,
Xin He
Information Processing Letters
96
(2), 2005, pp. 41-48
On the Hamiltonicity of the Cartesian product
Vassilios V. Dimakopoulos
,
Leonidas Palios
,
Athanasios S. Poulakidas
Information Processing Letters
96
(2), 2005, pp. 49-53
Structural soundness of workflow nets is decidable
Ferucio Laurenţiu Ţiplea
,
Dan Cristian Marinescu
Information Processing Letters
96
(2), 2005, pp. 54-58
Bases for Boolean co-clones
Elmar Böhler
,
Steffen Reith
,
Henning Schnoor
,
Heribert Vollmer
Information Processing Letters
96
(2), 2005, pp. 59-66
Lower bounds on treespan
Dieter Rautenbach
Information Processing Letters
96
(2), 2005, pp. 67-70
Secure multiplication of shared secrets in the exponent
Rosario Gennaro
,
Mario Di Raimondo
Information Processing Letters
96
(2), 2005, pp. 71-79
The labeled perfect matching in bipartite graphs
Jérôme Monnot
Information Processing Letters
96
(3), 2005, pp. 81-88
Computing sparse permanents faster
Rocco A. Servedio
,
Andrew Wan
Information Processing Letters
96
(3), 2005, pp. 89-92
Tight bounds on plurality
Nikhil Srivastava
,
Alan D. Taylor
Information Processing Letters
96
(3), 2005, pp. 93-95
Partial known plaintext attack on Koyama scheme
Sahadeo Padhye
Information Processing Letters
96
(3), 2005, pp. 96-100
A quadratic-time DBM-based successor algorithm for checking timed automata
Jianhua Zhao
,
Xuandong Li
,
Guoliang Zheng
Information Processing Letters
96
(3), 2005, pp. 101-105
On the average depth of asymmetric
LC
-tries
Yuriy A. Reznik
Information Processing Letters
96
(3), 2005, pp. 106-113
A framework for pursuit evasion games in
R^n
Swastik Kopparty
,
Chinya V. Ravishankar
Information Processing Letters
96
(3), 2005, pp. 114-122
The super connectivity of shuffle-cubes
Jun-Ming Xu
,
Min Xu
,
Qiang Zhu
Information Processing Letters
96
(4), 2005, pp. 123-127
Minimum degree triangulation for rectangular domains
Pangfeng Liu
Information Processing Letters
96
(4), 2005, pp. 128-135
Edge-pancyclicity of Möbius cubes
Min Xu
,
Jun-Ming Xu
Information Processing Letters
96
(4), 2005, pp. 136-140
Bounded families for the on-line
t
-relaxed coloring
Agostino Capponi
,
Concetta Pilotto
Information Processing Letters
96
(4), 2005, pp. 141-145
Edge-fault-tolerant edge-bipancyclicity of hypercubes
Jun-Ming Xu
,
Zheng-Zhong Du
,
Min Xu
Information Processing Letters
96
(4), 2005, pp. 146-150
A lower bound for computing Oja depth
Greg Aloupis
,
Erin McLeish
Information Processing Letters
96
(4), 2005, pp. 151-153
Seiten 1
2
>