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=2747
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Relating hierarchy of temporal properties to model checking
Ivana C̑erná
,
Radek Pelánek
Lecture Notes in Computer Science
2747
, 2003, pp. 318-327
Arithmetic constant-depth circuit complexity classes
Hubie Chen
Lecture Notes in Computer Science
2747
, 2003, pp. 328-337
Inverse
NP
problems
Hubie Chen
Lecture Notes in Computer Science
2747
, 2003, pp. 338-347
A linear-time algorithm for 7-coloring 1-planar graphs
Zhi-Zhong Chen
,
Mitsuharu Kouno
Lecture Notes in Computer Science
2747
, 2003, pp. 348-357
Generalized satisfiability with limited occurrences per variable: A study through delta-matroid parity
Victor Dalmau
,
Daniel K. Ford
Lecture Notes in Computer Science
2747
, 2003, pp. 358-367
Randomized algorithms for determining the majority on graphs
Gianluca De Marco
,
Andrzej Pelc
Lecture Notes in Computer Science
2747
, 2003, pp. 368-377
Using transitive-closure logic for deciding linear properties of monoids
Christian Delhommé
,
Teodor Knapik
,
D. Gnanaraj Thomas
Lecture Notes in Computer Science
2747
, 2003, pp. 378-387
Linear-time computation of local periods
Jean-Pierre Duval
,
Roman Kolpakov
,
Gregory Kucherov
,
Thierry Lecroq
,
Arnaud Lefebvre
Lecture Notes in Computer Science
2747
, 2003, pp. 388-397
Two dimensional packing: The power of rotation
Leah Epstein
Lecture Notes in Computer Science
2747
, 2003, pp. 398-407
Approximation schemes for the min-max starting time problem
Leah Epstein
,
Tamir Tassa
Lecture Notes in Computer Science
2747
, 2003, pp. 408-418
Quantum testers for hidden group properties
Katalin Friedl
,
Frédéric Magniez
,
Miklos Santha
,
Pranab Sen
Lecture Notes in Computer Science
2747
, 2003, pp. 419-428
Local LTL with past constants is expressively complete for Mazurkiewicz traces
Paul Gastin
,
Madhavan Mukund
,
K. Narayan Kumar
Lecture Notes in Computer Science
2747
, 2003, pp. 429-438
LTL with past and two-way very-weak alternating automata
Paul Gastin
,
Denis Oddoux
Lecture Notes in Computer Science
2747
, 2003, pp. 439-448
Match-bounded string rewriting systems
Alfons Geser
,
Dieter Hofbauer
,
Johannes Waldmann
Lecture Notes in Computer Science
2747
, 2003, pp. 449-459
Probabilistic and nondeterministic unary automata
Gregor Gramlich
Lecture Notes in Computer Science
2747
, 2003, pp. 460-469
On matroid properties definable in the MSO logic
Petr Hlinȇný
Lecture Notes in Computer Science
2747
, 2003, pp. 470-479
Characterizations of catalytic membrane computing systems
Oscar H. Ibarra
,
Zhe Dang
,
Omer Egecioglu
,
Gaurav Saxena
Lecture Notes in Computer Science
2747
, 2003, pp. 480-489
Augmenting local edge-connectivity between vertices and vertex subsets in undirected graphs
Toshimasa Ishii
,
Masayuki Hagiwara
Lecture Notes in Computer Science
2747
, 2003, pp. 490-499
Scheduling and traffic allocation for tasks with bounded splittability
Piotr Krysta
,
Peter Sanders
,
Berthold Vöcking
Lecture Notes in Computer Science
2747
, 2003, pp. 500-510
Computing average value in ad hoc networks
Miroslaw Kutyƚowski
,
Daniel Letkiewicz
Lecture Notes in Computer Science
2747
, 2003, pp. 511-520
A polynomial-time algorithm for deciding true concurrency equivalences of basic parallel processes
Sƚawomir Lasota
Lecture Notes in Computer Science
2747
, 2003, pp. 521-530
Solving the sabotage game is
P
SPACE-hard
Christof Löding
,
Philipp Rohde
Lecture Notes in Computer Science
2747
, 2003, pp. 531-540
The approximate well-founded semantics for logic programs with uncertainty
Yann Loyer
,
Umberto Straccia
Lecture Notes in Computer Science
2747
, 2003, pp. 541-550
Which is the worst-case Nash equilibrium?
Thomas Lücking
,
Marios Mavronicolas
,
Burkhard Monien
,
Manuel Rode
,
Paul Spirakis
,
Imrich Vrto
Lecture Notes in Computer Science
2747
, 2003, pp. 551-561
A unique decomposition theorem for ordered monoids with applications in process theory
Bas Luttik
Lecture Notes in Computer Science
2747
, 2003, pp. 562-571
Seiten
<
1
2
3
>