Merrick L. Furst

2008
21	EE	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: 268-272
2007
20	EE	Merrick L. Furst, Charles L. Isbell, Mark Guzdial: ThreadsTM: how to restructure a computer science curriculum for a flat world. SIGCSE 2007: 420-424
1997
19	EE	Avrim Blum, Merrick L. Furst: Fast Planning Through Planning Graph Analysis. Artif. Intell. 90(1-2): 281-300 (1997)
1995
18		Avrim Blum, Merrick L. Furst: Fast Planning Through Planning Graph Analysis. IJCAI 1995: 1636-1642
1994
17	EE	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: 253-262
16		James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich: The Expressive Power of Voting Polynomials. Combinatorica 14(2): 135-148 (1994)
1993
15	EE	Avrim Blum, Merrick L. Furst, Michael J. Kearns, Richard J. Lipton: Cryptographic Primitives Based on Hard Learning Problems. CRYPTO 1993: 278-291
1991
14	EE	Merrick L. Furst, Jeffrey C. Jackson, Sean W. Smith: Improved Learning of AC0 Functions. COLT 1991: 317-325
13		James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich: The Expressive Power of Voting Polynomials STOC 1991: 402-409
12		Jin-yi Cai, Merrick L. Furst: PSPACE Survives Constant-Width Bottlenecks. Int. J. Found. Comput. Sci. 2(1): 67-76 (1991)
1989
11	EE	Merrick L. Furst, Jonathan L. Gross, Richard Statman: Genus distributions for two classes of graphs. J. Comb. Theory, Ser. B 46(1): 22-36 (1989)
10		Merrick L. Furst, Ravi Kannan: Succinct Certificates for Almost All Subset Sum Problems. SIAM J. Comput. 18(3): 550-558 (1989)
1988
9	EE	Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch: Finding a maximum-genus graph imbedding. J. ACM 35(3): 523-534 (1988)
1987
8		James R. Driscoll, Merrick L. Furst: Computing Short Generator Sequences Inf. Comput. 72(2): 117-132 (1987)
1985
7		Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer: Pseudorandom Number Generation and Space Complexity Information and Control 64(1-3): 43-51 (1985)
1984
6		Merrick L. Furst, James B. Saxe, Michael Sipser: Parity, Circuits, and the Polynomial-Time Hierarchy. Mathematical Systems Theory 17(1): 13-27 (1984)
1983
5		Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer: Pseudorandom Number Generation and Space Complexity. FCT 1983: 171-176
4		James R. Driscoll, Merrick L. Furst: On the Diameter of Permutation Groups STOC 1983: 152-160
3		Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton: Multi-Party Protocols STOC 1983: 94-99
1981
2		Merrick L. Furst, James B. Saxe, Michael Sipser: Parity, Circuits, and the Polynomial-Time Hierarchy FOCS 1981: 260-270
1980
1		Merrick L. Furst, John E. Hopcroft, Eugene M. Luks: Polynomial-Time Algorithms for Permutation Groups FOCS 1980: 36-41

Coauthor Index

1	James Aspnes	[13] [16]
2	Richard Beigel	[13] [16]
3	Avrim Blum	[15] [17] [18] [19]
4	Ian Bogost	[21]
5	Jin-yi Cai	[12]
6	Ashok K. Chandra	[3]
7	James R. Driscoll	[4] [8]
8	Jonathan L. Gross	[9] [11]
9	Mark Guzdial	[20]
10	John E. Hopcroft	[1]
11	Charles Lee Isbell Jr. (Charles L. Isbell)	[20] [21]
12	Jeffrey C. Jackson	[14] [17]
13	Ravi Kannan (Ravindran Kannan)	[10]
14	Michael J. Kearns	[15] [17]
15	Richard J. Lipton	[3] [5] [7] [15]
16	Eugene M. Luks	[1]
17	Yishay Mansour	[17]
18	Lyle A. McGeoch	[9]
19	Mark O. Riedl	[21]
20	David L. Roberts	[21]
21	Steven Rudich	[13] [16] [17]
22	James B. Saxe	[2] [6]
23	Michael Sipser	[2] [6]
24	Sean W. Smith	[14]
25	Richard Statman	[11]
26	Larry J. Stockmeyer	[5] [7]

Colors in the list of coauthors