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="Radhakrishnan, Jaikumar"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Streaming algorithms for language recognition problems
Ajesh Babu
,
Nutan Limaye
,
Jaikumar Radhakrishnan
,
Girish Varma
Theoretical Computer Science
494
, 2013, pp. 13-23
More on a problem of Zarankiewicz
Chinmoy Dutta
,
Jaikumar Radhakrishnan
Lecture Notes in Computer Science
7676
, 2012, pp. 257-266
Online set packing
Yuval Emek
,
Magnús M. Halldórsson
,
Yishay Mansour
,
Boaz Patt-Shamir
,
Jaikumar Radhakrishnan
,
Dror Rawitz
SIAM Journal on Computing
41
(4), 2012, pp. 728-746
Streaming algorithms for 2-coloring uniform hypergraphs
Jaikumar Radhakrishnan
,
Saswata Shannigrahi
Lecture Notes in Computer Science
6844
, 2011, pp. 667-678
Data structures for storing small sets in the bitprobe model
Jaikumar Radhakrishnan
,
Smit Shah
,
Saswata Shannigrahi
Lecture Notes in Computer Science
6347
, 2010, pp. 159-170
A property of quantum relative entropy with an application to privacy in quantum communication
Rahul Jain
,
Jaikumar Radhakrishnan
,
Pranab Sen
Journal of the ACM
56
(6), 2009, pp. 33: 1-32
Random measurement bases, quantum state distinction and applications to the hidden subgroup problem
Jaikumar Radhakrishnan
,
Martin Rötteler
,
Pranab Sen
Algorithmica
55
(3), 2009, pp. 490-516
Compete partitions of graphs
Magnús M. Halldórsson
,
Guy Kortsarz
,
Jaikumar Radhakrishnan
,
Sivaramakrishnan Sivasubramanian
Combinatorica
27
(5), 2007, pp. 519-550
Zero error list-decoding capacity of the
q/(q - 1)
channel
Sourav Chakraborty
,
Jaikumar Radhakrishnan
,
Nandakumar Raghunathan
,
Prashant Sasatte
Lecture Notes in Computer Science
4337
, 2006, pp. 129-138
Tradeoffs in depth-two superconcentrators
Chinmoy Dutta
,
Jaikumar Radhakrishnan
Lecture Notes in Computer Science
3884
, 2006, pp. 372-383
Gap amplification in PCPs using lazy random walks
Jaikumar Radhakrishnan
Lecture Notes in Computer Science
4051
, 2006, pp. 96-107
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Devdatt Dubhashi
,
Alessandro Mei
,
Alessandro Panconesi
,
Jaikumar Radhakrishnan
,
Aravind Srinivasan
Journal of Computer and System Sciences
71
(4), 2005, pp. 467-479
Is partial quantum search of a database any easier?
Lov K. Grover
,
Jaikumar Radhakrishnan
Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2005 (Las Vegas, Nevada, USA, July 18-20, 2005)
, 2005, pp. 186-194
Essential covers of the cube by hyperplanes
Nathan Linial
,
Jaikumar Radhakrishnan
Journal of Combinatorial Theory Series A
109
(2), 2005, pp. 331-338
On converting CNF to DNF
Peter Bro Miltersen
,
Jaikumar Radhakrishnan
,
Ingo Wegener
Theoretical Computer Science
347
(1-2), 2005, pp. 325-335
On the power of random bases in Fourier sampling: Hidden subgroup problem in the Heisenberg group
Jaikumar Radhakrishnan
,
Martin Rötteler
,
Pranab Sen
Lecture Notes in Computer Science
3580
, 2005, pp. 1399-1411
Expansion properties of (secure) wireless networks
Alessandro Panconesi
,
Jaikumar Radhakrishnan
Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2004 (Barcelona, Spain, June 27-30, 2004)
, 2004, pp. 281-285
A cryptographically sound security proof of the Needham-Schroeder-Lowe public-key protocol
Michael Backes
,
Birgit Pfitzmann
Lecture Notes in Computer Science
2914
, 2003, pp. 1-12
Constructions of sparse asymmetric connectors
Andreas Baltz
,
Gerold Jäger
,
Anand Srivastav
Lecture Notes in Computer Science
2914
, 2003, pp. 13-22
A separation logic for resource distribution
Nicolas Biri
,
Didier Galmiche
Lecture Notes in Computer Science
2914
, 2003, pp. 23-37
An equational theory for transactions
Andrew P. Black
,
Vincent Cremet
,
Rachid Guerraoui
,
Martin Odersky
Lecture Notes in Computer Science
2914
, 2003, pp. 38-49
Axioms for regular words
Stephen L. Bloom
,
Zoltán Ésik
Lecture Notes in Computer Science
2914
, 2003, pp. 50-61
1-bounded TWA cannot be determinized
Mikoƚaj Bojañczyk
Lecture Notes in Computer Science
2914
, 2003, pp. 62-73
Reachability analysis of process rewrite systems
Ahmed Bouajjani
,
Tayssir Touili
Lecture Notes in Computer Science
2914
, 2003, pp. 74-87
Pushdown games with unboundedness and regular conditions
Alexis-Julien Bouquet
,
Oliver Serre
,
Igor Walukiewicz
Lecture Notes in Computer Science
2914
, 2003, pp. 88-99
Seiten 1
2
3
4
>