Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3580

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

Holographic circuits
Leslie G. Valiant
Lecture Notes in Computer Science 3580, 2005, pp. 1-15
Probabilistic polynomial-time semantics for a protocol security logic
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly Shmatikov, Mathieu Turuani
Lecture Notes in Computer Science 3580, 2005, pp. 16-29
A gentle introduction to semantic subtyping
Giuseppe Castagna, Alain Frisch
Lecture Notes in Computer Science 3580, 2005, pp. 30-34
Logics for unranked trees: An overview
Leonid Libkin
Lecture Notes in Computer Science 3580, 2005, pp. 35-50
Nash equilibria, the price of anarchy and the fully mixed Nash equilibrium conjecture
Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann
Lecture Notes in Computer Science 3580, 2005, pp. 51-65
The tree inclusion problem: In optimal space and faster
Philip Bille, Inge Li Grtz
Lecture Notes in Computer Science 3580, 2005, pp. 66-77
Union-find with constant time deletions
Stephen Alstrup, Inge Li Grtz, Theis Rauhe, Mikkel Thorup, Uri Zwick
Lecture Notes in Computer Science 3580, 2005, pp. 78-89
Optimal in-place sorting of vectors and records
Gianni Franceschini, Roberto Grossi
Lecture Notes in Computer Science 3580, 2005, pp. 90-102
Towards optimal multiple selection
Kanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders
Lecture Notes in Computer Science 3580, 2005, pp. 103-114
Simple extractors via constructions of cryptographic pseudo-random generators
Marius Zimand
Lecture Notes in Computer Science 3580, 2005, pp. 115-127
Bounds on the efficiency of ''black-box'' commitment schemes
Omer Horvitz, Jonathan Katz
Lecture Notes in Computer Science 3580, 2005, pp. 128-139
On round-efficient argument systems
Hoeteck Wee
Lecture Notes in Computer Science 3580, 2005, pp. 140-152
Computational bounds on hierarchical data processing with applications to information security
Roberto Tamassia, Nikos Triandopoulos
Lecture Notes in Computer Science 3580, 2005, pp. 153-165
Balanced allocation and dictionaries with tightly packed constant size bins
Martin Dietzfelbinger, Christoph Weidling
Lecture Notes in Computer Science 3580, 2005, pp. 166-178
Worst case optimal union-intersection expression evaluation
Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh
Lecture Notes in Computer Science 3580, 2005, pp. 179-190
Measure and conquer: Domination - A case study
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
Lecture Notes in Computer Science 3580, 2005, pp. 191-203
Optimistic asynchronous atomic broadcast
Klaus Kursawe, Victor Shoup
Lecture Notes in Computer Science 3580, 2005, pp. 204-215
Asynchronous perfectly secure communication over one-time pads
Giovanni Di Crescenzo, Aggelos Kiayias
Lecture Notes in Computer Science 3580, 2005, pp. 216-227
Single-prover concurrent zero knowledge in almost constant rounds
Giuseppe Persiano, Ivan Visconti
Lecture Notes in Computer Science 3580, 2005, pp. 228-240
LCA queries in directed acyclic graphs
Miroslaw Kowaluk, Andrzej Lingas
Lecture Notes in Computer Science 3580, 2005, pp. 241-248
Replacement paths and k simple shortest paths in unweighted directed graphs
Liam Roditty, Uri Zwick
Lecture Notes in Computer Science 3580, 2005, pp. 249-260
Deterministic constructions of approximate distance oracles and spanners
Liam Roditty, Mikkel Thorup, Uri Zwick
Lecture Notes in Computer Science 3580, 2005, pp. 261-272
An {\~O}(m^2n) randomized algorithm to compute a minimum cycle basis of a directed graph
Telikepalli Kavitha
Lecture Notes in Computer Science 3580, 2005, pp. 273-284
Basing cryptographic protocols on tamper-evident seals
Tal Moran, Moni Naor
Lecture Notes in Computer Science 3580, 2005, pp. 285-297
Hybrid trapdoor commitments and their applications
Dario Catalano, Ivan Visconti
Lecture Notes in Computer Science 3580, 2005, pp. 298-310

Seiten 1 2 3 4 5 >