Merrick L. Furst

Publication Activity (10 Years)

Years Active: 1980-2009
Publications (10 Years): 0

Publications

David L. Roberts, Merrick L. Furst, Brian Dorn, Charles L. Isbell Jr.
Using influence and persuasion to shape player experiences. Sandbox@SIGGRAPH (2009)
David L. Roberts, Charles Lee Isbell Jr., Mark O. Riedl, Ian Bogost, Merrick L. Furst
On the Use of Computational Models of Influence for Managing Interactive Virtual Experiences. ICIDS (2008)
Merrick L. Furst, Charles L. Isbell Jr., Mark Guzdial
: how to restructure a computer science curriculum for a flat world. SIGCSE (2007)
Avrim Blum, Merrick L. Furst
Fast Planning Through Planning Graph Analysis. Artif. Intell. 90 (1-2) (1997)
Avrim Blum, Merrick L. Furst
Fast Planning Through Planning Graph Analysis. IJCAI (1995)
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. STOC (1994)
James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
The Expressive Power of Voting Polynomials. Comb. 14 (2) (1994)
Avrim Blum, Merrick L. Furst, Michael J. Kearns, Richard J. Lipton
Cryptographic Primitives Based on Hard Learning Problems. CRYPTO (1993)
Shai Oliker, Merrick L. Furst, Oded Maimon
Design architectures and training of neural networks with a distributed genetic algorithm. ICNN (1993)
Ronald Rosenfeld, Xuedong Huang, Merrick L. Furst
Exploiting correlations among competing models with application to large vocabulary speech recognition. ICASSP (1992)
Shai Oliker, Merrick L. Furst, Oded Maimon
A Distributed Genetic Algorithm for Neural Network Design and Training. Complex Syst. 6 (5) (1992)
Jin-yi Cai, Merrick L. Furst
PSPACE Survives Constant-Width Bottlenecks. Int. J. Found. Comput. Sci. 2 (1) (1991)
James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
The Expressive Power of Voting Polynomials STOC (1991)
Merrick L. Furst, Jeffrey C. Jackson, Sean W. Smith
Functions. COLT (1991)
Merrick L. Furst, Ravi Kannan
Succinct Certificates for Almost All Subset Sum Problems. SIAM J. Comput. 18 (3) (1989)
Merrick L. Furst, Jonathan L. Gross, Richard Statman
Genus distributions for two classes of graphs. J. Comb. Theory, Ser. B 46 (1) (1989)
Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch
Finding a maximum-genus graph imbedding. J. ACM 35 (3) (1988)
James R. Driscoll, Merrick L. Furst
Computing Short Generator Sequences Inf. Comput. 72 (2) (1987)
Jonathan L. Gross, Merrick L. Furst
Hierarchy for imbedding-distribution invariants of a graph. J. Graph Theory 11 (2) (1987)
Jin-Yi Cai, Merrick L. Furst
PSPACE survives three-bit bottlenecks. Computational Complexity Conference (1987)
Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
Pseudorandom Number Generation and Space Complexity Inf. Control. 64 (1-3) (1985)
Merrick L. Furst, James B. Saxe, Michael Sipser
Parity, Circuits, and the Polynomial-Time Hierarchy. Math. Syst. Theory 17 (1) (1984)
Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton
Multi-Party Protocols STOC (1983)
Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
Pseudorandom Number Generation and Space Complexity. FCT (1983)
James R. Driscoll, Merrick L. Furst
On the Diameter of Permutation Groups STOC (1983)
Merrick L. Furst, James B. Saxe, Michael Sipser
Parity, Circuits, and the Polynomial-Time Hierarchy FOCS (1981)
Merrick L. Furst, John E. Hopcroft, Eugene M. Luks
Polynomial-Time Algorithms for Permutation Groups FOCS (1980)