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=92
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Searching a polygonal region by a group of stationary
k
-searchers
Masafumi Yamashita
,
Ichiro Suzuki
,
Tiko Kameda
Information Processing Letters
92
(1), 2004, pp. 1-8
Trading uninitialized space for time
Gabriel Valiente
Information Processing Letters
92
(1), 2004, pp. 9-13
The super laceability of the hypercubes
Chung-Haw Chang
,
Cheng-Kuan Lin
,
Hua-Min Huang
,
Lih-Hsing Hsu
Information Processing Letters
92
(1), 2004, pp. 15-21
A strong lower bound for approximate nearest neighbor searching
Ding Liu
Information Processing Letters
92
(1), 2004, pp. 23-29
Generalized honeycomb torus is Hamiltonian
Xiaofan Yang
,
David J. Evans
,
Hongjian Lai
,
Graham M. Megson
Information Processing Letters
92
(1), 2004, pp. 31-37
Graph compression and the zeros of polynomials
B. Litow
,
N. Deo
Information Processing Letters
92
(1), 2004, pp. 39-44
A symbolic approach for content-based information filtering
Byron L.D. Bezerra
,
Francisco de A.T. de Carvalho
Information Processing Letters
92
(1), 2004, pp. 45-52
Darts and hoopla board design
S.A. Curtis
Information Processing Letters
92
(1), 2004, pp. 53-56
Finding the maximum common subgraph of a partial
k
-tree and a graph with a polynomially bounded number of spanning trees
Atsuko Yamaguchi
,
Kiyoko F. Aoki
,
Hiroshi Mamitsuka
Information Processing Letters
92
(2), 2004, pp. 57-63
A note on the oriented chromatic number of grids
Andrzej Szepietowski
,
Monika Targan
Information Processing Letters
92
(2), 2004, pp. 65-70
A 1.235 lower bound on the number of points needed to draw all
n
-vertex planar graphs
Maciej Kurowski
Information Processing Letters
92
(2), 2004, pp. 95-98
A compression method for prefix-sum cubes
Heum-Geun Kang
,
Jun-Ki Min
,
Seok-Ju Chun
,
Chin-Wan Chung
Information Processing Letters
92
(2), 2004, pp. 99-105
A classification of tournaments having an acyclic tournament as a minimum feedback arc set
Garth Isaak
,
Darren A. Narayan
Information Processing Letters
92
(3), 2004, pp. 107-111
Global roundings of sequences
Benjamin Doerr
Information Processing Letters
92
(3), 2004, pp. 113-116
Finding next-to-shortest paths in a graph
I. Krasikov
,
S.D. Noble
Information Processing Letters
92
(3), 2004, pp. 117-119
On the symmetric angle-restricted nearest neighbor problem
Alok Aggarwal
,
Youngcheul Wee
Information Processing Letters
92
(3), 2004, pp. 121-126
A note on quadratic residuosity and
UP
Jin-Yi Cai
,
Robert A. Threlfall
Information Processing Letters
92
(3), 2004, pp. 127-131
An efficient cache conscious multi-dimensional index structure
Jeong Min Shim
,
Seok Il Song
,
Jae Soo Yoo
,
Young Soo Min
Information Processing Letters
92
(3), 2004, pp. 133-142
On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
Igor E. Shparlinski
Information Processing Letters
92
(3), 2004, pp. 143-147
Dynamic programming solution for multiple query optimization problem
Ismail H. Toroslu
,
Ahmet Cosar
Information Processing Letters
92
(3), 2004, pp. 149-155
Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
George Davie
Information Processing Letters
92
(3), 2004, pp. 157-160
Acyclic colorings of subcubic graphs
San Skulrattanakulchai
Information Processing Letters
92
(4), 2004, pp. 161-167
Computing unique canonical covers for simple FDs via transitive reduction
Jens Lechtenbörger
Information Processing Letters
92
(4), 2004, pp. 169-174
On the algebraic complexity of set equality and inclusion
Irit Katriel
Information Processing Letters
92
(4), 2004, pp. 175-178
An optimal parallel algorithm for
c
-vertex-ranking of trees
Md. Abul Kashem
,
M. Ziaur Rahman
Information Processing Letters
92
(4), 2004, pp. 179-184
Seiten 1
2
>