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 YEAR=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dynamic Shannon coding
Travis Gagie
Information Processing Letters
102
(2-3), 2007, pp. 113-117
An empirical study on classification methods for alarms from a bug-finding static C analyzer
Kwangkeun Yi
,
Hosik Choi
,
Jaehwang Kim
,
Yongdai Kim
Information Processing Letters
102
(2-3), 2007, pp. 118-123
A note on the size of minimal covers
Vaston Costa
,
Edward Haeusler
,
Eduardo S. Laber
,
Loana Nogueira
Information Processing Letters
102
(2-3), 2007, pp. 124-126
Multi-designated verifiers signatures: Anonymity without encryption
Fabien Laguillaumie
,
Damien Vergnaud
Information Processing Letters
102
(2-3), 2007, pp. 127-132
A note on secret sharing schemes with three homogeneous access structure
Jaume Martí-Farré
Information Processing Letters
102
(4), 2007, pp. 133-137
How to safely close a discussion
Gildas Avoine
,
Serge Vaudenay
Information Processing Letters
102
(4), 2007, pp. 138-142
Fast and simple algorithms to count the number of vertex covers in an interval graph
Min-Sheng Lin
Information Processing Letters
102
(4), 2007, pp. 143-146
The game chromatic number and the game colouring number of cactuses
Elżbieta Sidorowicz
Information Processing Letters
102
(4), 2007, pp. 147-151
Multidimensional heaps and complementary range searching
Peter Brass
Information Processing Letters
102
(4), 2007, pp. 152-155
Preferential deletion in dynamic models of web-like networks
Narsingh Deo
,
Aurel Cami
Information Processing Letters
102
(4), 2007, pp. 156-162
Chromatic distribution of
k
-nearest neighbors of a line segment in a planar colored point set
Partha P. Goswami
,
Sandip Das
,
Subhas C. Nandy
Information Processing Letters
102
(4), 2007, pp. 163-168
An in-place algorithm for Klee's measure problem in two dimensions
Jan Vahrenhold
Information Processing Letters
102
(4), 2007, pp. 169-174
k
-restricted rotation distance between binary trees
Fabrizio Luccio
,
Antonio Mesa Enriquez
,
Linda Pagli
Information Processing Letters
102
(5), 2007, pp. 175-180
A linear-time algorithm for Euclidean feature transform sets
Wim H. Hesselink
Information Processing Letters
102
(5), 2007, pp. 181-186
Nonstationary Poisson modeling of web browsing session arrivals
Edward Chlebus
,
Jordy Brazier
Information Processing Letters
102
(5), 2007, pp. 187-190
Adjacency queries in dynamic sparse graphs
Łukasz Kowalik
Information Processing Letters
102
(5), 2007, pp. 191-195
A study of fault tolerance in star graph
Shahram Latifi
Information Processing Letters
102
(5), 2007, pp. 196-200
A variant of the Ford-Johnson algorithm that is more space efficient
Mauricio Ayala-Rincón
,
Bruno T. de Abreu
,
José de Siqueira
Information Processing Letters
102
(5), 2007, pp. 201-207
Robust parametric reachability for timed automata
Laurent Doyen
Information Processing Letters
102
(5), 2007, pp. 208-213
Minimum cycle bases of direct products of complete graphs
Richard Hammack
Information Processing Letters
102
(5), 2007, pp. 214-218
Lower bounds for testing Euclidean Minimum Spanning trees
Oren Ben-Zwi
,
Oded Lachish
,
Ilan Newman
Information Processing Letters
102
(6), 2007, pp. 219-225
Fault diameter of product graphs
Jun-Ming Xu
,
Chao Yang
Information Processing Letters
102
(6), 2007, pp. 226-228
Fast exact string matching algorithms
Thierry Lecroq
Information Processing Letters
102
(6), 2007, pp. 229-235
State explosion in almost-sure probabilistic reachability
François Laroussinie
,
Jeremy Sproston
Information Processing Letters
102
(6), 2007, pp. 236-241
Cycles embedding in hypercubes with node failures
Chang-Hsiung Tsai
Information Processing Letters
102
(6), 2007, pp. 242-246
Seiten
<
1
2
3
4
5
6
7
8
9
>