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="Kurur, Piyush P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Evolutionary algorithms for quantum computers
Daniel Johannsen
,
Piyush P. Kurur
,
Johannes Lengler
Algorithmica
68
(1), 2014, pp. 152-189
Fast integer multiplication using modular arithmetic
Anindya De
,
Piyush P. Kurur
,
Chandan Saha
,
Ramprasad Saptharishi
SIAM Journal on Computing
42
(2), 2013, pp. 685-699
Representing groups on graphs
Sagarmoy Dutta
,
Piyush P. Kurur
Lecture Notes in Computer Science
5734
, 2009, pp. 295-306
Fast integer multiplication using modular arithmetic
Anindya De
,
Piyush P. Kurur
,
Chandan Saha
,
Ramprasad Saptharishi
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 499-505
Graph isomorphism is in SPP
V. Arvind
,
Piyush P. Kurur
Information and Computation
204
(5), 2006, pp. 835-852
A polynomial time Nilpotence test for Galois groups and related results
V. Arvind
,
Piyush P. Kurur
Lecture Notes in Computer Science
4162
, 2006, pp. 134-145
On the complexity of computing units in a number field
V. Arvind
,
Piyush P. Kurur
Lecture Notes in Computer Science
3076
, 2004, pp. 72-86
Upper bounds on the complexity of some Galois theory problems
V. Arvind
,
Piyush P. Kurur
Lecture Notes in Computer Science
2906
, 2003, pp. 716-725
Graph isomorphism is in SPP
V. Arvind
,
Piyush P. Kurur
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 743-750