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=90
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Addition chains with a bounded number of registers
Richard Parker
,
Andrew Plater
Information Processing Letters
90
(5), 2004, pp. 247-252
Efficient processing of subsequence matching with the Euclidean metric in time-series databases
Sang-Wook Kim
,
Dae-Hyun Park
,
Heon-Gil Lee
Information Processing Letters
90
(5), 2004, pp. 253-260
The complexity of deciding stability under FFS in the adversarial queueing model
C. Àlvarez
,
M. Blesa
,
J. Díaz
,
A. Fernández
,
M. Serna
Information Processing Letters
90
(5), 2004, pp. 261-266
A fixed-parameter tractable algorithm for matrix domination
Mark Weston
Information Processing Letters
90
(5), 2004, pp. 267-272
An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
J. Breit
Information Processing Letters
90
(6), 2004, pp. 273-278
New upper bounds on feedback vertex numbers in butterflies
Maw-Shang Chang
,
Chin-Hua Lin
,
Chuan-Min Lee
Information Processing Letters
90
(6), 2004, pp. 279-285
Using a minimal number of resets when testing from a finite state machine
R.M. Hierons
Information Processing Letters
90
(6), 2004, pp. 287-292
A single-point mutation evolutionary programming
Mingjun Ji
,
Huanwen Tang
,
Juan Guo
Information Processing Letters
90
(6), 2004, pp. 293-299
A lower bound for testing juntas
Hana Chockler
,
Dan Gutfreund
Information Processing Letters
90
(6), 2004, pp. 301-305
A limit characterization for the number of spanning trees of graphs
S.D. Nikolopoulos
,
C. Nomikos
,
P. Rondogiannis
Information Processing Letters
90
(6), 2004, pp. 307-313
Seiten
<
1
2