Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3328

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

Genome Halving Problem revisited
Max A. Alekseyev, Pavel A. Pevzner
Lecture Notes in Computer Science 3328, 2004, pp. 1-15
Verifying probabilistic procedural programs
Javier Esparza, Kousha Etessami
Lecture Notes in Computer Science 3328, 2004, pp. 16-31
Streaming algorithms for geometric problems
Piotr Indyk
Lecture Notes in Computer Science 3328, 2004, pp. 32-34
Toward a grainless semantics for shared-variable concurrency
John C. Reynolds
Lecture Notes in Computer Science 3328, 2004, pp. 35-48
Regular languages, unambiguous concatenation and computational complexity
Denis Thérien
Lecture Notes in Computer Science 3328, 2004, pp. 49-57
Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed Petri nets
Parosh Abdulla, Pritha Mahata, Richard Mayr
Lecture Notes in Computer Science 3328, 2004, pp. 58-70
On the urgency expressiveness
Michaël Adélaïde, Claire Pagetti
Lecture Notes in Computer Science 3328, 2004, pp. 71-83
Asynchronous automata-theoretic characterization of aperiodic trace languages
Bharat Adsul, Milind Sohoni
Lecture Notes in Computer Science 3328, 2004, pp. 84-96
A decidable fragment of separation logic
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
Lecture Notes in Computer Science 3328, 2004, pp. 97-109
Approximate range searching using binary space partitions
Mark de Berg, Micha Streppel
Lecture Notes in Computer Science 3328, 2004, pp. 110-121
Representable disjoint NP-pairs
Olaf Beyersdorff
Lecture Notes in Computer Science 3328, 2004, pp. 122-134
Symbolic reachability analysis of higher-order context-free processes
Ahmed Bouajjani, Antoine Meyer
Lecture Notes in Computer Science 3328, 2004, pp. 135-147
Optimal strategies in priced timed game automata
Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim G. Larsen
Lecture Notes in Computer Science 3328, 2004, pp. 148-160
A calculus for trust management
Marco Carbone, Mogens Nielsen, Vladimiro Sassone
Lecture Notes in Computer Science 3328, 2004, pp. 161-173
Short-cuts on star, source and planar unfoldings
Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar
Lecture Notes in Computer Science 3328, 2004, pp. 174-185
Subdividing alpha complex
Ho-lun Cheng, Tony Tan
Lecture Notes in Computer Science 3328, 2004, pp. 186-197
Real-counter automata and their decision problems
Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie
Lecture Notes in Computer Science 3328, 2004, pp. 198-210
Adjunct elimination through games in static ambient logic
Anuj Dawar, Philippa Gardner, Giorgio Ghelli
Lecture Notes in Computer Science 3328, 2004, pp. 211-223
On the bisimulation invariant fragment of monadic \Sigma_1 in the finite
Anuj Dawar, David Janin
Lecture Notes in Computer Science 3328, 2004, pp. 224-236
On the complexity of Hilbert's 17th problem
Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi
Lecture Notes in Computer Science 3328, 2004, pp. 237-249
Who is pointing when to whom? On the automated verification of linked list structures
Dino Distefano, Joost-Pieter Katoen, Arend Rensink
Lecture Notes in Computer Science 3328, 2004, pp. 250-262
An almost linear time approximation algorithm for the permanent of a random (0-1) matrix
Martin Fürer, Shiva Prasad Kasiviswanathan
Lecture Notes in Computer Science 3328, 2004, pp. 263-274
Distributed games with causal memory are decidable for series-parallel systems
Paul Gastin, Benjamin Lerman, Marc Zeitoun
Lecture Notes in Computer Science 3328, 2004, pp. 275-286
Expand, enlarge, and check: New algorithms for the coverability problem of WSTS
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
Lecture Notes in Computer Science 3328, 2004, pp. 287-298
Minimum weight pseudo-triangulations
Joachim Gudmundsson, Christos Levcopoulos
Lecture Notes in Computer Science 3328, 2004, pp. 299-310

Seiten 1 2 >