Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1180

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

Circuit complexity before the dawn of the new millennium
Eric Allender
Lecture Notes in Computer Science 1180, 1996, pp. 1-18
A lambda calculus with letrecs and barriers
Arvind, Jan-Willem Maessen, Rishiyur S. Nikhil, Joseph Stoy
Lecture Notes in Computer Science 1180, 1996, pp. 19-36
Tables
J. Ian Munro
Lecture Notes in Computer Science 1180, 1996, pp. 37-42
Mechanized formal methods: Progress and prospects
John Rushby
Lecture Notes in Computer Science 1180, 1996, pp. 43-51
The parameter space of the d-step conjecture
J.C. Lagarias, N. Prabhu, J.A. Reeds
Lecture Notes in Computer Science 1180, 1996, pp. 52-63
On the complexity of approximating Euclidean Traveling Salesman tours and minimum spanning trees
Gautam Das, Sanjieev Kapoor, Michiel Smid
Lecture Notes in Computer Science 1180, 1996, pp. 64-75
Efficient computation of rectilinear geodesic Voronoi neighbor in presence of obstacles
Pinaki Mitra, Subhas C. Nandy
Lecture Notes in Computer Science 1180, 1996, pp. 76-87
Weak bisimulation and model checking for basic parallel processes
Richard Mayr
Lecture Notes in Computer Science 1180, 1996, pp. 88-99
Testing processes for efficiency
Kamal Jain, S. Arun-Kumar
Lecture Notes in Computer Science 1180, 1996, pp. 100-110
Regularity is decidable for normed PA processes in polynomial time
Antonín Kuc̑era
Lecture Notes in Computer Science 1180, 1996, pp. 111-122
Dynamic maintenance of shortest path trees in simple polygons
Sanjiv Kapoor, Tripurari Singh
Lecture Notes in Computer Science 1180, 1996, pp. 123-134
Close approximations of minimum rectangular coverings
Christos Levcopoulos, Joachim Gudmundsson
Lecture Notes in Computer Science 1180, 1996, pp. 135-146
A new competitive algorithm for agent searching in unknown streets
Pallab Dasgupta, P.P. Chakrabarti, S.C. DeSarkar
Lecture Notes in Computer Science 1180, 1996, pp. 147-155
On the design of hybrid control systems using automata models
Dang Van Hung, Wang Ji
Lecture Notes in Computer Science 1180, 1996, pp. 156-167
Constraint retraction in FD
Philippe Codognet, Daniel Diaz, Francesca Rossi
Lecture Notes in Computer Science 1180, 1996, pp. 168-179
Winskel is (almost) right: Towards a mechanized semantics textbook
Tobias Nipkow
Lecture Notes in Computer Science 1180, 1996, pp. 180-192
An optimal deterministic algorithm for online b-matching
Bala Kalyanasundaram, Kirk Pruhs
Lecture Notes in Computer Science 1180, 1996, pp. 193-199
Tight bounds for prefetching and buffer management algorithms for parallel I/O systems
Peter J. Varman, Rakesh M. Verma
Lecture Notes in Computer Science 1180, 1996, pp. 200-211
Complexity of the gravitational method for linear programming
T.L. Morin, N. Prabhu, Z. Zhang
Lecture Notes in Computer Science 1180, 1996, pp. 212-223
Optimal and information theoretic syntactic pattern recognition involving traditional and transposition errors
B.J. Oommen, R.K.S. Loke
Lecture Notes in Computer Science 1180, 1996, pp. 224-237
Minimal relative normalization in orthogonal expression reduction systems
John Glauert, Zurab Khasidashvili
Lecture Notes in Computer Science 1180, 1996, pp. 238-249
Trace consistency and inevitability
R. Ramanujam
Lecture Notes in Computer Science 1180, 1996, pp. 250-261
Finite state implementations of knowledge-based programs
Ron van der Meyden
Lecture Notes in Computer Science 1180, 1996, pp. 262-273
Higher-order proof by consistency
Henrik Linnestad, Christian Prehofer, Olav Lysne
Lecture Notes in Computer Science 1180, 1996, pp. 274-285
Advocating ownership
Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt
Lecture Notes in Computer Science 1180, 1996, pp. 286-297

Seiten 1 2 >