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="Sharma, Vikram"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Near optimal tree size bounds on a simple real root isolation algorithm
Vikram Sharma
,
Chee K. Yap
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC'2012 (Grenoble, France, July 22-25, 2012)
, 2012, pp. 319-326
Applications of dimensionality reduction and exponential sums to graph automorphism
Madhusudan Manjunath
,
Vikram Sharma
Theoretical Computer Science
412
(29), 2011, pp. 3639-3649
Bounds on absolute positiveness of multivariate polynomials
Prashant Batra
,
Vikram Sharma
Journal Symbolic Computation
45
(6), 2010, pp. 617-628
Complexity of real root isolation using continued fractions
Vikram Sharma
Theoretical Computer Science
409
(2), 2008, pp. 292-310
Complexity of real root isolation using continued fractions
Vikram Sharma
Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, ISSAC'2007 (Waterloo, Ontario, Canada, July 29 - August 01, 2007)
, 2007, pp. 339-346
Almost tight recursion tree bounds for the Descartes method
Arno Eigenwillig
,
Vikram Sharma
,
Chee K. Yap
Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC'2006 (Università degli Studi di Genova, Genova, Italy, July 9-12, 2006)
, 2006, pp. 71-78
Robust approximate zeros
Vikram Sharma
,
Zilin Du
,
Chee K. Yap
Lecture Notes in Computer Science
3669
, 2005, pp. 874-886