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=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graphs, rewriting and pathway reconstruction for rule-based models
Vincent Danos
,
Jerome Feret
,
Walter Fontana
,
Russell Harmer
,
Jonathan Hayman
,
Jean Krivine
,
Chris Thompson-Walsh
,
Glynn Winskel
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 276-288
On the complexity of parameterized reachability in reconfigurable broadcast networks
Giorgio Delzanno
,
Arnaud Sangnier
,
Riccardo Traverso
,
Gianluigi Zavattaro
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 289-300
Extending the Rackoff technique to Affine nets
Rémi Bonnet
,
Alain Finkel
,
M. Praveen
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 301-312
Accelerating tree-automatic relations
Anthony Widjaja Lin
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 313-324
k
-delivery Traveling Salesman Problem on tree networks
Binay Bhattacharya
,
Yuzhuang Hu
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 325-336
Rerouting shortest paths in planar graphs
Paul Bonsma
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 337-349
Space efficient edge-fault tolerant routing
Varun Rajan
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 350-361
Approximate determinization of quantitative automata
Udi Boker
,
Thomas A. Henzinger
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 362-373
Timed lossy channel systems
Parosh Aziz Abdulla
,
Mohamed Faouzi Atig
,
Jonathan Cederberg
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 374-386
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
Johannes Köbler
,
Sebastian Kuhnert
,
Oleg Verbitsky
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 387-399
Directed acyclic subgraph problem parameterized above the Poljak-Turzik bound
Robert Crowston
,
Gregory Gutin
,
Mark Jones
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 400-411
Beyond Max-Cut: Lambda-extendible properties parameterized above the Poljak-Turzik bound
Matthias Mnich
,
Geevarghese Philip
,
Saket Saurabh
,
Ondrej Suchy
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 412-423
Subexponential parameterized odd cycle transversal on planar graphs
Daniel Lokshtanov
,
Saket Saurabh
,
Magnus Wahlström
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 424-434
Deciding probabilistic automata weak bisimulation in polynomial time
Holger Hermanns
,
Andrea Turrini
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 435-447
Bisimilarity of probabilistic pushdown automata
Vojtech Forejt
,
Petr Jancar
,
Stefan Kiefer
,
James Worrell
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 448-460
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
Krishnendu Chatterjee
,
Manas Joglekar
,
Nisarg Shah
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 461-473
Verification of open interactive Markov chains
Tomas Brazdil
,
Holger Hermanns
,
Jan Krcal
,
Jan Kretinsky
,
Vojtech Rehak
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 474-485
On the sensitivity of shape fitting problems
Kasturi Varadarajan
,
Xin Xiao
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 486-497
Overlap of convex polytopes under rigid motion
Hee-Kap Ahn
,
Siu-Wing Cheng
,
Hyuk Jun Kweon
,
Juyoung Yon
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 498-509
Minimum enclosing circle with few extra variables
Minati De
,
Subhas C. Nandy
,
Sasanka Roy
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 510-521
Static analysis for checking data format compatibility of programs
Pranavadatta Devaki
,
Aditya Kanade
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 522-533
The complexity of quantitative information flow in recursive programs
Rohit Chadha
,
Michael Ummels
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 534-545
Computationally complete symbolic attacker in action
Gergei Bana
,
Pedro Adao
,
Hideki Sakurada
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 546-560
Forms of determinism for automata
Thomas Colcombet
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 1-23
Iterative methods in combinatorial optimization
R. Ravi
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 24-24
Seiten
<
1
2
3
4
5
>