Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND YEAR=2004

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
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
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
Efficient tradeoff schemes in data structures for querying moving objects
Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu
Lecture Notes in Computer Science 3221, 2004, pp. 4-15
Swap and mismatch edit distance
Amihood Amir, Estrella Eisenberg, Ely Porat
Lecture Notes in Computer Science 3221, 2004, pp. 16-27
Path decomposition under a new cost measure with applications to optical network design
Elliot Anshelevich, Lisa Zhang
Lecture Notes in Computer Science 3221, 2004, pp. 28-39
Optimal external memory planar point enclosure
Lars Arge, Vasilis Samoladas, Ke Yi
Lecture Notes in Computer Science 3221, 2004, pp. 40-52
Maximizing throughput in multi-queue switches
Yossi Azar, Arik Litichevskey
Lecture Notes in Computer Science 3221, 2004, pp. 53-64
An improved algorithm for CIOQ switches
Yossi Azar, Yossi Richter
Lecture Notes in Computer Science 3221, 2004, pp. 65-76
Labeling smart dust
Vikas Bansal, Friedhelm Meyer auf der Heide, Christian Sohler
Lecture Notes in Computer Science 3221, 2004, pp. 77-88
Graph decomposition lemmas and their role in metric embedding methods
Yair Bartal
Lecture Notes in Computer Science 3221, 2004, pp. 89-97
Modeling locality: A probabilistic analysis of LRU and FWF
Luca Becchetti
Lecture Notes in Computer Science 3221, 2004, pp. 98-109

Seiten < 1 2 3 4 5 6 7 8 9 10 11 12 >