Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1741

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

The engineering of some bipartite matching programs
Kurt Mehlhorn
Lecture Notes in Computer Science 1741, 1999, pp. 1-3
General splay: A basic theory and calculus
G.F. Georgakopoulos, D.J. McClurkin
Lecture Notes in Computer Science 1741, 1999, pp. 4-17
Static dictionaries supporting rank
Venkatesh Raman, S. Srinivasa Rao
Lecture Notes in Computer Science 1741, 1999, pp. 18-26
Multiple spinblock decisions
Peter Damaschke
Lecture Notes in Computer Science 1741, 1999, pp. 27-36
Asynchronous random polling dynamic load balancing
Peter Sanders
Lecture Notes in Computer Science 1741, 1999, pp. 37-48
Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability
Daya Ram Gaur, Ramesh Krishnamurti
Lecture Notes in Computer Science 1741, 1999, pp. 49-55
Hardness of approximating independent domination in circle graphs
Mirela Damian-Iordache, Sriram V. Pemmaraju
Lecture Notes in Computer Science 1741, 1999, pp. 56-69
Constant-factor approximation algorithms for domination problems on circle graphs
Mirela Damian-Iordache, Sriram V. Pemmaraju
Lecture Notes in Computer Science 1741, 1999, pp. 70-82
Ordered binary decision diagrams as knowledge-bases
Takashi Horiyama, Toshihide Ibaraki
Lecture Notes in Computer Science 1741, 1999, pp. 83-92
Hard tasks for weak robots: The role of common knowledge in pattern formation by autonomous mobile robots
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
Lecture Notes in Computer Science 1741, 1999, pp. 93-102
On-line load balancing of temporary tasks revisited
Kar-Keung To, Wai-Ha Wong
Lecture Notes in Computer Science 1741, 1999, pp. 103-112
Online routing in triangulations
Prosenjit Bose, Pat Morin
Lecture Notes in Computer Science 1741, 1999, pp. 113-122
The query complexity of program checking by constant-depth circuits
V. Arvind, K.V. Subrahmanyan, N.V. Vinodchandran
Lecture Notes in Computer Science 1741, 1999, pp. 123-132
Tree-like resolution is superpolynomially slower than DAG-like resolution for the pigeonhole principle
Kazuo Iwama, Shuichi Miyazaki
Lecture Notes in Computer Science 1741, 1999, pp. 133-142
Efficient approximation algorithms for multi-label map labeling
Binhai Zhu, C.K. Poon
Lecture Notes in Computer Science 1741, 1999, pp. 143-152
Approximation algorithms in batch processing
Xiaotie Deng, Chung Keung Poon, Yuzhong Zhang
Lecture Notes in Computer Science 1741, 1999, pp. 153-162
LexBFS-ordering in asteroidal triple-free graphs
Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko
Lecture Notes in Computer Science 1741, 1999, pp. 163-172
Parallel algorithms for shortest paths and related problems on trapezoid graphs
F.R. Hsu, Yaw-Ling Lin, Yin-Te Tsai
Lecture Notes in Computer Science 1741, 1999, pp. 173-182
Approximation algorithms for some clustering and classification problems
Eva Tardos
Lecture Notes in Computer Science 1741, 1999, pp. 183-183
How many people can hide in a terrain?
Stephan Eidenbenz
Lecture Notes in Computer Science 1741, 1999, pp. 184-194
Carrying umbrellas: An online relocation problem on graphs
Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa
Lecture Notes in Computer Science 1741, 1999, pp. 195-204
Survivable networks with bounded delay: The edge failure case
Serafino Cicerone, Gabriele di Stefano, Dagmar Handke
Lecture Notes in Computer Science 1741, 1999, pp. 205-214
Energy-efficient initialization protocols for ad-hoc radio networks
J.L. Bordim, J. Cui, T. Hayashi, K. Nakano, S. Olariu
Lecture Notes in Computer Science 1741, 1999, pp. 215-224
Constructing the suffix tree of a tree with a large alphabet
Tetsuo Shibuya
Lecture Notes in Computer Science 1741, 1999, pp. 225-236
An O(1) time algorithm for generating multiset permutations
Tadao Takaoka
Lecture Notes in Computer Science 1741, 1999, pp. 237-246

Seiten 1 2 >