D. Sivakumar

Available identifiers

Publication	Date of Publication	Type
An algorithmic view of voting	2016-10-20	Paper
A sieve algorithm for the shortest lattice vector problem	2015-02-27	Paper
Sampling algorithms	2015-02-27	Paper
Sparse and Lopsided Set Disjointness via Information Theory	2012-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q3002795	2011-05-24	Paper
Two applications of information complexity	2010-08-16	Paper
Approximate counting of inversions in a data stream	2010-08-05	Paper
Communication Lower Bounds Via the Chromatic Number	2008-04-24	Paper
On the hardness of approximating Multicut and Sparsest-Cut	2007-11-05	Paper
Comparing Partial Rankings	2007-09-06	Paper
Link Evolution: Analysis and Algorithms	2005-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q4828992	2004-11-29	Paper
An information statistics approach to data stream and communication complexity	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4471270	2004-07-28	Paper
Comparing Top k Lists	2004-01-08	Paper
On Polynomial-Factor Approximations to the Shortest Lattice Vector Length	2004-01-08	Paper
https://portal.mardi4nfdi.de/entity/Q4440423	2003-12-17	Paper
https://portal.mardi4nfdi.de/entity/Q4787194	2003-01-09	Paper
On polynomial approximations to the shortest lattice vector length	2002-03-24	Paper
https://portal.mardi4nfdi.de/entity/Q4252339	2000-02-28	Paper

This page was built for person: D. Sivakumar