Merrick L. Furst

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

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
Using influence and persuasion to shape player experiences.
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.
Proceedings of the Interactive Storytelling, 2008

2007
Threads<sup>TM</sup>: how to restructure a computer science curriculum for a flat world.
Proceedings of the 38th SIGCSE Technical Symposium on Computer Science Education, 2007

1997
Fast Planning Through Planning Graph Analysis.
Artif. Intell., 1997

1994
The Expressive Power of Voting Polynomials.
Comb., 1994

Weakly learning DNF and characterizing statistical query learning using Fourier analysis.
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.
Proceedings of International Conference on Neural Networks (ICNN'88), San Francisco, CA, USA, March 28, 1993

Cryptographic Primitives Based on Hard Learning Problems.
Proceedings of the Advances in Cryptology, 1993

1992
A Distributed Genetic Algorithm for Neural Network Design and Training.
Complex Syst., 1992

Exploiting correlations among competing models with application to large vocabulary speech recognition.
Proceedings of the 1992 IEEE International Conference on Acoustics, 1992

1991
PSPACE Survives Constant-Width Bottlenecks.
Int. J. Found. Comput. Sci., 1991

Improved Learning of AC<sup>0</sup> Functions.
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1989
Succinct Certificates for Almost All Subset Sum Problems.
SIAM J. Comput., 1989

Genus distributions for two classes of graphs.
J. Comb. Theory, Ser. B, 1989

1988
Finding a maximum-genus graph imbedding.
J. ACM, 1988

1987
Computing Short Generator Sequences
Inf. Comput., February, 1987

Hierarchy for imbedding-distribution invariants of a graph.
J. Graph Theory, 1987

PSPACE survives three-bit bottlenecks.
Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1985
Pseudorandom Number Generation and Space Complexity
Inf. Control., 1985

1984
Parity, Circuits, and the Polynomial-Time Hierarchy.
Math. Syst. Theory, 1984

1983
On the Diameter of Permutation Groups
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Multi-Party Protocols
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1981
A Subexponential Algorithm for Trivalent Graph Isomorphism.
PhD thesis, 1981

1980
Polynomial-Time Algorithms for Permutation Groups
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980


  Loading...