• Publications
  • Influence
Efficient Rijndael Encryption Implementation with Composite Field Arithmetic
This work explores the use of subfield arithmetic for efficient implementations of Galois Field arithmetic especially in the context of the Rijndael block cipher and describes how to select a representation which minimizes the computation cost of the relevant arithmetic. Expand
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
  • V. Guruswami, A. Rudra
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 18 November 2005
This paper presents an explicit construction of error-correcting codes of rate that can be list decoded in polynomial time up to a fraction of worst-case errors, and their methods directly yield better decoding algorithms for RS codes when errors occur in phased bursts. Expand
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
A generalization of the stochastic online matching problem that also models preference-uncertainty and timeouts of buyers, and gives a constant factor approximation algorithm. Expand
Skew strikes back: new developments in the theory of join algorithms
A survey of recent work on join algorithms that have provable worst-case optimality runtime guarantees is described and a simpler and unified description of these algorithms is provided that is useful for theory-minded readers, algorithm designers, and systems implementors. Expand
Efficiently decodable non-adaptive group testing
This paper presents a randomness efficient construction of list disjunct matrices, expanders, dispersers and disjunction matrices that can be decoded in time poly(i-d), and achieves an efficient decoding time and matches the best known <i-O</i>(<i>d</i><sup>2</sup> log <i>n</i>) bound on the number of tests. Expand
Online learning in online auctions
It is demonstrated that results from online learning can be usefully applied in this context, and a new auction for digital goods is derived that achieves a constant competitive ratio with respect to the optimal (offline) fixed price revenue. Expand
Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract)
This paper studies error-tolerant list disjunct matrices which can correct up to e0 false positive and e1 false negative tests in sub-linear time and derives a family of (strongly) explicit constructions of list-disjunctMatrices which are either optimal or near optimal, and which are also efficiently decodable. Expand
Approximating Matches Made in Heaven
A simple greedy strategy for selecting probes is given which produces a matching whose cardinality is, in expectation, at least a quarter of the size of this optimal algorithm's matching. Expand
FAQ: Questions Asked Frequently
An approximation algorithm is designed to find an equivalent variable ordering that has the best `fractional FAQ-width' and implies a host of known and a few new results in graphical model inference, matrix operations, relational joins, and logic. Expand
Ordering by weighted number of wins gives a good ranking for weighted tournaments
An infinite family of (unweighted) tournaments for which the above algorithm, irrespective of how ties are broken) has an approximation ratio of 5 - ε. Expand