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="Subramanian, Ashok"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An explanation of splaying
Ashok Subramanian
Journal of Algorithms
20
(3), 1996, pp. 512-525
A polynomial bound on the number of light cycles in an undirected graph
Ashok Subramanian
Information Processing Letters
53
, 1995, pp. 173-176
The parallel complexity of propagation in boolean circuits
Ashok Subramanian
Information and Computation
117
(2), 1995, March, pp. 266-275
A new approach to stable matching problems
Ashok Subramanian
SIAM Journal on Computing
23
(4), 1994, August, pp. 671-700
An explanation of splaying
Ashok Subramanian
Lecture Notes in Computer Science
880
, 1994, pp. 354-365
The complexity of circuit value and network stability
Ernst W. Mayr
,
Ashok Subramanian
Journal of Computer and System Sciences
44
, 1992, pp. 302-323
The computational complexity of the circuit value and network stability problems
Ashok Subramanian
Technical Report (STAN-CS-90-1311), 1990, May
The complexity of propagation
Ashok Subramanian
misc, 1990
The complexity of circuit value and network stability
Ernst W. Mayr
,
Ashok Subramanian
Technical Report (STAN-CS-89-1278), 1989, August
A new approach to stable matching problems
Ashok Subramanian
Technical Report (STAN-CS-89-1275), 1989, August
A note on the chromatic number of the alternative negation of two graphs
Alejandro A. Schäffer
,
Ashok Subramanian
Colloquium Mathematicum
LV
, 1988, pp. 367-370