| Publication | Date of Publication | Type |
|---|
| Multiagent learning for competitive opinion optimization | 2024-10-07 | Paper |
| Budget-constrained cost-covering job assignment for a total contribution-maximizing platform | 2023-12-22 | Paper |
| On the Algorithmic Power of Spiking Neural Networks | 2022-07-18 | Paper |
| An alternating algorithm for finding linear Arrow-Debreu market equilibria | 2022-02-14 | Paper |
| How good is a two-party election game? | 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 | 2019-01-15 | Paper |
| Deterministic Extractors for Independent-Symbol Sources | 2017-07-27 | Paper |
| Extracting Computational Entropy and Learning Noisy Linear Functions | 2017-07-12 | Paper |
| Online Learning in Markov Decision Processes with Continuous Actions | 2016-11-30 | Paper |
| Generalized mirror descents in congestion games | 2016-11-01 | Paper |
| A communication-efficient private matching scheme in client-server model | 2016-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417654 | 2014-05-22 | Paper |
| Making Profit in a Prediction Market | 2012-09-25 | Paper |
| Complexity of hard-core set proofs | 2012-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2896172 | 2012-07-13 | Paper |
| Making Online Decisions with Bounded Memory | 2011-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174035 | 2011-10-12 | Paper |
| Computational Randomness from Generalized Hardcore Sets | 2011-08-19 | Paper |
| ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS | 2011-03-25 | Paper |
| Efficient String-Commitment from Weak Bit-Commitment | 2010-12-07 | Paper |
| Extractors | 2010-08-16 | Paper |
| On the Hardness against Constant-Depth Linear-Size Circuits | 2010-07-20 | Paper |
| Communication Requirements for Stable Marriages | 2010-05-28 | Paper |
| Extracting Computational Entropy and Learning Noisy Linear Functions | 2009-07-23 | Paper |
| On the Security Loss in Cryptographic Reductions | 2009-05-12 | Paper |
| Efficient algorithms for two generalized 2-median problems and the group median problem on trees | 2009-03-17 | Paper |
| Deterministic Extractors for Independent-Symbol Sources | 2009-03-12 | Paper |
| On the Complexity of Hardness Amplification | 2009-02-24 | Paper |
| Extracting Randomness from Multiple Independent Sources | 2008-12-21 | Paper |
| Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$ | 2008-11-11 | Paper |
| Impossibility Results on Weakly Black-Box Hardness Amplification | 2008-02-26 | Paper |
| Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility | 2007-11-29 | Paper |
| On the Complexity of Hard-Core Set Constructions | 2007-11-28 | Paper |
| Improved hardness amplification in NP | 2007-02-26 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| The impossibility of basing one-way permutations on central cryptographic primitives | 2006-08-14 | Paper |
| Oblivious polynomial evaluation and oblivious neural learning | 2005-09-22 | Paper |
| Deterministic Hypergraph Coloring and Its Applications | 2005-02-28 | Paper |
| Encryption against storage-bounded adversaries from on-line strong extractors | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472503 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474142 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474185 | 2004-08-04 | Paper |
| On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives | 2003-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409123 | 2003-06-30 | Paper |
| Improved pseudorandom generators for combinatorial rectangles | 2003-05-18 | Paper |
| A Note on Iterating an $\alpha$-ary Gray Code | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252345 | 2000-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247196 | 1999-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218418 | 1999-03-30 | Paper |
