Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3580

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

Reordering buffer management for non-uniform cost models
Matthias Englert, Matthias Westermann
Lecture Notes in Computer Science 3580, 2005, pp. 627-638
Combining intruder theories
Yannick Chevalier, Michaël Rusinowitch
Lecture Notes in Computer Science 3580, 2005, pp. 639-651
Computationally sound implementations of equational theories against passive adversaries
Mathieu Baudet, Véronique Cortier, Steve Kremer
Lecture Notes in Computer Science 3580, 2005, pp. 652-663
Password-based encryption analyzed
Martín Abadi, Bogdan Warinschi
Lecture Notes in Computer Science 3580, 2005, pp. 664-676
On the cover time of random geometric graphs
Chen Avin, Gunes Ercal
Lecture Notes in Computer Science 3580, 2005, pp. 677-689
On the existence of Hamiltonian cycles in random intersection graphs
Charilaos Efthymiou, Paul G. Spirakis
Lecture Notes in Computer Science 3580, 2005, pp. 690-701
Optimal cover time for a graph-based coupon collector process
Nedialko B. Dimitrov, C. Greg Plaxton
Lecture Notes in Computer Science 3580, 2005, pp. 702-716
Stability and similarity of link analysis ranking algorithms
Debora Donato, Stefano Leonardi, Panayiotis Tsaparas
Lecture Notes in Computer Science 3580, 2005, pp. 717-729
Up-to techniques for weak bisimulation
Damien Pous
Lecture Notes in Computer Science 3580, 2005, pp. 730-741
Petri algebras
Eric Badouel, Jules Chenou, Goulven Guillou
Lecture Notes in Computer Science 3580, 2005, pp. 742-754
A finite basis for failure semantics
Wan Fokkink, Sumit Nain
Lecture Notes in Computer Science 3580, 2005, pp. 755-765
Spatial logics for bigraphs
Giovanni Conforti, Damiano Macedonio, Vladimiro Sassone
Lecture Notes in Computer Science 3580, 2005, pp. 766-778
Completely non-malleable schemes
Marc Fischlin
Lecture Notes in Computer Science 3580, 2005, pp. 779-790
Boneh-Franklin identity based encryption revisited
David Galindo
Lecture Notes in Computer Science 3580, 2005, pp. 791-802
Single-database private information retrieval with constant communication rate
Craig Gentry, Zulfikar Ramzan
Lecture Notes in Computer Science 3580, 2005, pp. 803-815
Concurrent zero knowledge in the public-key model
Giovanni Di Crescenzo, Ivan Visconti
Lecture Notes in Computer Science 3580, 2005, pp. 816-827
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Martin Gairing, Burkhard Monien, Andreas Woclaw
Lecture Notes in Computer Science 3580, 2005, pp. 828-839
Polynomial time preemptive sum-multicoloring on paths
Annamária Kovács
Lecture Notes in Computer Science 3580, 2005, pp. 840-852
The generalized deadlock resolution problem
Kamal Jain, MohammadTaghi Hajiaghayi, Kunal Talwar
Lecture Notes in Computer Science 3580, 2005, pp. 853-865
Facility location in sublinear time
Mihai Bȃdoiu, Artur Czumaj, Piotr Indyk, Christian Sohler
Lecture Notes in Computer Science 3580, 2005, pp. 866-877
The complexity of stochastic Rabin and Streett games
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger
Lecture Notes in Computer Science 3580, 2005, pp. 878-890
Recursive Markov decision processes and recursive stochastic games
Kousha Etessami, Mihalis Yannakakis
Lecture Notes in Computer Science 3580, 2005, pp. 891-903
Decidability in syntactic control of interference
J. Laird
Lecture Notes in Computer Science 3580, 2005, pp. 904-916
Idealized Algol with ground recursion, and DPDA equivalence
A.S. Murawski, C.-H.L. Ong, I. Walukiewicz
Lecture Notes in Computer Science 3580, 2005, pp. 917-929
From primal-dual to cost shares and back: A stronger LP relaxation for the Steiner forest problem
Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan van Zwam
Lecture Notes in Computer Science 3580, 2005, pp. 930-942

Seiten < 1 2 3 4 5 >