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=Leibniz International Proceedings in Informatics (LIPIcs) AND YEAR=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Expressiveness of streaming string transducers
Rajeev Alur
,
Pavol C̑erný
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 1-12
Special tree-width and the verification of monadic second-order graph properties
Bruno Courcelle
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 13-29
On extracting computations from propositional proofs (a survey)
Pavel Pudlák
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 30-41
Recent progress and open problems in algorithmic convex geometry
Santosh S. Vempala
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 42-64
Playing in stochastic environment: From multi-armed bandits to two-player games
Wiesƚaw Zielonka
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 65-72
Better algorithms for satisfiability problems for formulas of bounded rank-width
Robert Ganian
,
Petr Hlinȇný
,
Jan Obdrz̑álek
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 73-83
Satisfiability of acyclic and almost acyclic CNF formulas
Sebastian Ordyniak
,
Daniel Paulusma
,
Stefan Szeider
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 84-95
The effect of girth on the kernelization complexity of Connected Dominating tSet
Neeldhara Misra
,
Geevarghese Philip
,
Venkatesh Raman
,
Saket Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 96-107
One-counter stochastic games
Tomás̑ Brázdil
,
Václav Broz̑ek
,
Kousha Etessami
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 108-119
ATL with strategy contexts: Expressiveness and model checking
Arnaud Da Costa
,
François Laroussinie
,
Nicolas Markey
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 120-132
Reasoning about strategies
Fabio Mogavero
,
Aniello Murano
,
Moshe Y. Vardi
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 133-144
New results on quantum property testing
Sourav Chakraborty
,
Eldar Fischer
,
Arie Matsliah
,
Ronald de Wolf
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 145-156
Lower bounds for Quantum Oblivious Transfer
André Chailloux
,
Iordanis Kerenidis
,
Jamie Sikora
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 157-168
Minimizing busy time in multiple machine real-time scheduling
Rohit Khandekar
,
Baruch Schieber
,
Hadas Shachnai
,
Tami Tamir
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 169-180
A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints
Venkatesan T. Chakaravarthy
,
Anamitra R. Choudhury
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 181-191
Place-boundedness for vector addition systems with one zero-test
Rémi Bonnet
,
Alain Finkel
,
Jérôme Leroux
,
Marc Zeitoun
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 192-203
Model checking time-constrained scenario-based specifications
S. Akshay
,
Paul Gastin
,
Madhavan Mukund
,
K. Narayan Kumar
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 204-215
Global model checking of ordered multi-pushdown systems
Mohamed Faouzi Atig
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 216-227
The complexity of model checking (collapsible) higher-order pushdown systems
Matthew Hague
,
Anthony Widjaja To
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 228-239
A graph polynomial for independent sets of bipartite graphs
Qi Ge
,
Daniel S̑tefankovic̑
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 240-250
Finding independent sets in unions of perfect graphs
Venkatesan T. Chakaravarthy
,
Vinayaka Pandit
,
Sambuddha Roy
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 251-259
Fast equivalence-checking for normed context-free processes
Wojciech Czerwiński
,
Slawomir Lasota
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 260-271
Generalizing the powerset construction, coalgebraically
Alexandra Silva
,
Filippo Bonchi
,
Marcello M. Bonsangue
,
Jan J.M.M. Rutten
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 272-283
Uniqueness of normal forms is decidable for shallow term rewrite systems
Nicholas Radcliffe
,
Rakesh M. Verma
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 284-295
Deterministic black-box identity testing
\pi
-ordered algebraic branching programs
Maurice Jansen
,
Youming Qiao
,
Jayalal Sarma M.N.
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 296-307
Seiten 1
2
3
4
>