The following pages link to Chi-Jen Lu (Q334812):
Displaying 48 items.
- Generalized mirror descents in congestion games (Q334813) (← links)
- Complexity of hard-core set proofs (Q451110) (← links)
- A communication-efficient private matching scheme in client-server model (Q726566) (← links)
- Improved hardness amplification in NP (Q868960) (← links)
- Efficient algorithms for two generalized 2-median problems and the group median problem on trees (Q1006061) (← links)
- Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games (Q1709974) (← links)
- Improved pseudorandom generators for combinatorial rectangles (Q1872894) (← links)
- Encryption against storage-bounded adversaries from on-line strong extractors (Q1879467) (← links)
- How good is a two-party election game? (Q2031050) (← links)
- An alternating algorithm for finding linear Arrow-Debreu market equilibria (Q2075387) (← links)
- The communication complexity of graphical games on grid graphs (Q2190386) (← links)
- The impossibility of basing one-way permutations on central cryptographic primitives (Q2499269) (← links)
- Oblivious polynomial evaluation and oblivious neural learning (Q2566001) (← links)
- A Note on Iterating an $\alpha$-ary Gray Code (Q2719165) (← links)
- Online Learning in Markov Decision Processes with Continuous Actions (Q2835638) (← links)
- (Q2896172) (← links)
- Making Profit in a Prediction Market (Q2914357) (← links)
- Efficient String-Commitment from Weak Bit-Commitment (Q3058661) (← links)
- ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS (Q3084685) (← links)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- Making Online Decisions with Bounded Memory (Q3093955) (← links)
- (Q3174035) (← links)
- Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$ (Q3535361) (← links)
- Extracting Randomness from Multiple Independent Sources (Q3547226) (← links)
- Communication Requirements for Stable Marriages (Q3563017) (← links)
- On the Hardness against Constant-Depth Linear-Size Circuits (Q3578298) (← links)
- Extractors (Q3581258) (← links)
- On the Complexity of Hardness Amplification (Q3604852) (← links)
- Deterministic Extractors for Independent-Symbol Sources (Q3613751) (← links)
- On the Security Loss in Cryptographic Reductions (Q3627428) (← links)
- (Q4218418) (← links)
- (Q4247196) (← links)
- (Q4252345) (← links)
- (Q4409123) (← links)
- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives (Q4412792) (← links)
- (Q4472503) (← links)
- (Q4474142) (← links)
- (Q4474185) (← links)
- Deterministic Hypergraph Coloring and Its Applications (Q4652639) (← links)
- On the Algorithmic Power of Spiking Neural Networks (Q5090400) (← links)
- Extracting Computational Entropy and Learning Noisy Linear Functions (Q5273500) (← links)
- Deterministic Extractors for Independent-Symbol Sources (Q5281198) (← links)
- Extracting Computational Entropy and Learning Noisy Linear Functions (Q5323082) (← links)
- (Q5417654) (← links)
- On the Complexity of Hard-Core Set Constructions (Q5428808) (← links)
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility (Q5429389) (← links)
- Impossibility Results on Weakly Black-Box Hardness Amplification (Q5444979) (← links)
- Theory of Cryptography (Q5898369) (← links)
