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=101
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An exercise in structural congruence
Joost Engelfriet
,
Tjalling Gelsema
Information Processing Letters
101
(1), 2007, pp. 1-5
Execution time analysis of a top-down
R
-tree construction algorithm
Houman Alborzi
,
Hanan Samet
Information Processing Letters
101
(1), 2007, pp. 6-12
Hardness results on the man-exchange stable marriage problem with short preference lists
Eric Mc Dermid
,
Christine Cheng
,
Ichiro Suzuki
Information Processing Letters
101
(1), 2007, pp. 13-19
Binary equality implication constraints, normal forms and data redundancy
Junhu Wang
Information Processing Letters
101
(1), 2007, pp. 20-25
An improved approximation ratio for the minimum linear arrangement problem
Uriel Feige
,
James R. Lee
Information Processing Letters
101
(1), 2007, pp. 26-29
Flows in dynamic networks with aggregate arc capacities
Vardges Melkonian
Information Processing Letters
101
(1), 2007, pp. 30-35
Linear-time algorithms for problems on planar graphs with fixed disk dimension
Faisal N. Abu-Khzam
,
Michael A. Langston
Information Processing Letters
101
(1), 2007, pp. 36-40
Minimal on-line labelling
Richard S. Bird
,
Stefan Sadnicki
Information Processing Letters
101
(1), 2007, pp. 41-45
Theorem-proving anonymity of infinite-state systems
Yoshinobu Kawabe
,
Ken Mano
,
Hideki Sakurada
,
Yasuyuki Tsukada
Information Processing Letters
101
(1), 2007, pp. 46-51
Simple deterministic wildcard matching
Peter Clifford
,
Raphaël Clifford
Information Processing Letters
101
(2), 2007, pp. 53-54
On the longest increasing subsequence of a circular list
M.H. Albert
,
M.D. Atkinson
,
Doron Nussbaum
,
Jörg-Rüdiger Sack
,
Nicola Santoro
Information Processing Letters
101
(2), 2007, pp. 55-59
Wait-free regular storage from Byzantine components
Ittai Abraham
,
Gregory Chockler
,
Idit Keidar
,
Dahlia Malkhi
Information Processing Letters
101
(2), 2007, pp. 60-65
Lower bounds on the OBDD size of two fundamental functions' graphs
Daniel Sawitzki
Information Processing Letters
101
(2), 2007, pp. 66-71
Isomorphic factorization, the Kronecker product and the line digraph
Yuuki Tanaka
,
Hiroyuki Kawai
,
Yukio Shibata
Information Processing Letters
101
(2), 2007, pp. 72-77
Bottom-up nearest neighbor search for
R
-trees
Moon Bae Song
,
Kwang Jin Park
,
Ki-Sik Kong
,
Sang Keun Lee
Information Processing Letters
101
(2), 2007, pp. 78-85
Bounds for the expected duration of the monopolist game
Eric Bach
Information Processing Letters
101
(2), 2007, pp. 86-92
Path bipancyclicity of hypercubes
Chang-Hsiung Tsai
,
Shu-Yun Jiang
Information Processing Letters
101
(3), 2007, pp. 93-97
On the longest path algorithm for reconstructing trees from distance matrices
Lev Reyzin
,
Nikhil Srivastava
Information Processing Letters
101
(3), 2007, pp. 98-100
An improved exact algorithm for the domatic number problem
Tobias Riege
,
Jörg Rothe
,
Holger Spakowski
,
Masaki Yamamoto
Information Processing Letters
101
(3), 2007, pp. 101-106
A power-set construction for reducing Büchi automata to non-determinism degree two
Ulrich Ultes-Nitsche
Information Processing Letters
101
(3), 2007, pp. 107-111
The hardness of the Expected Decision Depth problem
Dana Ron
,
Amir Rosenfeld
,
Salil Vadhan
Information Processing Letters
101
(3), 2007, pp. 112-118
On transitive orientations with restricted covering graphs
Maria Patricia Dobson
,
Marisa Gutierrez
,
Michel Habib
,
Jayme L. Szwarcfiter
Information Processing Letters
101
(3), 2007, pp. 119-125
The Ford-Johnson algorithm still unbeaten for less than 47 elements
Marcin Peczarski
Information Processing Letters
101
(3), 2007, pp. 126-128
Nonnegative integral subset representations of integer sets
Michael J. Collins
,
David Kempe
,
Jared Saia
,
Maxwell Young
Information Processing Letters
101
(3), 2007, pp. 129-133
Three-coloring planar graphs without short cycles
Min Chen
,
André Raspaud
,
Weifan Wang
Information Processing Letters
101
(3), 2007, pp. 134-138
Seiten 1
2
>