Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2719

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

Polarized process algebra and program equivalence
Jan A. Bergstra, Inge Bethke
Lecture Notes in Computer Science 2719, 2003, pp. 1-21
Problems on RNA secondary structure prediction and design
Anne Condon
Lecture Notes in Computer Science 2719, 2003, pp. 22-32
Some issues regarding search, censorship, and anonymity in peer to peer networks
Amos Fiat
Lecture Notes in Computer Science 2719, 2003, pp. 33-33
The SPQR-tree data structure in graph drawing
Petra Mutzel
Lecture Notes in Computer Science 2719, 2003, pp. 34-46
Model checking and testing combined
Doron Peled
Lecture Notes in Computer Science 2719, 2003, pp. 47-63
Logic and automata: A match made in heaven
Moshe Y. Vardi
Lecture Notes in Computer Science 2719, 2003, pp. 64-65
Pushdown automata and multicounter machines, a comparison of computation modes
Juraj Hromkovic̑, Georg Schnitger
Lecture Notes in Computer Science 2719, 2003, pp. 66-80
Generalized framework for selectors with applications in optimal group testing
Annalisa De Bonis, Leszek Ga̧sieniec, Ugo Vaccaro
Lecture Notes in Computer Science 2719, 2003, pp. 81-96
Decoding of interleaved reed Solomon codes over noisy data
Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung
Lecture Notes in Computer Science 2719, 2003, pp. 97-108
On the axiomatizability of ready traces, ready simulation, and failure traces
Stefan Blom, Wan Fokkink, Sumit Nain
Lecture Notes in Computer Science 2719, 2003, pp. 109-118
Resource access and mobility control with dynamic privileges acquisition
Daniele Gorla, Rosario Pugliese
Lecture Notes in Computer Science 2719, 2003, pp. 119-132
Replication vs. recursive definitions in channel based calculi
Nadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro
Lecture Notes in Computer Science 2719, 2003, pp. 133-144
Improved combinatorial approximation algorithms for the k-level facility location problem
Alexander Ageev, Yinyu Ye, Jiawei Zhang
Lecture Notes in Computer Science 2719, 2003, pp. 145-156
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
Markus Bläser
Lecture Notes in Computer Science 2719, 2003, pp. 157-163
An improved approximation algorithm for vertex cover with hard capacities
Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
Lecture Notes in Computer Science 2719, 2003, pp. 164-175
Approximation schemes for degree-restricted MST and red-blue separation problem
Sanjeev Arora, Kevin L. Chang
Lecture Notes in Computer Science 2719, 2003, pp. 176-188
Approximating Steiner k-cuts
Chandra Chekuri, Sudipto Guha, Joseph (Seffi) Naor
Lecture Notes in Computer Science 2719, 2003, pp. 189-199
MAX k-CUT and approximating the chromatic number of random graphs
Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani
Lecture Notes in Computer Science 2719, 2003, pp. 200-211
Approximation algorithm for directed telephone multicast problem
Michael Elkin, Guy Kortsarz
Lecture Notes in Computer Science 2719, 2003, pp. 212-223
Mixin modules and computational effects
Davide Ancona, Sonia Fagorzi, Eugenio Moggi, Elena Zucca
Lecture Notes in Computer Science 2719, 2003, pp. 224-238
Decision problems for language equations with Boolean operations
Alexander Okhotin
Lecture Notes in Computer Science 2719, 2003, pp. 239-251
Generalized rewrite theories
Roberto Bruni, José Meseguer
Lecture Notes in Computer Science 2719, 2003, pp. 252-266
Sophistication revisited
Luís Antunes, Lance Fortnow
Lecture Notes in Computer Science 2719, 2003, pp. 267-277
Scaled dimension and nonuniform complexity
John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
Lecture Notes in Computer Science 2719, 2003, pp. 278-290
Quantum search on bounded-error inputs
Peter Hyer, Michele Mosca, Ronald de Wolf
Lecture Notes in Computer Science 2719, 2003, pp. 291-299

Seiten 1 2 3 4 >