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=109
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient indexing of interval time sequences
Jong-Won Roh
,
Byoung-Kee Yi
Information Processing Letters
109
(1), 2008, pp. 1-12
Streaming tree automata
Olivier Gauwin
,
Joachim Niehren
,
Yves Roos
Information Processing Letters
109
(1), 2008, pp. 13-17
Pseudo-relevance feedback and statistical query expansion for web snippet generation
Youngjoong Ko
,
Hongkuk An
,
Jungyun Seo
Information Processing Letters
109
(1), 2008, pp. 18-22
Online hypergraph coloring
J. Nagy-György
,
Cs. Imreh
Information Processing Letters
109
(1), 2008, pp. 23-26
Deterministic
K
-set structure
Sumit Ganguly
,
Anirban Majumder
Information Processing Letters
109
(1), 2008, pp. 27-31
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
Leah Epstein
,
Asaf Levin
Information Processing Letters
109
(1), 2008, pp. 32-37
The Magnus-Derek game revisited
Cor A.J. Hurkens
,
Rudi A. Pendavingh
,
Gerhard J. Woeginger
Information Processing Letters
109
(1), 2008, pp. 38-40
A note on the size of OBDDs for the graph of integer multiplication
Beate Bollig
Information Processing Letters
109
(1), 2008, pp. 41-43
A note on the online First-Fit algorithm for coloring
k
-inductive graphs
Shakhar Smorodinsky
Information Processing Letters
109
(1), 2008, pp. 44-45
The parameterized complexity of probability amplification
J. Andrés Montoya
Information Processing Letters
109
(1), 2008, pp. 46-53
Triangulating input-constrained planar point sets
Martin Held
,
Joseph S.B. Mitchell
Information Processing Letters
109
(1), 2008, pp. 54-56
Online uniformity of integer points on a line
Tetsuo Asano
Information Processing Letters
109
(1), 2008, pp. 57-60
Planar tree transformation: Results and counterexample
Selim G. Akl
,
Kamrul Islam
,
Henk Meijer
Information Processing Letters
109
(1), 2008, pp. 61-67
Parameterized approximation of dominating set problems
Rodney G. Downey
,
Michael R. Fellows
,
Catherine McCartin
,
Frances Rosamond
Information Processing Letters
109
(1), 2008, pp. 68-70
Cyclic reference counting
Rafael Dueire Lins
Information Processing Letters
109
(1), 2008, pp. 71-78
A tree-covering problem arising in integrity of tree-structured data
Mikhail J. Atallah
,
Greg N. Frederickson
,
Ashish Kundu
Information Processing Letters
109
(1), 2008, pp. 79-82
On the expressibility of priority
Luca Aceto
,
Anna Ingolfsdottir
Information Processing Letters
109
(1), 2008, pp. 83-85
Cache-oblivious selection in sorted
X + Y
matrices
Mark de Berg
,
Shripad Thite
Information Processing Letters
109
(2), 2008, pp. 87-92
The relative neighbourhood graph is a part of every 30
^\circ
-triangulation
J. Mark Keil
,
Tzvetalin S. Vassilev
Information Processing Letters
109
(2), 2008, pp. 93-97
Anonymous graph exploration without collision by mobile robots
Roberto Baldoni
,
François Bonnet
,
Alessia Milani
,
Michel Raynal
Information Processing Letters
109
(2), 2008, pp. 98-103
Ready to preorder: The case of weak process semantics
Taolue Chen
,
Wan Fokkink
,
Rob van Glabbeek
Information Processing Letters
109
(2), 2008, pp. 104-111
Finding cycles in hierarchical hypercube networks
Ruei-Yu Wu
,
Gen-Huey Chen
,
Jung-Sheng Fu
,
Gerard J. Chang
Information Processing Letters
109
(2), 2008, pp. 112-115
Efficient geometric measure of music similarity
Hwei-Jen Lin
,
Hung-Hsuan Wu
Information Processing Letters
109
(2), 2008, pp. 116-120
A general mixing strategy for the ECB-Mix-ECB mode of operation
Palash Sarkar
Information Processing Letters
109
(2), 2008, pp. 121-123
The rotation graph of
k
-ary trees is Hamiltonian
Clemens Huemer
,
Ferran Hurtado
,
Julian Pfeifle
Information Processing Letters
109
(2), 2008, pp. 124-129
Seiten 1
2
3
4
5
6
7
8
9
10
11
>