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: Series=LNCS AND Volume=2387
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On crossing numbers of 5-regular graphs
G.L. Chia
,
C.S. Gan
Lecture Notes in Computer Science
2387
, 2002, pp. 230-237
Maximum flows and critical vertices in AND/OR graphs
Yvo Desmedt
,
Yongge Wang
Lecture Notes in Computer Science
2387
, 2002, pp. 238-248
New energy-efficient permutation routing protocol for single-hop radio networks
Amitava Datta
,
Albert Y. Zomaya
Lecture Notes in Computer Science
2387
, 2002, pp. 249-258
Simple mutual exclusion algorithms based on bounded tickets on the asynchronous shared memory model
Masataka Takamura
,
Yoshihide Igarashi
Lecture Notes in Computer Science
2387
, 2002, pp. 259-268
Time and energy optimal list ranking algorithms on the
k
-channel broadcast communication model
Koji Nakano
Lecture Notes in Computer Science
2387
, 2002, pp. 269-278
Energy-efficient size approximation of radio networks with no collision detection
Tomasz Jurdziński
,
Mirosƚaw Kutyƚowski
,
Jan Zatopiański
Lecture Notes in Computer Science
2387
, 2002, pp. 279-289
A new class of symbolic abstract neural nets: Tissue
P
systems
C. Martín-Vide
,
J. Pazos
,
G. Păun
,
A. Rodríguez-Patón
Lecture Notes in Computer Science
2387
, 2002, pp. 290-299
Transducers with set output
Jurek Czyzowicz
,
Wojciech Fraczak
,
Andrzej Pelc
Lecture Notes in Computer Science
2387
, 2002, pp. 300-309
Self-assembling finite automata
Andreas Klein
,
Martin Kutrib
Lecture Notes in Computer Science
2387
, 2002, pp. 310-319
Repetition complexity of words
Lucian Ilie
,
Sheng Yu
,
Kaizhong Zhang
Lecture Notes in Computer Science
2387
, 2002, pp. 320-329
Using PageRank to characterize Web structure
Gopal Pandurangan
,
Prabhakar Raghavan
,
Eli Upfal
Lecture Notes in Computer Science
2387
, 2002, pp. 330-339
On randomized broadcasting and gossiping in radio networks
Ding Liu
,
Manoj Prabhakaran
Lecture Notes in Computer Science
2387
, 2002, pp. 340-349
Fast and dependable communication in hyper-rings
Tom Altman
,
Yoshihide Igarashi
,
Kazuhiro Motegi
Lecture Notes in Computer Science
2387
, 2002, pp. 350-359
The on-line Heilbronn's triangle problem in three and four dimensions
Gill Barequet
Lecture Notes in Computer Science
2387
, 2002, pp. 360-369
Algorithms for normal curves and surfaces
Marcus Schaefer
,
Eric Sedgwick
,
Daniel S̑tefankovic̑
Lecture Notes in Computer Science
2387
, 2002, pp. 370-380
Terrain polygon decomposition, with application to layered manufacturing
Ivaylo Ilinkin
,
Ravi Janardan
,
Michiel Smid
Lecture Notes in Computer Science
2387
, 2002, pp. 381-390
Supertrees by flipping
D. Chen
,
O. Eulenstein
,
David Fernández-Baca
,
M. Sanderson
Lecture Notes in Computer Science
2387
, 2002, pp. 391-400
A space and time efficient algorithm for constructing compressed suffix arrays
Tak-Wah Lam
,
Kunihiko Sadakane
,
Wing-Kin Sung
,
Siu-Ming Yiu
Lecture Notes in Computer Science
2387
, 2002, pp. 401-410
Sharpening Occam's razor
Ming Li
,
John Tromp
,
Paul Vitányi
Lecture Notes in Computer Science
2387
, 2002, pp. 411-419
Approximating 3D points with cylindrical segments
Binhai Zhu
Lecture Notes in Computer Science
2387
, 2002, pp. 420-429
Algorithms for the multicolorings of partial
k
-trees
Takehiro Ito
,
Takao Nishizeki
,
Xiao Zhou
Lecture Notes in Computer Science
2387
, 2002, pp. 430-439
A fault-tolerant merge sorting algorithm
B. Ravikumar
Lecture Notes in Computer Science
2387
, 2002, pp. 440-447
2-compromise usability in 1-dimensional statistical databases
Ljiljana Branković
,
Jozef S̑irán̑
Lecture Notes in Computer Science
2387
, 2002, pp. 448-455
An experimental study and comparison of topological peeling and topological walk
Danny Z. Chen
,
Shuang Luan
,
Jinhui Xu
Lecture Notes in Computer Science
2387
, 2002, pp. 456-466
On-line maximizing the number of items packed in variable-sized bins
Leah Epstein
,
Lene M. Favrholdt
Lecture Notes in Computer Science
2387
, 2002, pp. 467-475
Seiten
<
1
2
3
>