Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1276

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

Conflict-free access to templates of trees and hypercubes in parallel memory systems
Sajal K. Das, M. Cristina Pinotti
Lecture Notes in Computer Science 1276, 1997, pp. 1-10
Many-to-one packet routing via matchings
Danny Krizanc, Louxin Zhang
Lecture Notes in Computer Science 1276, 1997, pp. 11-17
A multi-tree generating routing scheme acyclic orientations
Fred S. Annexstein, Kenneth A. Berman, Ram Swaminathan
Lecture Notes in Computer Science 1276, 1997, pp. 18-22
An algorithm for Heilbronn's problem
Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann
Lecture Notes in Computer Science 1276, 1997, pp. 23-31
Optimal multiresolution polygonal approximation
K.W. Chan, Francis Y.L. Chin
Lecture Notes in Computer Science 1276, 1997, pp. 32-41
Constructing a strongly convex superhull of points
Wei Chen, Xiao Wen Deng, Koichi Wada, Kimio Kawaguchi
Lecture Notes in Computer Science 1276, 1997, pp. 42-51
Fast range searching with Delaunay triangulations
Binhai Zhu
Lecture Notes in Computer Science 1276, 1997, pp. 52-61
Resolution of Hartmanis' conjecture for NL-hard sparse sets
Jin-Yi Cai, D. Sivakumar
Lecture Notes in Computer Science 1276, 1997, pp. 62-71
Can large fanin circuits perform reliable computations in the presence of noise?
Rüdiger Reischuk
Lecture Notes in Computer Science 1276, 1997, pp. 72-81
On set systems with restricted intersections modulo a composite number
Vince Grolmusz
Lecture Notes in Computer Science 1276, 1997, pp. 82-90
Size and variable ordering of OBDDs representing threshold functions
Yasuhiko Takenaga, Mitsushi Nouzoe, Shuzo Yajima
Lecture Notes in Computer Science 1276, 1997, pp. 91-100
The performance of neighbor-joining algorithms of phylogeny reconstruction
Kevin Atteson
Lecture Notes in Computer Science 1276, 1997, pp. 101-110
Inferring evolutionary trees with strong combinatorial evidence
Vincent Berry, Olivier Gascuel
Lecture Notes in Computer Science 1276, 1997, pp. 111-123
Parsimony is hard to beat!
Kenneth Rice, Tandy Warnow
Lecture Notes in Computer Science 1276, 1997, pp. 124-133
On the complexity of computing evolutionary trees
Leszek Ga̧sieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
Lecture Notes in Computer Science 1276, 1997, pp. 134-145
Computable invariance
Vasco Brattka
Lecture Notes in Computer Science 1276, 1997, pp. 146-155
Subclasses of computable real valued functions
Qing Zhou
Lecture Notes in Computer Science 1276, 1997, pp. 156-165
Computability on continuous, lower semi-continuous and upper semi-continuous real functions
Klaus Weihrauch, Xizhong Zheng
Lecture Notes in Computer Science 1276, 1997, pp. 166-175
Contrast-optimal k out of n secret sharing schemes in visual cryptography
Thomas Hofmeister, Matthias Krause, Hans U. Simon
Lecture Notes in Computer Science 1276, 1997, pp. 176-185
A Rabin-type scheme based on y^2 \equiv x^3+bx^2 mod n
Seng Kiat Chua, San Ling
Lecture Notes in Computer Science 1276, 1997, pp. 186-191
Optimal bidding algorithms against cheating in multiple-object auctions
Ming-Yang Kao, Junfeng Qi, Lei Tan
Lecture Notes in Computer Science 1276, 1997, pp. 192-201
Spring algorithms and symmetry
Peter Eades, Xuemin Lin
Lecture Notes in Computer Science 1276, 1997, pp. 202-211
Generalized vertex-rankings of partial k-trees
Md. Abul Kashem, Xiao Zhou, Takao Nishizeki
Lecture Notes in Computer Science 1276, 1997, pp. 212-221
A selected tour of the theory of identification matrices
Lin Chen
Lecture Notes in Computer Science 1276, 1997, pp. 222-231
Efficient domination on permutation graphs and trapezoid graphs
Y. Daniel Liang, Chin Lung Lu, Chuan Yi Tang
Lecture Notes in Computer Science 1276, 1997, pp. 232-241

Seiten 1 2 3 >