Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1443

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

Algorithmic verification of linear temporal logic specifications
Yonit Kesten, Amir Pnueli, Li-on Raviv
Lecture Notes in Computer Science 1443, 1998, pp. 1-16
On existentially first-order definable languages and their relation to NP
Bernd Borchert, Dietrich Kuske, Frank Stephan
Lecture Notes in Computer Science 1443, 1998, pp. 17-28
An algebraic approach to communication complexity
Jean-François Raymond, Pascal Tesson, Denis Thérien
Lecture Notes in Computer Science 1443, 1998, pp. 29-40
Deciding global partial-order properties
Rajeev Alur, Ken McMillan, Doron Peled
Lecture Notes in Computer Science 1443, 1998, pp. 41-52
Simple linear-time algorithms for minimal fixed points
Xinxin Liu, Scott A. Smolka
Lecture Notes in Computer Science 1443, 1998, pp. 53-66
Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method
Thore Husfeldt, Theis Rauhe
Lecture Notes in Computer Science 1443, 1998, pp. 67-78
Simpler and faster dictionaries on the AC^0 RAM
Torben Hagerup
Lecture Notes in Computer Science 1443, 1998, pp. 79-90
Partial-congruence factorization of bisimilarity induced by open maps
Sƚawomir Lasota
Lecture Notes in Computer Science 1443, 1998, pp. 91-102
Reset nets between decidability and undecidability
C. Dufourd, A. Finkel, Ph. Schnoebelen
Lecture Notes in Computer Science 1443, 1998, pp. 103-115
Geometric algorithms for robotic manipulation
Mark H. Overmars
Lecture Notes in Computer Science 1443, 1998, pp. 116-117
Compact encodings of planar graphs via canonical orderings and multiple parentheses
Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu
Lecture Notes in Computer Science 1443, 1998, pp. 118-129
Reducing simple polygons to triangles - A proof for an improved conjecture
Thorsten Graf, Kamakoti Veezhinathan
Lecture Notes in Computer Science 1443, 1998, pp. 130-139
Difficult configurations - On the complexity of LTrL
Igor Walukiewicz
Lecture Notes in Computer Science 1443, 1998, pp. 140-151
On the expressiveness of real and integer arithmetic automata
Bernard Boigelot, Stéphane Rassart, Pierre Wolper
Lecture Notes in Computer Science 1443, 1998, pp. 152-163
Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees
David Peleg
Lecture Notes in Computer Science 1443, 1998, pp. 164-175
Independent sets with domination constraints
Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
Lecture Notes in Computer Science 1443, 1998, pp. 176-187
Robust asynchronous protocols are finite-state
Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind Sohoni
Lecture Notes in Computer Science 1443, 1998, pp. 188-199
Deciding bisimulation-like equivalences with finite-state processes
Petr Janc̑ar, Antonín Kuc̑era, Richard Mayr
Lecture Notes in Computer Science 1443, 1998, pp. 200-211
Do probabilistic algorithms outperform deterministic ones?
Avi Wigderson
Lecture Notes in Computer Science 1443, 1998, pp. 212-214
A degree-decreasing lemma for (MOD q, MOD p) circuits
Vince Grolmusz
Lecture Notes in Computer Science 1443, 1998, pp. 215-222
Improved pseudorandom generators for combinatorial rectangles
Chi-Jen Lu
Lecture Notes in Computer Science 1443, 1998, pp. 223-234
Translation validation for synchronous languages
A. Pnueli, O. Shtrichman, M. Siegel
Lecture Notes in Computer Science 1443, 1998, pp. 235-246
An efficient and unified approach to the decidability of equivalence of propositional programs
Vladimir A. Zakharov
Lecture Notes in Computer Science 1443, 1998, pp. 247-258
On branching programs with bounded uncertainty
Stasys Jukna, Stanislav Z̑ák
Lecture Notes in Computer Science 1443, 1998, pp. 259-270
CONS-free programs with tree input
Amir M. Ben-Amram, Holger Petersen
Lecture Notes in Computer Science 1443, 1998, pp. 271-282

Seiten 1 2 3 4 >