Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1046

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

On the existence of hard sparse sets under weak reductions
Jin-Yi Cai, Ashish V. Naik, D. Sivakumar
Lecture Notes in Computer Science 1046, 1996, pp. 307-318
Optimal bounds on the approximation of Boolean functions with consequences on the concept of hardness
Alexander E. Andreev, Andrea E.F. Clementi, José D.P. Rolim
Lecture Notes in Computer Science 1046, 1996, pp. 319-330
Fine separation of average time complexity classes
Jin-Yi Cai, Alan L. Selman
Lecture Notes in Computer Science 1046, 1996, pp. 331-343
Compositional specification of timed systems
Joseph Sifakis, Sergio Yovine
Lecture Notes in Computer Science 1046, 1996, pp. 347-359
Optimal tree-based one-time digital signature schemes
Daniel Bleichenbacher, Ueli M. Maurer
Lecture Notes in Computer Science 1046, 1996, pp. 363-374
The action of a few random permutations on r-tuples and an application to cryptography
Joel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich
Lecture Notes in Computer Science 1046, 1996, pp. 375-386
A unified and generalized treatment of authentication theory
Ueli M. Maurer
Lecture Notes in Computer Science 1046, 1996, pp. 387-398
Monadic second order logic on tree-like structures
Igor Walukiewicz
Lecture Notes in Computer Science 1046, 1996, pp. 401-413
On bijections vs. unary functions
Thomas Schwentick
Lecture Notes in Computer Science 1046, 1996, pp. 415-426
The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG programs
Jerzy Marcinkowski
Lecture Notes in Computer Science 1046, 1996, pp. 427-438
A combinatorial design approach to MAXCUT
Thomas Hofmeister, Hanno Lefmann
Lecture Notes in Computer Science 1046, 1996, pp. 441-452
Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width
Arvind Gupta, Naomi Nishimura
Lecture Notes in Computer Science 1046, 1996, pp. 453-464
A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume
Scott A. Mitchell
Lecture Notes in Computer Science 1046, 1996, pp. 465-476
On the expressivity of the modal mu-calculus
J.C. Bradfield
Lecture Notes in Computer Science 1046, 1996, pp. 479-490
Read-once projections and formal circuit verification with binary decision diagrams
Beate Bollig, Ingo Wegener
Lecture Notes in Computer Science 1046, 1996, pp. 491-502
"Optimal" collecting semantics for analysis in a hierarchy of logic program semantics
Roberto Giacobazzi
Lecture Notes in Computer Science 1046, 1996, pp. 503-514
Flip-flop nets
Vincent Schmitt
Lecture Notes in Computer Science 1046, 1996, pp. 517-528
Lower bounds for compact routing
Evangelos Kranakis, Danny Krizanc
Lecture Notes in Computer Science 1046, 1996, pp. 529-540
On the successor function in non-classical numeration systems
Christiane Frougny
Lecture Notes in Computer Science 1046, 1996, pp. 543-553
Minimal forbidden words and symbolic dynamics
Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo
Lecture Notes in Computer Science 1046, 1996, pp. 555-566
Universal hashing and k-wise independent random variables via integer arithmetic without primes
Martin Dietzfelbinger
Lecture Notes in Computer Science 1046, 1996, pp. 569-580
Ranking and unranking trees using regular reductions
Pierre Kelsen
Lecture Notes in Computer Science 1046, 1996, pp. 581-592
On competitive on-line paging with lookahead
Dany Breslauer
Lecture Notes in Computer Science 1046, 1996, pp. 593-603
Hypothesis testing in perfect phylogeny for a bounded number of characters
Jens Lagergren
Lecture Notes in Computer Science 1046, 1996, pp. 605-616
The "log rank" conjecture for modular communication complexity
Christoph Meinel, Stephan Waack
Lecture Notes in Computer Science 1046, 1996, pp. 619-630

Seiten < 1 2 3 >