Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=652

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

Recent developments in algorithms for the maximum-flow problem
Kurt Mehlhorn
Lecture Notes in Computer Science 652, 1992, pp. 404
System specification and refinement in temporal logic
Amir Pnueli
Lecture Notes in Computer Science 652, 1992, pp. 1-38
Fixed points of Büchi automata
Mads Dam
Lecture Notes in Computer Science 652, 1992, pp. 39-50
An automata-theoretic decision procedure for Future Interval Logic
Y.S. Ramakrishna, L.K. Dillon, L.E. Moser, P.M. Melliar-Smith, G. Kutty
Lecture Notes in Computer Science 652, 1992, pp. 51-67
Improving the results of static analyses of programs by local decreasing iterations
Philippe Granger
Lecture Notes in Computer Science 652, 1992, pp. 68-79
Implicit point location in arrangements of line segments, with an application to motion planning
Pankaj K. Agarwal, Marc van Kreveld
Lecture Notes in Computer Science 652, 1992, pp. 80-91
An optimal algorithm for the intersection radius of a set of convex polygons
Shreesh Jadhav, Asish Mukhopadhyay, Binay Bhattacharya
Lecture Notes in Computer Science 652, 1992, pp. 92-103
C-sensitive triangulations approximate the minmax length triangulation
Christos Levcopoulos, Andrzej Lingas
Lecture Notes in Computer Science 652, 1992, pp. 104-115
Superpolynomial circuits, almost sparse oracles and the exponential hierarchy
Harry Buhrman, Steven Homer
Lecture Notes in Computer Science 652, 1992, pp. 116-127
Structural average case complexity
Rainer Schuler, Tomoyuki Yamakami
Lecture Notes in Computer Science 652, 1992, pp. 128-139
On bounded truth-table, conjunctive, and randomized reductions to sparse sets
V. Arvind, J. Köbler, M. Mundhenk
Lecture Notes in Computer Science 652, 1992, pp. 140-151
One-way functions and isomorphism conjecture
K. Ganesan
Lecture Notes in Computer Science 652, 1992, pp. 152-163
Solving the Lagrangian dual when the number of constraints is fixed
Richa Agarwala, David Fernández-Baca
Lecture Notes in Computer Science 652, 1992, pp. 164-175
Superfiniteness of query answers in deductive databases: an automata-theoretic approach
Laks V.S. Lakshmanan, Daniel A. Nonen
Lecture Notes in Computer Science 652, 1992, pp. 176-190
Proving polynomials positive
Joachim Steinbach
Lecture Notes in Computer Science 652, 1992, pp. 191-202
An abstract interpretation scheme for groundness, freeness, and sharing analysis of logic programs
Renganathan Sundararajan, John S. Conery
Lecture Notes in Computer Science 652, 1992, pp. 203-216
Polymorphic typing by abstract interpretation
B. Monsuez
Lecture Notes in Computer Science 652, 1992, pp. 217-228
The Gallina specification language: A case study
Gérard Huet
Lecture Notes in Computer Science 652, 1992, pp. 229-240
Verification of large software systems
Wolfgang Reif
Lecture Notes in Computer Science 652, 1992, pp. 241-252
Detection of unstable predicates in distributed programs
Vijay K. Garg, Brian Waldecker
Lecture Notes in Computer Science 652, 1992, pp. 253-264
Fast sequential and randomized parallel algorithms for rigidity and approximate min k-cut
Sachin Patkar, H. Narayanan
Lecture Notes in Computer Science 652, 1992, pp. 265-278
Approximation through local optimality: Designing networks with small degree
R. Ravi, B. Raghavachari, P. Klein
Lecture Notes in Computer Science 652, 1992, pp. 279-290
Games and full completeness for multiplicative linear logic
Samson Abramsky, Radha Jagadeesan
Lecture Notes in Computer Science 652, 1992, pp. 291-301
Real-time calculi and expansion theorems
Jens C. Godskesen, Kim G. Larsen
Lecture Notes in Computer Science 652, 1992, pp. 302-315
Branching bisimulation for context-free processes
Didier Caucal
Lecture Notes in Computer Science 652, 1992, pp. 316-327

Seiten 1 2 >