Follow
merrick furst
merrick furst
Distinguished Professor, Georgia Tech
Verified email at cc.gatech.edu
Title
Cited by
Cited by
Year
Fast planning through planning graph analysis
AL Blum, ML Furst
Artificial intelligence 90 (1-2), 281-300, 1997
30561997
Parity, circuits, and the polynomial-time hierarchy
M Furst, JB Saxe, M Sipser
Mathematical systems theory 17 (1), 13-27, 1984
15011984
Parallel web sites
ML Furst
US Patent 6,297,819, 2001
4452001
Cryptographic primitives based on hard learning problems
A Blum, M Furst, M Kearns, RJ Lipton
Annual International Cryptology Conference, 278-291, 1993
4351993
Polynomial-time algorithms for permutation groups
M Furst, J Hopcroft, E Luks
21st Annual Symposium on Foundations of Computer Science (sfcs 1980), 36-41, 1980
3981980
Multi-party protocols
AK Chandra, ML Furst, RJ Lipton
Proceedings of the fifteenth annual ACM symposium on Theory of computing, 94-99, 1983
3611983
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
A Blum, M Furst, J Jackson, M Kearns, Y Mansour, S Rudich
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
3551994
The expressive power of voting polynomials
J Aspnes, R Beigel, M Furst, S Rudich
Proceedings of the twenty-third annual ACM symposium on Theory of Computing …, 1991
2731991
Hierarchy for imbedding‐distribution invariants of a graph
JL Gross, ML Furst
Journal of graph theory 11 (2), 205-220, 1987
1531987
Genus distributions for two classes of graphs
ML Furst, JL Gross, R Statman
Journal of Combinatorial Theory, Series B 46 (1), 22-36, 1989
1281989
Finding a maximum-genus graph imbedding
ML Furst, JL Gross, LA McGeoch
Journal of the ACM (JACM) 35 (3), 523-534, 1988
1141988
Improved learning of AC 0 functions
ML Furst, JC Jackson, SW Smith
COLT 91, 317-325, 1991
961991
PSPACE survives constant-width bottlenecks
JY Cai, M Furst
International Journal of Foundations of Computer Science 2 (01), 67-76, 1991
641991
Threads™: How to restructure a computer science curriculum for a flat world
M Furst, C Isbell, M Guzdial
Proceedings of the 38th SIGCSE technical symposium on Computer science …, 2007
592007
Succinct certificates for almost all subset sum problems
ML Furst, R Kannan
SIAM Journal on Computing 18 (3), 550-558, 1989
381989
A subexponential algorithm for trivalent graph isomorphism
M Furst, JE Hopcroft, E Luks
Cornell University, 1980
321980
Computing short generator sequences
JR Driscoll, ML Furst
Information and Computation 72 (2), 117-132, 1987
241987
A linear time algorithm for the generalized consecutive retrieval problem
PF Dietz, M Furst, JE Hopcroft
Cornell University, 1979
241979
On the diameter of permutation groups
JR Driscoll, ML Furst
Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983
221983
Using influence and persuasion to shape player experiences
DL Roberts, ML Furst, B Dorn, CL Isbell
Proceedings of the 2009 ACM SIGGRAPH Symposium on Video Games, 23-30, 2009
192009
The system can't perform the operation now. Try again later.
Articles 1–20