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
[1]
Hilfe
Suche: Series=LNCS AND Volume=3328
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Join algorithms for the theory of uninterpreted functions
Sumit Gulwani
,
Ashish Tiwari
,
George C. Necula
Lecture Notes in Computer Science
3328
, 2004, pp. 311-323
No, coreset, no cry
Sariel Har-Peled
Lecture Notes in Computer Science
3328
, 2004, pp. 324-335
Hardness hypotheses, derandomization, and circuit complexity
John M. Hitchcock
,
A. Pavan
Lecture Notes in Computer Science
3328
, 2004, pp. 336-347
Improved approximation algorithms for maximum graph partitioning problems
Gerold Jäger
,
Anand Srivastav
Lecture Notes in Computer Science
3328
, 2004, pp. 348-359
Learning languages from positive data and a finite number of queries
Sanjay Jain
,
Efim Kinber
Lecture Notes in Computer Science
3328
, 2004, pp. 360-371
The complexity of the local Hamiltonian problem
Julia Kempe
,
Alexei Kitaev
,
Oded Regev
Lecture Notes in Computer Science
3328
, 2004, pp. 372-383
Quantum and classical communication-space tradeoffs from rectangle bounds
Hartmut Klauck
Lecture Notes in Computer Science
3328
, 2004, pp. 384-395
Adaptive stabilization of reactive protocols
Shay Kutten
,
Boaz Patt-Shamir
Lecture Notes in Computer Science
3328
, 2004, pp. 396-407
Visibly pushdown games
Christof Löding
,
P. Madhusudan
,
Olivier Serre
Lecture Notes in Computer Science
3328
, 2004, pp. 408-420
Refinement and separation contexts
Ivana Mijajlović
,
Noah Torp-Smith
,
Peter O'Hearn
Lecture Notes in Computer Science
3328
, 2004, pp. 421-433
Decidability of MSO theories of tree structures
Angelo Montanari
,
Gabriele Puppis
Lecture Notes in Computer Science
3328
, 2004, pp. 434-446
Distributed algorithms for coloring and domination in wireless adhoc networks
Srinivasan Parthasarathy
,
Rajiv Gandhi
Lecture Notes in Computer Science
3328
, 2004, pp. 447-459
Monotone multilinear Boolean circuits for bipartite perfect matching require exponential size
Ashok Kumar Ponnuswami
,
H. Venkateswaran
Lecture Notes in Computer Science
3328
, 2004, pp. 460-468
Testing geometric convexity
Luis Rademacher
,
Santosh Vempala
Lecture Notes in Computer Science
3328
, 2004, pp. 469-480
Complexity of linear connectivity problems in directed hypergraphs
Mayur Thakur
,
Rahul Tripathi
Lecture Notes in Computer Science
3328
, 2004, pp. 481-493
Actively learning to verify safety for FIFO automata
Abhay Vardhan
,
Koushik Sen
,
Mahesh Viswanathan
,
Gul Agha
Lecture Notes in Computer Science
3328
, 2004, pp. 494-505
Reasoning about game equilibria using temporal logic
G. Venkatesh
Lecture Notes in Computer Science
3328
, 2004, pp. 506-517
Alternation in equational tree automata modulo XOR
Kumar Neeraj Verma
Lecture Notes in Computer Science
3328
, 2004, pp. 518-530
Seiten
<
1
2