Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2420

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

Computing partial information out of intractable one - The first digit of 2^n at base 3 as an example
Mika Hirvensalo, Juhani Karhumäki
Lecture Notes in Computer Science 2420, 2002, pp. 319-327
Algorithms for computing small NFAs
Lucian Ilie, Sheng Yu
Lecture Notes in Computer Science 2420, 2002, pp. 328-340
Space-economical construction of index structures for all suffixes of a string
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa
Lecture Notes in Computer Science 2420, 2002, pp. 341-352
An explicit lower bound of 5n - o(n) for Boolean circuits
Kazuo Iwama, Hiroki Morizumi
Lecture Notes in Computer Science 2420, 2002, pp. 353-364
Computational complexity in the hyperbolic plane
Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai
Lecture Notes in Computer Science 2420, 2002, pp. 365-374
On a mereological system for relational software specifications
Ryszard Janicki
Lecture Notes in Computer Science 2420, 2002, pp. 375-386
An optimal lower bound for resolution with 2-conjunctions
Jan Johannsen, N.S. Narayanaswamy
Lecture Notes in Computer Science 2420, 2002, pp. 387-398
Improved parameterized algorithms for planar dominating set
Iyad A. Kanj, Ljubomir Perković
Lecture Notes in Computer Science 2420, 2002, pp. 399-410
Optimal free binary decision diagrams for computation of EAR_n
Jan Kára, Daniel Král'
Lecture Notes in Computer Science 2420, 2002, pp. 411-422
Unification modulo associativity and idempotency is NP-complete
Ondȓej Klíma
Lecture Notes in Computer Science 2420, 2002, pp. 423-432
On the complexity of semantic equivalences for pushdown automata and BPA
Antonín Kuc̑era, Richard Mayr
Lecture Notes in Computer Science 2420, 2002, pp. 433-445
An improved algorithm for the membership problem for extended regular expressions
Orna Kupferman, Sharon Zuhovitzky
Lecture Notes in Computer Science 2420, 2002, pp. 446-458
Efficient algorithms for locating the length-constrained heaviest segments, with applications to biomolecular sequence analysis
Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
Lecture Notes in Computer Science 2420, 2002, pp. 459-470
Derivation of rational expressions with multiplicity
Sylvain Lombardy, Jacques Sakarovitch
Lecture Notes in Computer Science 2420, 2002, pp. 471-482
Hypothesis-founded semantics for Datalog programs with negation
Yann Loyer, Nicolas Spyratos
Lecture Notes in Computer Science 2420, 2002, pp. 483-494
On the problem of scheduling flows on distributed networks
Thomas Lücking, Burkhard Monien, Manuel Rode
Lecture Notes in Computer Science 2420, 2002, pp. 495-505
Unit testing for CASL architectural specifications
Patricia D.L. Machado, Donald Sannella
Lecture Notes in Computer Science 2420, 2002, pp. 506-518
Symbolic semantics and analysis for crypto-CCS with (almost) generic inference systems
Fabio Martinelli
Lecture Notes in Computer Science 2420, 2002, pp. 519-531
The complexity of tree multicolorings
Dániel Marx
Lecture Notes in Computer Science 2420, 2002, pp. 532-542
On verifying fair lossy channel systems
Benoît Masson, Ph. Schnoebelen
Lecture Notes in Computer Science 2420, 2002, pp. 543-555
Parameterized counting problems
Catherine McCartin
Lecture Notes in Computer Science 2420, 2002, pp. 556-567
On the construction of effective random sets
Wolfgang Merkle, Nenad Mihailović
Lecture Notes in Computer Science 2420, 2002, pp. 568-580
On the structure of the simulation order of proof systems
Jochen Messner
Lecture Notes in Computer Science 2420, 2002, pp. 581-592
Comorphism-based Grothendieck logics
Till Mossakowski
Lecture Notes in Computer Science 2420, 2002, pp. 593-604
Finite test-sets for overlap-free morphisms
Gwenael Richomme, Francis Wlazinski
Lecture Notes in Computer Science 2420, 2002, pp. 605-614

Seiten < 1 2 3 >