Merrick L. Furst

28 papers A* 9A 1B 1C 1Misc 1Journal 11Unranked 3

Year	Rank	Type	Title / Venue / Authors
2009	—	`conf`	Using influence and persuasion to shape player experiences. Sandbox@SIGGRAPH David L. Roberts, Merrick L. Furst, Brian Dorn, Charles L. Isbell Jr.
2008	C	`conf`	On the Use of Computational Models of Influence for Managing Interactive Virtual Experiences. ICIDS David L. Roberts, Charles Lee Isbell Jr., Mark O. Riedl, Ian Bogost, Merrick L. Furst
2007	A	`conf`	Threads SIGCSE Merrick L. Furst, Charles L. Isbell Jr., Mark Guzdial
1997	J	`jnl`	Fast Planning Through Planning Graph Analysis. Artif. Intell. Avrim Blum, Merrick L. Furst
1995	A*	`conf`	Fast Planning Through Planning Graph Analysis. IJCAI Avrim Blum, Merrick L. Furst
1994	J	`jnl`	The Expressive Power of Voting Polynomials. Comb. James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
1994	A*	`conf`	Weakly learning DNF and characterizing statistical query learning using Fourier analysis. STOC Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, Michael J. Kearns, Yishay Mansour, Steven Rudich
1993	A*	`conf`	Cryptographic Primitives Based on Hard Learning Problems. CRYPTO Avrim Blum, Merrick L. Furst, Michael J. Kearns, Richard J. Lipton
1993	—	`conf`	Design architectures and training of neural networks with a distributed genetic algorithm. ICNN Shai Oliker, Merrick L. Furst, Oded Maimon
1992	J	`jnl`	A Distributed Genetic Algorithm for Neural Network Design and Training. Complex Syst. Shai Oliker, Merrick L. Furst, Oded Maimon
1992	Misc	`conf`	Exploiting correlations among competing models with application to large vocabulary speech recognition. ICASSP Ronald Rosenfeld, Xuedong Huang, Merrick L. Furst
1991	A*	`conf`	Improved Learning of AC COLT Merrick L. Furst, Jeffrey C. Jackson, Sean W. Smith
1991	J	`jnl`	PSPACE Survives Constant-Width Bottlenecks. Int. J. Found. Comput. Sci. Jin-Yi Cai, Merrick L. Furst
1991	A*	`conf`	The Expressive Power of Voting Polynomials STOC James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich
1989	J	`jnl`	Genus distributions for two classes of graphs. J. Comb. Theory B Merrick L. Furst, Jonathan L. Gross, Richard Statman
1989	J	`jnl`	Succinct Certificates for Almost All Subset Sum Problems. SIAM J. Comput. Merrick L. Furst, Ravi Kannan
1988	J	`jnl`	Finding a maximum-genus graph imbedding. J. ACM Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch
1987	J	`jnl`	Computing Short Generator Sequences Inf. Comput. James R. Driscoll, Merrick L. Furst
1987	J	`jnl`	Hierarchy for imbedding-distribution invariants of a graph. J. Graph Theory Jonathan L. Gross, Merrick L. Furst
1987	—	`conf`	PSPACE survives three-bit bottlenecks. SCT Jin-Yi Cai, Merrick L. Furst
1985	J	`jnl`	Pseudorandom Number Generation and Space Complexity Inf. Control. Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
1984	J	`jnl`	Parity, Circuits, and the Polynomial-Time Hierarchy. Math. Syst. Theory Merrick L. Furst, James B. Saxe, Michael Sipser
1983	A*	`conf`	Multi-Party Protocols STOC Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton
1983	A*	`conf`	On the Diameter of Permutation Groups STOC James R. Driscoll, Merrick L. Furst
1983	B	`conf`	Pseudorandom Number Generation and Space Complexity. FCT Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
1981	—	`—`	A Subexponential Algorithm for Trivalent Graph Isomorphism. Merrick L. Furst
1981	A*	`conf`	Parity, Circuits, and the Polynomial-Time Hierarchy FOCS Merrick L. Furst, James B. Saxe, Michael Sipser
1980	A*	`conf`	Polynomial-Time Algorithms for Permutation Groups FOCS Merrick L. Furst, John E. Hopcroft, Eugene M. Luks