Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1373

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

The mutual exclusion scheduling problem for permutation and comparability graphs
Klaus Jansen
Lecture Notes in Computer Science 1373, 1998, pp. 287-297
Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem
Nader H. Bshouty, Lynn Burroughs
Lecture Notes in Computer Science 1373, 1998, pp. 298-308
Partially persistent search trees with transcript operations
Kim S. Larsen
Lecture Notes in Computer Science 1373, 1998, pp. 309-319
Relating hierarchis of word and tree automata
Damian Niwiński, Igor Walukiewicz
Lecture Notes in Computer Science 1373, 1998, pp. 320-331
Languages defined with modular counting quantifiers
Howard Straubing
Lecture Notes in Computer Science 1373, 1998, pp. 332-343
Hierarchies of prinicipal twist-closed trios
Matthias Jantzen
Lecture Notes in Computer Science 1373, 1998, pp. 344-355
Radix representations of algebraic number fields and finite automata
Taoufik Safer
Lecture Notes in Computer Science 1373, 1998, pp. 356-365
Sorting and searching on the word RAM
Torben Hagerup
Lecture Notes in Computer Science 1373, 1998, pp. 366-398
Communication-efficient deterministic parallel algorithms for planar point location and 2d Voronoi diagram
Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin
Lecture Notes in Computer Science 1373, 1998, pp. 399-409
On Batcher's merge sorts as parallel sorting algorithms
Christine Rüb
Lecture Notes in Computer Science 1373, 1998, pp. 410-420
Minimum spanning trees for minor-closed graph classes in parallel
Jens Gustedt
Lecture Notes in Computer Science 1373, 1998, pp. 421-431
Optimal broadcasting in almost trees and partial k-trees
Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto
Lecture Notes in Computer Science 1373, 1998, pp. 432-443
Local normal forms for first-order logic with applications to games and automata
Thomas Schwentick, Klaus Barthelmann
Lecture Notes in Computer Science 1373, 1998, pp. 444-454
Axiomatizing the equational theory of regular tree languages
Z. Ésik
Lecture Notes in Computer Science 1373, 1998, pp. 455-465
A logical characterization of systolic lanuages
Angelo Monti, Adriano Peron
Lecture Notes in Computer Science 1373, 1998, pp. 466-476
Optimal proof systems for propositional logic and complete sets
Jochen Messner, Jacobo Torán
Lecture Notes in Computer Science 1373, 1998, pp. 477-487
The (parallel) approximability of non-Boolean satisfiability problems and restricted integer programming
Maria Serna, Luca Trevisan, Tatos Xhafa
Lecture Notes in Computer Science 1373, 1998, pp. 488-498
Interactive protocols on the reals
Sergei Ivanov, Michel de Rougemont
Lecture Notes in Computer Science 1373, 1998, pp. 499-510
Result-indistinguishable zero-knowledge proofs: Increased power and constant-round protocols
Giovanni di Crescenzo, Kouichi Sakurai, Moti Yung
Lecture Notes in Computer Science 1373, 1998, pp. 511-521
Bounded size dictionary compression: SC^k-completeness and NC algorithms
Sergio de Agostino, Riccardo Silvestri
Lecture Notes in Computer Science 1373, 1998, pp. 522-532
Expressive completeness of LTrL on finite traces: An algebraic proof
Raphaël Meyer, Antoine Petit
Lecture Notes in Computer Science 1373, 1998, pp. 533-543
On uniform DOL words
Anna E. Frid
Lecture Notes in Computer Science 1373, 1998, pp. 544-554
Series-parallel posets: Algebra, automata and languages
K. Lodaya, P. Weil
Lecture Notes in Computer Science 1373, 1998, pp. 555-565
On the expected number of nodes at level k in 0-balanced trees
Rainer Kemp
Lecture Notes in Computer Science 1373, 1998, pp. 566-576
Cell flipping in permutation diagrams
Martin Charles Columbic, Haim Kaplan
Lecture Notes in Computer Science 1373, 1998, pp. 577-586

Seiten < 1 2 3 >