Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Series=LNCS AND Volume=4596
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the power of
k
-consistency
Albert Atserias
,
Andrei Bulatov
,
Victor Dalmau
Lecture Notes in Computer Science
4596
, 2007, pp. 279-290
Complexity of propositional proofs under a promise
Nachum Dershowitz
,
Iddo Tzameret
Lecture Notes in Computer Science
4596
, 2007, pp. 291-302
Deterministic history-independent strategies for storing information on write-once memories
Tal Moran
,
Moni Naor
,
Gil Segev
Lecture Notes in Computer Science
4596
, 2007, pp. 303-315
Trading static for adaptive security in universally composable zero-knowledge
Aggelos Kiayias
,
Hong-Sheng Zhou
Lecture Notes in Computer Science
4596
, 2007, pp. 316-327
A characterization of non-interactive instance-dependent commitment-schemes (NIC)
Bruce Kapron
,
Lior Malka
,
Venkatesh Srinivasan
Lecture Notes in Computer Science
4596
, 2007, pp. 328-339
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
Michael R. Fellows
,
Guillaume Fertin
,
Danny Hermelin
,
Stéphane Vialette
Lecture Notes in Computer Science
4596
, 2007, pp. 340-351
Parameterized algorithms for directed maximum leaf problems
Noga Alon
,
Fedor V. Fomin
,
Gregory Gutin
,
Michael Krivelevich
,
Saket Saurabh
Lecture Notes in Computer Science
4596
, 2007, pp. 352-362
Parameterized approximability of the disjoint cycle problem
Martin Grohe
,
Magdalena Grüber
Lecture Notes in Computer Science
4596
, 2007, pp. 363-374
Linear problem kernels for
NP
-hard problems on planar graphs
Jiong Guo
,
Rolf Niedermeier
Lecture Notes in Computer Science
4596
, 2007, pp. 375-386
Private locally decodable codes
Rafail Ostrovsky
,
Omkant Pandey
,
Amit Sahai
Lecture Notes in Computer Science
4596
, 2007, pp. 387-398
Hash functions in the dedicated-key setting: Design choices and MPP transforms
Mihir Bellare
,
Thomas Ristenpart
Lecture Notes in Computer Science
4596
, 2007, pp. 399-410
Unrestricted aggregate signatures
Mihir Bellare
,
Chanathip Namprempre
,
Gregory Neven
Lecture Notes in Computer Science
4596
, 2007, pp. 411-422
Ring signatures of sub-linear size without random oracles
Nishanth Chandran
,
Jens Groth
,
Amit Sahai
Lecture Notes in Computer Science
4596
, 2007, pp. 423-434
Balanced families of perfect hash functions and their applications
Noga Alon
,
Shai Gutner
Lecture Notes in Computer Science
4596
, 2007, pp. 435-446
An exponential improvement on the MST heuristic for minimum energy broadcasting in ad hoc wireless networks
Ioannis Caragiannis
,
Michele Flammini
,
Luca Moscardelli
Lecture Notes in Computer Science
4596
, 2007, pp. 447-458
Modular algorithms for heterogeneous modal logics
Lutz Schröder
,
Dirk Pattinson
Lecture Notes in Computer Science
4596
, 2007, pp. 459-471
Co-logic programming: Extending logic programming with coinduction
Luke Simon
,
Ajay Bansal
,
Ajay Mallya
,
Gopal Gupta
Lecture Notes in Computer Science
4596
, 2007, pp. 472-483
Offline/online mixing
Ben Adida
,
Douglas Wikström
Lecture Notes in Computer Science
4596
, 2007, pp. 484-495
Fully collusion resistant black-box traitor revocable broadcast encryption with short private keys
Jun Furukawa
,
Nuttapong Attrapadung
Lecture Notes in Computer Science
4596
, 2007, pp. 496-508
Succinct ordinal trees based on tree covering
Meng He
,
J. Ian Munro
,
S. Srinivasa Rao
Lecture Notes in Computer Science
4596
, 2007, pp. 509-520
A framework for dynamizing succinct data structures
Ankur Gupta
,
Wing-Kai Hon
,
Rahul Shah
,
Jeffrey Scott Vitter
Lecture Notes in Computer Science
4596
, 2007, pp. 521-532
In-place suffix sorting
Gianni Franceschini
,
S. Muthukrishnan
Lecture Notes in Computer Science
4596
, 2007, pp. 533-545
Maximal infinite-valued constraint languages
Manuel Bodirsky
,
Hubie Chen
,
Jan Kára
,
Timo von Oertzen
Lecture Notes in Computer Science
4596
, 2007, pp. 546-557
Affine systems of equations and counting infinitary logic
Albert Atserias
,
Andrei Bulatov
,
Anuj Dawar
Lecture Notes in Computer Science
4596
, 2007, pp. 558-570
Boundedness of monadic FO over acyclic structures
Stephan Kreutzer
,
Martin Otto
,
Nicole Schweikardt
Lecture Notes in Computer Science
4596
, 2007, pp. 571-582
Seiten
<
1
2
3
4
>