Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1738

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

Recent developments in the theory of arrangements of surfaces
Micha Sharir
Lecture Notes in Computer Science 1738, 1999, pp. 1-20
Dynamic compressed hyperoctrees with application to the N-body problem
Srinivas Aluru, Fatih E. Sevilgen
Lecture Notes in Computer Science 1738, 1999, pp. 21-33
Largest empty rectangle among a point set
Jeet Chaudhuri, Subhas C. Nandy
Lecture Notes in Computer Science 1738, 1999, pp. 34-46
Renaming is necessary in timed regular expressions
Philippe Herrmann
Lecture Notes in Computer Science 1738, 1999, pp. 47-59
Product interval automata: A subclass of timed automata
Deepak D'Souza, P.S. Thiagarajan
Lecture Notes in Computer Science 1738, 1999, pp. 60-71
The complexity of rebalancing a binary search tree
Rolf Fagerberg
Lecture Notes in Computer Science 1738, 1999, pp. 72-83
Fast allocation and deallocation with an improved buddy system
Erik D. Demaine, Ian J. Munro
Lecture Notes in Computer Science 1738, 1999, pp. 84-96
Optimal bounds for transformations of \omega-automata
Christof Löding
Lecture Notes in Computer Science 1738, 1999, pp. 97-109
CTL^+ is exponentially more succinct than CTL
Thomas Wilke
Lecture Notes in Computer Science 1738, 1999, pp. 110-121
A top-down look at a secure message
Martín Abadi, Cédric Fournet, Georges Gonthier
Lecture Notes in Computer Science 1738, 1999, pp. 122-141
Explaining updates by minimal sums
Jürgen Dix, Karl Schlechta
Lecture Notes in Computer Science 1738, 1999, pp. 142-154
A foundation for hybrid knowledge bases
James J. Lu, Neil V. Murray, Erik Rosenthal
Lecture Notes in Computer Science 1738, 1999, pp. 155-167
Hoare logic for mutual recursion and local variables
David von Oheimb
Lecture Notes in Computer Science 1738, 1999, pp. 168-180
Explicit substitutions and programming languages
Jean-Jacques Lévy, Luc Maranget
Lecture Notes in Computer Science 1738, 1999, pp. 181-200
Approximation algorithms for routing and call scheduling in all-optical chains and rings
Luca Becchetti, Miriam di Ianni, Alberto Marchetti-Spaccamela
Lecture Notes in Computer Science 1738, 1999, pp. 201-212
A randomized algorithm for flow shop scheduling
Naveen Garg, Sachin Jain, Chaitanya Swamy
Lecture Notes in Computer Science 1738, 1999, pp. 213-218
Synthesizing distributed transition systems from global specifications
Ilaria Castellani, Madhavan Mukund, P.S. Thiagarajan
Lecture Notes in Computer Science 1738, 1999, pp. 219-231
Beyond region graphs: Symbolic forward analysis of timed automata
Supratik Mukhopadhyay, Andreas Podelski
Lecture Notes in Computer Science 1738, 1999, pp. 232-244
Implicit temporal query languages: Towards completeness
Nicole Bidoit, Sandra de Amo
Lecture Notes in Computer Science 1738, 1999, pp. 245-257
On the undecidability of some sub-classical first-order logics
Matthias Baaz, Agata Ciabattoni, Christian Fermüller, Helmut Veith
Lecture Notes in Computer Science 1738, 1999, pp. 258-268
How to compute with DNA
Lila Kari, Mark Daley, Greg Gloor, Rani Siromoney, Laura F. Landweber
Lecture Notes in Computer Science 1738, 1999, pp. 269-282
A high girth graph construction and a lower bound for hitting set size for combinatorial rectangles
L. Sunil Chandran
Lecture Notes in Computer Science 1738, 1999, pp. 283-290
Protecting facets in layered manufacturing
Jörg Schwerdt, Michiel Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi
Lecture Notes in Computer Science 1738, 1999, pp. 291-303
The receptive distributed \pi-calculus
Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine
Lecture Notes in Computer Science 1738, 1999, pp. 304-315
Series and parallel operations on pomsets
Zoltán Ésik, Satoshi Okawa
Lecture Notes in Computer Science 1738, 1999, pp. 316-328

Seiten 1 2 >