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: Author="D'Souza, Deepak"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Timed lossy channel systems
Parosh Aziz Abdulla
,
Mohamed Faouzi Atig
,
Jonathan Cederberg
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 374-386
Algorithmic improvements of the Lovász local lemma via cluster expansion
Dimitris Achlioptas
,
Themis Gouleakis
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 16-23
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
Maintaining approximate maximum weighted matching in fully dynamic graphs
Abhash Anand
,
Surender Baswana
,
Manoj Gupta
,
Sandeep Sen
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 257-266
Computationally complete symbolic attacker in action
Gergei Bana
,
Pedro Adao
,
Hideki Sakurada
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 546-560
Decidable classes of documents for XPath
Vince Bárány
,
Mikolaj Bojanczyk
,
Diego Figueira
,
Pawel Parys
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 99-111
k
-delivery Traveling Salesman Problem on tree networks
Binay Bhattacharya
,
Yuzhuang Hu
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 325-336
Imperative programming in sets with atoms
Mikolaj Bojanczyk
,
Szymon Torunczyk
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 4-15
Approximate determinization of quantitative automata
Udi Boker
,
Thomas A. Henzinger
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 362-373
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
Rerouting shortest paths in planar graphs
Paul Bonsma
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 337-349
Visibly rational expressions
Laura Bozzelli
,
César Sánchez
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 211-223
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 bisimilarity of higher-order pushdown automata: Undecidability at order two
Christopher Broadbent
,
Stefan Göller
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 160-172
The complexity of quantitative information flow in recursive programs
Rohit Chadha
,
Michael Ummels
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 534-545
Density functions subject to a co-matroid constraint
Venkatesan T. Chakaravarthy
,
Natwar Modani
,
Sivaramakrishnan R. Natarajan
,
Sambuddha Roy
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 236-248
Scheduling resources for executing a partial set of jobs
Venkatesan T. Chakaravarthy
,
Arindam Pal
,
Sambuddha Roy
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 199-210
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
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
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
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
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
Static analysis for checking data format compatibility of programs
Pranavadatta Devaki
,
Aditya Kanade
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 522-533
Approximation algorithms for the unsplittable flow problem on paths and trees
Khaled Elbassioni
,
Naveen Garg
,
Divya Gupta
,
Amit Kumar
,
Vishal Narula
,
Arindam Pal
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 267-275
Exponential space improvement for minwise based algorithms
Guy Feigenblat
,
Ely Porat
,
Ariel Shiftan
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 70-85
Seiten 1
2
3
>