Merrick L. Furst

According to our database, Merrick L. Furst authored at least 24 papers between 1980 and 2009.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

2009

Using influence and persuasion to shape player experiences.

David L. Roberts, Merrick L. Furst, Brian Dorn, Charles L. Isbell Jr.

Proceedings of the 2009 ACM SIGGRAPH Symposium on Video Games, 2009

2008

On the Use of Computational Models of Influence for Managing Interactive Virtual Experiences.

David L. Roberts, Charles Lee Isbell Jr., Mark O. Riedl, Ian Bogost, Merrick L. Furst

Proceedings of the Interactive Storytelling, 2008

2007

Threads^TM: how to restructure a computer science curriculum for a flat world.

Merrick L. Furst, Charles L. Isbell Jr., Mark Guzdial

Proceedings of the 38th SIGCSE Technical Symposium on Computer Science Education, 2007

1997

Fast Planning Through Planning Graph Analysis.

Avrim Blum, Merrick L. Furst

Artif. Intell., 1997

1994

The Expressive Power of Voting Polynomials.

James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich

Comb., 1994

Weakly learning DNF and characterizing statistical query learning using Fourier analysis.

Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, Michael J. Kearns, Yishay Mansour, Steven Rudich

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993

Design architectures and training of neural networks with a distributed genetic algorithm.

Shai Oliker, Merrick L. Furst, Oded Maimon

Proceedings of International Conference on Neural Networks (ICNN'88), San Francisco, CA, USA, March 28, 1993

Cryptographic Primitives Based on Hard Learning Problems.

Avrim Blum, Merrick L. Furst, Michael J. Kearns, Richard J. Lipton

Proceedings of the Advances in Cryptology, 1993

1992

A Distributed Genetic Algorithm for Neural Network Design and Training.

Shai Oliker, Merrick L. Furst, Oded Maimon

Complex Syst., 1992

Exploiting correlations among competing models with application to large vocabulary speech recognition.

Ronald Rosenfeld, Xuedong Huang, Merrick L. Furst

Proceedings of the 1992 IEEE International Conference on Acoustics, 1992

1991

PSPACE Survives Constant-Width Bottlenecks.

Jin-yi Cai, Merrick L. Furst

Int. J. Found. Comput. Sci., 1991

Improved Learning of AC⁰ Functions.

Merrick L. Furst, Jeffrey C. Jackson, Sean W. Smith

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1989

Succinct Certificates for Almost All Subset Sum Problems.

Merrick L. Furst, Ravi Kannan

SIAM J. Comput., 1989

Genus distributions for two classes of graphs.

Merrick L. Furst, Jonathan L. Gross, Richard Statman

J. Comb. Theory, Ser. B, 1989

1988

Finding a maximum-genus graph imbedding.

Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch

J. ACM, 1988

1987

Computing Short Generator Sequences

James R. Driscoll, Merrick L. Furst

Inf. Comput., February, 1987

Hierarchy for imbedding-distribution invariants of a graph.

Jonathan L. Gross, Merrick L. Furst

J. Graph Theory, 1987

PSPACE survives three-bit bottlenecks.

Jin-Yi Cai, Merrick L. Furst

Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1985

Pseudorandom Number Generation and Space Complexity

Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer

Inf. Control., 1985

1984

Parity, Circuits, and the Polynomial-Time Hierarchy.

Merrick L. Furst, James B. Saxe, Michael Sipser

Math. Syst. Theory, 1984

1983

On the Diameter of Permutation Groups

James R. Driscoll, Merrick L. Furst

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Multi-Party Protocols

Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1981

A Subexponential Algorithm for Trivalent Graph Isomorphism.

Merrick L. Furst

PhD thesis, 1981

1980

Polynomial-Time Algorithms for Permutation Groups

Merrick L. Furst, John E. Hopcroft, Eugene M. Luks

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980