The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christopher Umans: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christopher Umans
    Reconstructive Dispersers and Hitting Set Generators. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:460-471 [Conf]
  2. Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans
    On the Complexity of Succinct Zero-Sum Games. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:323-332 [Conf]
  3. Elchanan Mossel, Christopher Umans
    On the Complexity of Approximating the VC Dimension. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:220-225 [Conf]
  4. Ronen Shaltiel, Christopher Umans
    Pseudorandomness for Approximate Counting and Sampling. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:212-226 [Conf]
  5. Christopher Umans
    Pseudo-Random Generators for All Hardnesses. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:11- [Conf]
  6. Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, Christopher Umans
    Group-theoretic Algorithms for Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:379-388 [Conf]
  7. Henry Cohn, Christopher Umans
    A Group-Theoretic Approach to Fast Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:438-449 [Conf]
  8. Ronen Shaltiel, Christopher Umans
    Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:648-657 [Conf]
  9. Christopher Umans
    The Minimum Equivalent DNF Problem and Shortest Implicants. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:556-563 [Conf]
  10. Christopher Umans
    Hardness of Approximating Sigma2p Minimization Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:465-474 [Conf]
  11. Christopher Umans, William Lenhart
    Hamiltonian Cycles in Solid Grid Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:496-505 [Conf]
  12. Amnon Ta-Shma, Christopher Umans
    Better lossless condensers through derandomized curve samplers. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:177-186 [Conf]
  13. Shankar Kalyanaraman, Christopher Umans
    On Obtaining Pseudorandomness from Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:105-116 [Conf]
  14. Christopher Umans
    On the Complexity and Inapproximability of Shortest Implicant Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:687-696 [Conf]
  15. Christopher Umans
    Group-theoretic algorithms for matrix multiplication. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2006, pp:5- [Conf]
  16. Polina Golland, Ron Kikinis, Christopher Umans, Michael Halle, Martha Elizabeth Shenton, Jens A. Richolt
    AnatomyBrowser: A Framework for Integration of Medical Information. [Citation Graph (0, 0)][DBLP]
    MICCAI, 1998, pp:720-731 [Conf]
  17. Amnon Ta-Shma, Christopher Umans, David Zuckerman
    Loss-less condensers, unbalanced expanders, and extractors. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:143-152 [Conf]
  18. Christopher Umans
    Pseudo-random generators for all hardnesses. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:627-634 [Conf]
  19. Christopher Umans
    Optimization Problems in the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:345-355 [Conf]
  20. Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans
    On the complexity of succinct zero-sum games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:001, pp:- [Journal]
  21. Ronen Shaltiel, Christopher Umans
    Pseudorandomness for Approximate Counting and Sampling [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:086, pp:- [Journal]
  22. Ronen Shaltiel, Christopher Umans
    Simple extractors for all min-entropies and a new pseudorandom generator. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:2, pp:172-216 [Journal]
  23. Elchanan Mossel, Christopher Umans
    On the complexity of approximating the VC dimension. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:4, pp:660-671 [Journal]
  24. Christopher Umans
    The Minimum Equivalent DNF Problem and Shortest Implicants. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:4, pp:597-611 [Journal]
  25. Christopher Umans
    Pseudo-random generators for all hardnesses. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:419-440 [Journal]
  26. Christopher Umans, Tiziano Villa, Alberto L. Sangiovanni-Vincentelli
    Complexity of two-level logic minimization. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2006, v:25, n:7, pp:1230-1246 [Journal]
  27. Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
    Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:96-108 [Conf]
  28. Shankar Kalyanaraman, Christopher Umans
    Algorithms for Playing Games with Limited Randomness. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:323-334 [Conf]
  29. Ronen Shaltiel, Christopher Umans
    Low-end uniform hardness vs. randomness tradeoffs for AM. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:430-439 [Conf]
  30. Ronen Shaltiel, Christopher Umans
    Pseudorandomness for Approximate Counting and Sampling. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:4, pp:298-341 [Journal]
  31. Amnon Ta-Shma, Christopher Umans, David Zuckerman
    Lossless Condensers, Unbalanced Expanders, And Extractors. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:2, pp:213-240 [Journal]

  32. Fast Modular Composition in any Characteristic. [Citation Graph (, )][DBLP]


  33. The Complexity of Rationalizing Network Formation. [Citation Graph (, )][DBLP]


  34. The Complexity of Boolean Formula Minimization. [Citation Graph (, )][DBLP]


  35. The Complexity of Rationalizing Matchings. [Citation Graph (, )][DBLP]


  36. Inapproximability for VCG-Based Combinatorial Auctions. [Citation Graph (, )][DBLP]


  37. Fast polynomial factorization and modular composition in small characteristic. [Citation Graph (, )][DBLP]


  38. Reconstructive Dispersers and Hitting Set Generators. [Citation Graph (, )][DBLP]


  39. On the Complexity of Succinct Zero-Sum Games. [Citation Graph (, )][DBLP]


  40. Pseudorandom generators and the BQP vs. PH problem [Citation Graph (, )][DBLP]


  41. The Complexity of Rationalizing Matchings. [Citation Graph (, )][DBLP]


  42. Low-end uniform hardness vs. randomness tradeoffs for AM. [Citation Graph (, )][DBLP]


  43. Algorithms for Playing Games with Limited Randomness. [Citation Graph (, )][DBLP]


  44. Extractors and condensers from univariate polynomials. [Citation Graph (, )][DBLP]


  45. On obtaining pseudorandomness from error-correcting codes.. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002