Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3142

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

Model checking with multi-valued logics
Glenn Bruns, Patrice Godefroid
Lecture Notes in Computer Science 3142, 2004, pp. 281-293
The complexity of partition functions
Andrei Bulatov, Martin Grohe
Lecture Notes in Computer Science 3142, 2004, pp. 294-306
Comparing recursion, replication, and iteration in process calculi
Nadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro
Lecture Notes in Computer Science 3142, 2004, pp. 307-319
Dynamic price sequence and incentive compatibility
Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao
Lecture Notes in Computer Science 3142, 2004, pp. 320-331
The complexity of equivariant unification
James Cheney
Lecture Notes in Computer Science 3142, 2004, pp. 332-344
Coordination mechanisms
George Christodoulou, Elias Koutsoupias, Akash Nanavati
Lecture Notes in Computer Science 3142, 2004, pp. 345-357
Online scheduling of equal-length jobs: Randomization and restarts help
Marek Chrobak, Wojciech Jawor, Jiȓí Sgall, Tomás̑ Tichý
Lecture Notes in Computer Science 3142, 2004, pp. 358-370
Efficient computation of equilibrium prices for markets with Leontief utilities
Bruno Codenotti, Kasturi Varadarajan
Lecture Notes in Computer Science 3142, 2004, pp. 371-382
Coloring semirandom graphs optimally
Amin Coja-Oghlan
Lecture Notes in Computer Science 3142, 2004, pp. 383-395
Sublinear-time approximation for clustering via random sampling
Artur Czumaj, Christian Sohler
Lecture Notes in Computer Science 3142, 2004, pp. 396-407
Solving two-variable word equations
Robert Da̧browski, Wojtek Plandowski
Lecture Notes in Computer Science 3142, 2004, pp. 408-419
Backtracking games and inflationary fixed points
Anuj Dawar, Erich Grädel, Stephan Kreutzer
Lecture Notes in Computer Science 3142, 2004, pp. 420-432
A PTAS for embedding hypergraph in a cycle
Xiaotie Deng, Guojun Li
Lecture Notes in Computer Science 3142, 2004, pp. 433-444
Towards an algebraic theory of typed mobile processes
Yuxin Deng, Davide Sangiorgi
Lecture Notes in Computer Science 3142, 2004, pp. 445-456
Ecological Turing machines
Bruno Durand, Andrei Muchnik, Maxim Ushakov, Nikolai Vereshchagin
Lecture Notes in Computer Science 3142, 2004, pp. 457-468
Locally consistent constraint satisfaction problems
Zdenȇk Dvoȓák, Daniel Král', Ondȓej Pangrác
Lecture Notes in Computer Science 3142, 2004, pp. 469-480
Quantum query complexity of some graph problems
Christoph Dürr, Mark Heiligman, Peter Hyer, Mehdi Mhalla
Lecture Notes in Computer Science 3142, 2004, pp. 481-493
A domain theoretic account of Picard's theorem
A. Edalat, D. Pattinson
Lecture Notes in Computer Science 3142, 2004, pp. 494-505
Interactive observability in Ludics
Claudia Faggian
Lecture Notes in Computer Science 3142, 2004, pp. 506-518
Easily refutable subformulas of large random 3CNF formulas
Uriel Feige, Eran Ofek
Lecture Notes in Computer Science 3142, 2004, pp. 519-530
On graph problems in a semi-streaming model
Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang
Lecture Notes in Computer Science 3142, 2004, pp. 531-543
Linear tolls suffice: New bounds and algorithms for tolls in single source networks
Lisa Fleischer
Lecture Notes in Computer Science 3142, 2004, pp. 544-554
Bounded fixed-parameter tractability and \log^2n nondeterministic bits
Jörg Flum, Martin Grohe, Mark Weyer
Lecture Notes in Computer Science 3142, 2004, pp. 555-567
Exact (exponential) algorithms for treewidth and minimum fill-in
Fedor V. Fomin, Dieter Kratsch, Ioan Todinca
Lecture Notes in Computer Science 3142, 2004, pp. 568-580
Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up
Fedor V. Fomin, Dimitrios M. Thilikos
Lecture Notes in Computer Science 3142, 2004, pp. 581-592

Seiten < 1 2 3 4 5 >