Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1449

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

Algorithmic approaches to information retrieval and data mining
Christos H. Papadimitriou
Lecture Notes in Computer Science 1449, 1998, pp. 1-1
Combinatorial problems arising in massive data sets
Fan Chung Graham
Lecture Notes in Computer Science 1449, 1998, pp. 2-2
Estimating parameters of monotone Boolean functions
Michael J. Fischer
Lecture Notes in Computer Science 1449, 1998, pp. 3-3
De-amortization of algorithms
S. Rao Kosaraju, Mihai Pop
Lecture Notes in Computer Science 1449, 1998, pp. 4-14
On computing new classes of optimal triangulations with angular constraints
Yang Dai, Naoki Katoh
Lecture Notes in Computer Science 1449, 1998, pp. 15-24
Maximum weight triangulation and its application on graph drawing
Cao An Wang, Francis Y. Chin, Bo Ting Yang
Lecture Notes in Computer Science 1449, 1998, pp. 25-34
The colored sector search tree: A dynamic data structure for efficient high dimensional nearest-foreign-neighbor queries
T. Graf, V. Kamakoti, N.S. Janaki Latha, C. Pandu Rangan
Lecture Notes in Computer Science 1449, 1998, pp. 35-44
Space-efficient algorithms for approximating polygonal curves in two dimensional space
Danny Z. Chen, Ovidiu Daescu
Lecture Notes in Computer Science 1449, 1998, pp. 45-54
Parallel geometric algorithms in coarse-grain network models
Mikhail J. Atallah, Danny Z. Chen
Lecture Notes in Computer Science 1449, 1998, pp. 55-64
On the Bahncard problem
Rudolf Fleischer
Lecture Notes in Computer Science 1449, 1998, pp. 65-74
The ultimate strategy to search on m rays?
Alejandro López-Ortiz, Sven Schuierer
Lecture Notes in Computer Science 1449, 1998, pp. 75-84
Better approximation of diagonal-flip transformation and rotation transformation
Ming Li, Louxin Zhang
Lecture Notes in Computer Science 1449, 1998, pp. 85-94
A cost optimal parallel algorithm for computing force field in N-body simulations
Guoliang Xue
Lecture Notes in Computer Science 1449, 1998, pp. 95-104
Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT
Mutsunori Yagiura, Toshihide Ibaraki
Lecture Notes in Computer Science 1449, 1998, pp. 105-116
Algorithms for almost-uniform generation with an unbiased binary source
Ömer Eğecioğlu, Marcus Peinado
Lecture Notes in Computer Science 1449, 1998, pp. 117-126
Improved algorithms for chemical threshold testing problems
Annalisa de Bonis, Luisa Gargano, Ugo Vaccaro
Lecture Notes in Computer Science 1449, 1998, pp. 127-136
Min-max-boundary domain decomposition
Marcos Kiwi, Daniel A. Spielman, Shang-Hua Teng
Lecture Notes in Computer Science 1449, 1998, pp. 137-146
On Boolean lowness and Boolean highness
Steffen Reith, Klaus W. Wagner
Lecture Notes in Computer Science 1449, 1998, pp. 147-156
The inherent dimension of bounded counting classes
Ulrich Hertrampf
Lecture Notes in Computer Science 1449, 1998, pp. 157-166
An exact characterization of symmetric functions in qAC^0[2]
Chi-Jen Lu
Lecture Notes in Computer Science 1449, 1998, pp. 167-173
Robust reductions
Jin-Yi Cai, Lane A. Hemaspaandra, Gerd Wechsung
Lecture Notes in Computer Science 1449, 1998, pp. 174-183
Approaches to effective semi-continuity of real functions
Vasco Brattka, Klaus Weihrauch, Xizhong Zheng
Lecture Notes in Computer Science 1449, 1998, pp. 184-193
On the power of additive combinatorial search model
Vladimir Grebinski
Lecture Notes in Computer Science 1449, 1998, pp. 194-203
The number of rearrangements in a 3-stage Clos network using an auxiliary switch
Frank K. Hwang, Wen-Dar Lin
Lecture Notes in Computer Science 1449, 1998, pp. 204-212
Lower bounds for wide-sense non-blocking Clos networks
Kuo-Hui Tsai, Da-Wei Wang
Lecture Notes in Computer Science 1449, 1998, pp. 213-218

Seiten 1 2 >