| Publication | Date of Publication | Type |
|---|
Multiagent learning for competitive opinion optimization
Theoretical Computer Science | 2024-10-07 | Paper |
Budget-constrained cost-covering job assignment for a total contribution-maximizing platform
Lecture Notes in Computer Science | 2023-12-22 | Paper |
On the Algorithmic Power of Spiking Neural Networks
(available as arXiv preprint) | 2022-07-18 | Paper |
An alternating algorithm for finding linear Arrow-Debreu market equilibria
Theory of Computing Systems | 2022-02-14 | Paper |
How good is a two-party election game?
Theoretical Computer Science | 2021-06-08 | Paper |
| The communication complexity of graphical games on grid graphs | 2020-06-18 | Paper |
Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games
Operations Research Letters | 2019-01-15 | Paper |
Deterministic Extractors for Independent-Symbol Sources
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Extracting Computational Entropy and Learning Noisy Linear Functions
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Online learning in Markov decision processes with continuous actions
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Generalized mirror descents in congestion games
Artificial Intelligence | 2016-11-01 | Paper |
A communication-efficient private matching scheme in client-server model
Information Sciences | 2016-07-11 | Paper |
| scientific article; zbMATH DE number 6297735 (Why is no real title available?) | 2014-05-22 | Paper |
Making profit in a prediction market
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Complexity of hard-core set proofs
Computational Complexity | 2012-09-21 | Paper |
Tree decomposition for large-scale SVM problems
Journal of Machine Learning Research (JMLR) | 2012-07-13 | Paper |
Making online decisions with bounded memory
Lecture Notes in Computer Science | 2011-10-19 | Paper |
| Adaptive prototype learning algorithms: theoretical and experimental studies | 2011-10-12 | Paper |
Computational Randomness from Generalized Hardcore Sets
Fundamentals of Computation Theory | 2011-08-19 | Paper |
ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS
Discrete Mathematics, Algorithms and Applications | 2011-03-25 | Paper |
Efficient string-commitment from weak bit-commitment
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
Extractors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On the hardness against constant-depth linear-size circuits
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Communication requirements for stable marriages
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Extracting Computational Entropy and Learning Noisy Linear Functions
Lecture Notes in Computer Science | 2009-07-23 | Paper |
On the Security Loss in Cryptographic Reductions
Advances in Cryptology - EUROCRYPT 2009 | 2009-05-12 | Paper |
Efficient algorithms for two generalized 2-median problems and the group median problem on trees
Theoretical Computer Science | 2009-03-17 | Paper |
Deterministic Extractors for Independent-Symbol Sources
Automata, Languages and Programming | 2009-03-12 | Paper |
On the Complexity of Hardness Amplification
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Extracting Randomness from Multiple Independent Sources
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
Post-Quantum Cryptography | 2008-11-11 | Paper |
Impossibility Results on Weakly Black-Box Hardness Amplification
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
Advances in Cryptology - EUROCRYPT 2007 | 2007-11-29 | Paper |
On the Complexity of Hard-Core Set Constructions
Automata, Languages and Programming | 2007-11-28 | Paper |
Improved hardness amplification in NP
Theoretical Computer Science | 2007-02-26 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
The impossibility of basing one-way permutations on central cryptographic primitives
Journal of Cryptology | 2006-08-14 | Paper |
Oblivious polynomial evaluation and oblivious neural learning
Theoretical Computer Science | 2005-09-22 | Paper |
Deterministic Hypergraph Coloring and Its Applications
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Encryption against storage-bounded adversaries from on-line strong extractors
Journal of Cryptology | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2080255 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081038 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081076 (Why is no real title available?) | 2004-08-04 | Paper |
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
Lecture Notes in Computer Science | 2003-07-16 | Paper |
| scientific article; zbMATH DE number 1942425 (Why is no real title available?) | 2003-06-30 | Paper |
Improved pseudorandom generators for combinatorial rectangles
Combinatorica | 2003-05-18 | Paper |
New algorithmic aspects of the local lemma with applications to routing and partitioning
SIAM Journal on Computing | 2002-04-23 | Paper |
A note on iterating an \(\alpha\)-ary Gray code
SIAM Journal on Discrete Mathematics | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1305459 (Why is no real title available?) | 2000-02-14 | Paper |
| scientific article; zbMATH DE number 1301963 (Why is no real title available?) | 1999-06-16 | Paper |
| scientific article; zbMATH DE number 1222830 (Why is no real title available?) | 1999-03-30 | Paper |
