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: Author="Subramani, K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Feasibility checking in Horn constraint systems through a reduction based approach
K. Subramani
,
James Worthington
Theoretical Computer Science
576
, 2015, pp. 1-17
On the complexity of quantified linear systems
Salvatore Ruggieri
,
Pavlos Eirinakis
,
K. Subramani
,
Piotr Wojciechowski
Theoretical Computer Science
518
, 2014, pp. 128-134
A combinatorial algorithm for Horn programs
R. Chandrasekaran
,
K. Subramani
Lecture Notes in Computer Science
5878
, 2009, pp. 1114-1123
Random walks for selected Boolean implication and equivalence problems
K. Subramani
,
Hong-Jian Lai
,
Xiaofeng Gu
Acta Informatica
46
(2), 2009, pp. 155-168
Out of order quantifier elimination for standard quantified linear programs
K. Subramani
,
D. Desovski
Journal Symbolic Computation
40
(6), 2005, pp. 1383-1396
Cascading random walks
K. Subramani
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 599-622
Tractable fragments of Presburger arithmetic
K. Subramani
Theory of Computing Systems
38
(5), 2005, pp. 647-668
Parametric scheduling for network constraints
K. Subramani
Lecture Notes in Computer Science
2108
, 2001, pp. 550-560