BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
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 DBLP: Umans:Christopher

Contributed to:

ICALP (1) 20082008
STOC 20082008
STOC 20072007
STOC 20022002
STOC 20012001
ICALP 19991999

Wrote 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.
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.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.