The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Merrick L. Furst: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Merrick L. Furst, James B. Saxe, Michael Sipser
    Parity, Circuits, and the Polynomial-Time Hierarchy. [Citation Graph (3, 0)][DBLP]
    Mathematical Systems Theory, 1984, v:17, n:1, pp:13-27 [Journal]
  2. Merrick L. Furst, James B. Saxe, Michael Sipser
    Parity, Circuits, and the Polynomial-Time Hierarchy [Citation Graph (2, 0)][DBLP]
    FOCS, 1981, pp:260-270 [Conf]
  3. Avrim Blum, Merrick L. Furst
    Fast Planning Through Planning Graph Analysis. [Citation Graph (1, 0)][DBLP]
    Artif. Intell., 1997, v:90, n:1-2, pp:281-300 [Journal]
  4. Merrick L. Furst, Jeffrey C. Jackson, Sean W. Smith
    Improved Learning of AC0 Functions. [Citation Graph (0, 0)][DBLP]
    COLT, 1991, pp:317-325 [Conf]
  5. Avrim Blum, Merrick L. Furst, Michael J. Kearns, Richard J. Lipton
    Cryptographic Primitives Based on Hard Learning Problems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:278-291 [Conf]
  6. Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
    Pseudorandom Number Generation and Space Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:171-176 [Conf]
  7. Merrick L. Furst, John E. Hopcroft, Eugene M. Luks
    Polynomial-Time Algorithms for Permutation Groups [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:36-41 [Conf]
  8. Avrim Blum, Merrick L. Furst
    Fast Planning Through Planning Graph Analysis. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1636-1642 [Conf]
  9. Merrick L. Furst, Charles L. Isbell, Mark Guzdial
    ThreadsTM: how to restructure a computer science curriculum for a flat world. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2007, pp:420-424 [Conf]
  10. James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
    The Expressive Power of Voting Polynomials [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:402-409 [Conf]
  11. Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, Michael J. Kearns, Yishay Mansour, Steven Rudich
    Weakly learning DNF and characterizing statistical query learning using Fourier analysis. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:253-262 [Conf]
  12. Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton
    Multi-Party Protocols [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:94-99 [Conf]
  13. James R. Driscoll, Merrick L. Furst
    On the Diameter of Permutation Groups [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:152-160 [Conf]
  14. James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
    The Expressive Power of Voting Polynomials. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:2, pp:135-148 [Journal]
  15. James R. Driscoll, Merrick L. Furst
    Computing Short Generator Sequences [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:72, n:2, pp:117-132 [Journal]
  16. Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
    Pseudorandom Number Generation and Space Complexity [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:64, n:1-3, pp:43-51 [Journal]
  17. Jin-yi Cai, Merrick L. Furst
    PSPACE Survives Constant-Width Bottlenecks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1991, v:2, n:1, pp:67-76 [Journal]
  18. Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch
    Finding a maximum-genus graph imbedding. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:3, pp:523-534 [Journal]
  19. Merrick L. Furst, Jonathan L. Gross, Richard Statman
    Genus distributions for two classes of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:1, pp:22-36 [Journal]
  20. Merrick L. Furst, Ravi Kannan
    Succinct Certificates for Almost All Subset Sum Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:550-558 [Journal]

  21. On the Use of Computational Models of Influence for Managing Interactive Virtual Experiences. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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