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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The cost of becoming anonymous: On the participant payload in Crowds
Hongfei Sui
,
Jianxin Wang
,
Jianer Chen
,
Songqiao Chen
Information Processing Letters
90
(2), 2004, pp. 81-86
An optimal storage format for sparse matrices
Eurípides Montagne
,
Anand Ekambaram
Information Processing Letters
90
(2), 2004, pp. 87-92
A note on point location in arrangements of hyperplanes
Ding Liu
Information Processing Letters
90
(2), 2004, pp. 93-95
A note on 3D orthogonal drawings with direction constrained edges
Emilio di Giacomo
,
Giuseppe Liotta
,
Maurizio Patrignani
Information Processing Letters
90
(2), 2004, pp. 97-101
On numerically decipherable codes and their homophonic partitions
A. Savelli
Information Processing Letters
90
(3), 2004, pp. 103-108
Quantum symmetrically-private information retrieval
Iordanis Kerenidis
,
Ronald de Wolf
Information Processing Letters
90
(3), 2004, pp. 109-114
The orthogonal
CNN
problem
Kazuo Iwama
,
Kouki Yonezawa
Information Processing Letters
90
(3), 2004, pp. 115-120
Approximate hotlink assignment
Evangelos Kranakis
,
Danny Krizanc
,
Sunil Shende
Information Processing Letters
90
(3), 2004, pp. 121-128
A direct algorithm for restricted rotation distance
Joan M. Lucas
Information Processing Letters
90
(3), 2004, pp. 129-134
Cycle detection using a stack
Gabriel Nivasch
Information Processing Letters
90
(3), 2004, pp. 135-140
Transforming pseudo-triangulations
Sergey Bereg
Information Processing Letters
90
(3), 2004, pp. 141-145
Relativized collapsing between
BPP
and
PH
under stringent oracle access
Jin-Yi Cai
,
Osamu Watanabe
Information Processing Letters
90
(3), 2004, pp. 147-154
The analysis of packet loss prediction for Gilbert-model with loss rate uplink
Yih-Ching Su
,
Chu-Sing Yang
,
Chen-Wei Lee
Information Processing Letters
90
(3), 2004, pp. 155-159
Factoring stochastic relations
Ernst-Erich Doberkat
Information Processing Letters
90
(4), 2004, pp. 161-166
Longest common subsequence between run-length-encoded strings: A new algorithm with improved parallelism
Valerio Freschi
,
Alessandro Bogliolo
Information Processing Letters
90
(4), 2004, pp. 167-173
A simple algorithm for the constrained sequence problems
Francis Y.L. Chin
,
Alfredo de Santis
,
Anna Lisa Ferrara
,
N.L. Ho
,
S.K. Kim
Information Processing Letters
90
(4), 2004, pp. 175-179
Constant time generation of derangements
James F. Korsh
,
Paul S. LaFollette
Information Processing Letters
90
(4), 2004, pp. 181-186
Probabilistic integer sorting
Alexandros V. Gerbessiotis
,
Constantinos J. Siniolakis
Information Processing Letters
90
(4), 2004, pp. 187-193
Polynomial time quantum computation with advice
Harumichi Nishimura
,
Tomoyuki Yamakami
Information Processing Letters
90
(4), 2004, pp. 195-204
Deterministic SkipNet
Nicholas J.A. Harvey
,
J. Ian Munro
Information Processing Letters
90
(4), 2004, pp. 205-208
Generating connected acyclic digraphs uniformly at random
Guy Melançon
,
Fabrice Philippe
Information Processing Letters
90
(4), 2004, pp. 209-213
Bipartite structure of all complex networks
Jean-Loup Guillaume
,
Matthieu Latapy
Information Processing Letters
90
(5), 2004, pp. 215-221
A functional correspondence between call-by-need evaluators and lazy abstract machines
Mads Sig Ager
,
Olivier Danvy
,
Jan Midtgaard
Information Processing Letters
90
(5), 2004, pp. 223-232
SPT is optimally competitive for uniprocessor flow
David P. Bunde
Information Processing Letters
90
(5), 2004, pp. 233-238
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
Petra S̑parl
,
Janez Z̑erovnik
Information Processing Letters
90
(5), 2004, pp. 239-246
Seiten
<
1
2
3
4
5
6
7
8
>