Travelled to:1 × Czech Republic
1 × Greece
1 × Iceland
1 × USA
2 × Canada
Collaborated with:∅ D.Buchfuhrer R.Shaltiel A.Ta-Shma D.Zuckerman
Talks about:complex (2) random (2) hard (2) characterist (1) inapproxim (1) extractor (1) unbalanc (1) tradeoff (1) shortest (1) polynomi (1)
Person: Christopher Umans
DBLP: Umans:Christopher
Contributed to:
2008
20082007200220011999Wrote 6 papers:
- ICALP-A-2008-BuchfuhrerU #complexity
- The Complexity of Boolean Formula Minimization (DB, CU), pp. 24–35.
- STOC-2008-Umans #composition #performance #polynomial
- Fast polynomial factorization and modular composition in small characteristic (CU), pp. 481–490.
- STOC-2007-ShaltielU #trade-off
- Low-end uniform hardness vs. randomness tradeoffs for AM (RS, CU), pp. 430–439.
- STOC-2002-Umans #generative #pseudo
- Pseudo-random generators for all hardnesses (CU), pp. 627–634.
- STOC-2001-Ta-ShmaUZ
- Loss-less condensers, unbalanced expanders, and extractors (ATS, CU, DZ), pp. 143–152.
- ICALP-1999-Umans #complexity #on the #problem
- On the Complexity and Inapproximability of Shortest Implicant Problems (CU), pp. 687–696.