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 Volume=108
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On handshakes in random graphs
Akka Zemmari
Information Processing Letters
108
(3), 2008, pp. 119-123
N
-rationality of a certain class of formal series
Sylvain Lavallée
Information Processing Letters
108
(3), 2008, pp. 124-126
Managing module dependencies to facilitate continuous testing
Brad Long
Information Processing Letters
108
(3), 2008, pp. 127-131
Consecutive block minimization is 1.5-approximable
Salim Haddadi
,
Zoubir Layouni
Information Processing Letters
108
(3), 2008, pp. 132-135
An algorithm for partitioning trees augmented with sibling edges
Rajesh Bordawekar
,
Oded Shmueli
Information Processing Letters
108
(3), 2008, pp. 136-142
On the tractability of coloring semirandom graphs
Julia Böttcher
,
Dan Vilenchik
Information Processing Letters
108
(3), 2008, pp. 143-149
Quick encoding of plane graphs in
\log_2
14 bits per edge
Raquel Viaña
Information Processing Letters
108
(3), 2008, pp. 150-154
Online chasing problems for regular polygons
Hiroshi Fujiwara
,
Kazuo Iwama
,
Kouki Yonezawa
Information Processing Letters
108
(3), 2008, pp. 155-159
An impossibility about failure detectors in the iterated immediate snapshot model
Sergio Rajsbaum
,
Michel Raynal
,
Corentin Travers
Information Processing Letters
108
(3), 2008, pp. 160-164
Some digraphs arising from number theory and remarks on the zero-divisor graph of the ring
Z_n
Joanna Skowronek-Kaziów
Information Processing Letters
108
(3), 2008, pp. 165-169
An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
Min Ji
,
T.C.E. Cheng
Information Processing Letters
108
(4), 2008, pp. 171-174
Distortion lower bounds for line embeddings
Claire Mathieu
,
Charalampos Papamanthou
Information Processing Letters
108
(4), 2008, pp. 175-178
A one-time signature using run-length encoding
Rainer Steinwandt
,
Viktória I. Villányi
Information Processing Letters
108
(4), 2008, pp. 179-185
A note on computing set overlap classes
Pierre Charbit
,
Michel Habib
,
Vincent Limouzy
,
Fabien de Montgolfier
,
Mathieu Raffinot
,
Michaël Rao
Information Processing Letters
108
(4), 2008, pp. 186-191
A conceptual model for negotiating in service-oriented environments
Jyhjong Lin
Information Processing Letters
108
(4), 2008, pp. 192-203
An improved particle swarm optimization algorithm for flowshop scheduling problem
Changsheng Zhang
,
Jigui Sun
,
Xingjun Zhu
,
Qingyun Yang
Information Processing Letters
108
(4), 2008, pp. 204-209
On the false-positive rate of Bloom filters
Prosenjit Bose
,
Hua Guo
,
Evangelos Kranakis
,
Anil Maheshwari
,
Pat Morin
,
Jason Morrison
,
Michiel Smid
,
Yihui Tang
Information Processing Letters
108
(4), 2008, pp. 210-213
Lower bounds on online deadline scheduling with preemption penalties
Stanley P.Y. Fung
Information Processing Letters
108
(4), 2008, pp. 214-218
On the Positive-Negative Partial Set Cover problem
Pauli Miettinen
Information Processing Letters
108
(4), 2008, pp. 219-221
Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees
Volker Heun
Information Processing Letters
108
(4), 2008, pp. 222-225
The hub number of a graph
Tracy Grauman
,
Stephen G. Hartke
,
Adam Jobson
,
Bill Kinnersley
,
Douglas B. West
,
Lesley Wiglesworth
,
Pratik Worah
,
Hehui Wu
Information Processing Letters
108
(4), 2008, pp. 226-228
PSPACE-completeness of an escape problem
Yasuhiko Takenaga
,
Shigeru Arai
Information Processing Letters
108
(4), 2008, pp. 229-233
Extending the geometric build-up algorithm for the molecular distance geometry problem
Ricardo dos Santos Carvalho
,
Carlile Lavor
,
Fábio Protti
Information Processing Letters
108
(4), 2008, pp. 234-237
Complexity of approximation of 3-edge-coloring of graphs
Martin Kochol
,
Nad'a Krivon̑áková
,
Silvia Smejová
,
Katarína S̑ranková
Information Processing Letters
108
(4), 2008, pp. 238-241
A note on partially ordered tree automata
P.-C. Héam
Information Processing Letters
108
(4), 2008, pp. 242-246
Seiten
<
1
2
3
4
>