Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2747

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

Generic algorithms for the generation of combinatorial objects
Conrado Martínez, Xavier Molinero
Lecture Notes in Computer Science 2747, 2003, pp. 572-581
On the complexity of some problems in interval arithmetic
K. Meer
Lecture Notes in Computer Science 2747, 2003, pp. 582-591
An abduction-based method for index relaxation in taxonomy-based sources
Carlo Meghini, Yannis Tzitzikas, Nicolas Spyratos
Lecture Notes in Computer Science 2747, 2003, pp. 592-601
On selection functions that do not preserve normality
Wolfgang Merkle, Jan Reimann
Lecture Notes in Computer Science 2747, 2003, pp. 602-611
On converting CNF to DNF
Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
Lecture Notes in Computer Science 2747, 2003, pp. 612-621
A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum
N. Pisanti, M. Crochemore, R. Grossi, M.-F. Sagot
Lecture Notes in Computer Science 2747, 2003, pp. 622-631
On the complexity of some equivalence problems for propositional calculi
Steffen Reith
Lecture Notes in Computer Science 2747, 2003, pp. 632-641
Quantified mu-calculus for control synthesis
Stéphane Riedweg, Sophie Pinchinat
Lecture Notes in Computer Science 2747, 2003, pp. 642-651
On probabilistic quantified satisfiability games
Marcin Rychlik
Lecture Notes in Computer Science 2747, 2003, pp. 652-661
A completeness property of Wilke's tree algebras
Saeed Salehi
Lecture Notes in Computer Science 2747, 2003, pp. 662-670
Symbolic topological sorting with OBDDs
Philipp Woelfel
Lecture Notes in Computer Science 2747, 2003, pp. 671-680
Ershov's hierarchy of real numbers
Xizhong Zheng, Robert Rettinger, Romain Gengler
Lecture Notes in Computer Science 2747, 2003, pp. 681-690

Seiten < 1 2 3