Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1872

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

Reconciling two views of cryptography (The computational soundness of formal encryption)
Martín Abadi, Phillip Rogaway
Lecture Notes in Computer Science 1872, 2000, pp. 3-22
Theory and construction of molecular computers
Masami Hagiya
Lecture Notes in Computer Science 1872, 2000, pp. 23-24
List decoding: Algorithms and applications
Madhu Sudan
Lecture Notes in Computer Science 1872, 2000, pp. 25-41
Approximation algorithms for string folding problems
Giancarlo Mauri, Giulio Pavesi
Lecture Notes in Computer Science 1872, 2000, pp. 45-58
An index for two dimensional string matching allowing rotations
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
Lecture Notes in Computer Science 1872, 2000, pp. 59-75
Parallel edge coloring of a tree on a mesh connected computer
Chang-Sung Jeong, Sung-Up Cho, Sun-Chul Whang, Mi-Young Choi
Lecture Notes in Computer Science 1872, 2000, pp. 76-83
Parallel approximation algorithms for maximum weighted matching in general graphs
Ryuhei Uehara, Zhi-Zhong Chen
Lecture Notes in Computer Science 1872, 2000, pp. 84-98
It is on the boundary: Complexity considerations for polynomial ideals
Ernst W. Mayr
Lecture Notes in Computer Science 1872, 2000, pp. 99-99
An efficient parallel algorithm for scheduling interval ordered tasks
Yoojin Chung, Kunsoo Park, Hyuk-Chul Kwon
Lecture Notes in Computer Science 1872, 2000, pp. 100-111
Task distributions on multiprocessor systems
Evgeny V. Shchepin, Nodari N. Vakhania
Lecture Notes in Computer Science 1872, 2000, pp. 112-125
Fast interpolation using Kohonen self-organizing neural networks
Olivier Sarzeaud, Yann Stéphan
Lecture Notes in Computer Science 1872, 2000, pp. 126-139
Steganography using modern arts
Carlo Blundo, Clemente Galdi
Lecture Notes in Computer Science 1872, 2000, pp. 140-151
Trade-offs between density and robustness in random interconnection graphs
Philippe Flajolet, Kostas Hatzis, Sotiris Nikoletseas, Paul Spirakis
Lecture Notes in Computer Science 1872, 2000, pp. 152-168
The (\sigma+1)-edge-connectivity augmentation problem without creating multiple edges of a graph
Satoshi Taoka, Toshimasa Watanabe
Lecture Notes in Computer Science 1872, 2000, pp. 169-185
On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
Sounaka Mishra, Kripasindhu Sikdar
Lecture Notes in Computer Science 1872, 2000, pp. 186-199
Maximum clique and minimum clique partition in visibility graphs
Stephan Eidenbenz, Christoph Stamm
Lecture Notes in Computer Science 1872, 2000, pp. 200-212
Real-time language recognition by alternating cellular automata
Thomas Buchholz, Andreas Klein, Martin Kutrib
Lecture Notes in Computer Science 1872, 2000, pp. 213-225
Damage spreading and \mu-sensitivity on cellular automata
Bruno Martin
Lecture Notes in Computer Science 1872, 2000, pp. 226-242
Discrepancy theory and its application to finance
Shu Tezuka
Lecture Notes in Computer Science 1872, 2000, pp. 243-256
Fully consistent extensions of partially defined Boolean functions with missing bits
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
Lecture Notes in Computer Science 1872, 2000, pp. 257-272
Characterization of optimal key set protocols
Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
Lecture Notes in Computer Science 1872, 2000, pp. 273-285
On the complexity of integer programming in the Blum-Shub-Smale computational model
Valentin E. Brimkov, Stefan S. Dantchev
Lecture Notes in Computer Science 1872, 2000, pp. 286-300
On logarithmic simulated annealing
Andreas Albrecht, Chak-Kuen Wong
Lecture Notes in Computer Science 1872, 2000, pp. 301-314
Hierarchical state machines
Mihalis Yannakakis
Lecture Notes in Computer Science 1872, 2000, pp. 315-330
Ambient groups and mobility types
Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon
Lecture Notes in Computer Science 1872, 2000, pp. 333-347

Seiten 1 2 >