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="Subrahmanyam, K.V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Solving some discrepancy problems in
NC
S. Mahajan
,
E.A. Ramos
,
K.V. Subrahmanyam
Algorithmica
29
(3), 2001, pp. 371-395
Computing mimicking networks
S. Chaudhuri
,
K.V. Subrahmanyam
,
F. Wagner
,
C.D. Zaroliagis
Algorithmica
26
(1), 2000, pp. 31-49
Computing mimicking networks
Shiva Chaudhuri
,
K.V. Subrahmanyam
,
Frank Wagner
,
Christos D. Zaroliagis
Lecture Notes in Computer Science
1443
, 1998, pp. 556-567
Solving some discrepancy problems in
NC
Sanjeev Mahajan
,
Edgar A. Ramos
,
K.V. Subrahmanyam
Lecture Notes in Computer Science
1346
, 1997, pp. 22-36
Descriptive complexity of
\#P
functions
Sanjeev Saluja
,
K.V. Subrahmanyam
,
Madhukar N. Thakur
Journal of Computer and System Sciences
50
(3), 1995, pp. 493-505
Abstract and generic rigidity in the plane
Sachin Patkar
,
Brigitte Servatius
,
K.V. Subrahmanyam
Journal of Combinatorial Theory Series B
62
(1), 1994, pp. 107-113
Directed monotone contact networks for threshold functions
Jaikumar Radhakrishnan
,
K.V. Subrahmanyam
Information Processing Letters
50
, 1994, pp. 199-203
Directed vs. undirected monotone contact networks for treshold functions
Magnús Halldórsson
,
Jaikumar Radhakrishnan
,
K.V. Subrahmanyam
Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, FOCS'93 (Palo Alto, CA, November 3-5, 1993)
, 1993, pp. 604-613
On some communication complexity problems related to threshold functions
Magnús M. Halldórsson
,
Jaikumar Radhakrishnan
,
K.V. Subrahmanyam
Lecture Notes in Computer Science
761
, 1993, pp. 248-259
Multiprocessors scheduling for imprecise computations in a hard real-time environment
Ashok Khemka
,
R.K. Shyamasundar
,
K.V. Subrahmanyam
Proceedings of the 7th International Parallel Processing Symposium, IPPS'93 (Newport Beach, California, April 13-16, 1993)
, 1993, pp. 374-378
Desriptive complexity of
\#P
functions
Sanjeev Saluja
,
K.V. Subrahmanyam
,
Madhukar N. Thakur
Technical Report (UCSC-CRL-92-03), 1992, January
Descriptive complexity of \#P functions
Sanjeev Saluja
,
K.V. Subrahmanyam
,
Madhukar N. Thakur
Proceedings of the 7th Annual Conference on Structure in Complexity Theory, CSCT'92 (Boston University, Boston, Massachusetts, June 22-25, 1992)
, 1992, pp. 169-184
On the power of enumerative counting
Sanjeev Saluja
,
K.V. Subrahmanyam
Information Processing Letters
43
, 1992, pp. 119-125