default search action
Merrick L. Furst
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [c16]David L. Roberts, Merrick L. Furst, Brian Dorn, Charles L. Isbell Jr.:
Using influence and persuasion to shape player experiences. Sandbox@SIGGRAPH 2009: 23-30 - 2008
- [c15]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
- [c14]Merrick L. Furst, Charles L. Isbell Jr., Mark Guzdial
:
ThreadsTM: how to restructure a computer science curriculum for a flat world. SIGCSE 2007: 420-424
1990 – 1999
- 1997
- [j11]Avrim Blum, Merrick L. Furst:
Fast Planning Through Planning Graph Analysis. Artif. Intell. 90(1-2): 281-300 (1997) - 1995
- [c13]Avrim Blum, Merrick L. Furst:
Fast Planning Through Planning Graph Analysis. IJCAI 1995: 1636-1642 - 1994
- [j10]James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich:
The Expressive Power of Voting Polynomials. Comb. 14(2): 135-148 (1994) - [c12]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 - 1993
- [c11]Avrim Blum, Merrick L. Furst, Michael J. Kearns, Richard J. Lipton:
Cryptographic Primitives Based on Hard Learning Problems. CRYPTO 1993: 278-291 - [c10]Shai Oliker, Merrick L. Furst, Oded Maimon:
Design architectures and training of neural networks with a distributed genetic algorithm. ICNN 1993: 199-202 - 1992
- [j9]Shai Oliker, Merrick L. Furst, Oded Maimon:
A Distributed Genetic Algorithm for Neural Network Design and Training. Complex Syst. 6(5) (1992) - [c9]Ronald Rosenfeld
Exploiting correlations among competing models with application to large vocabulary speech recognition. ICASSP 1992: 5-8 - 1991
- [j8]Jin-yi Cai, Merrick L. Furst:
PSPACE Survives Constant-Width Bottlenecks. Int. J. Found. Comput. Sci. 2(1): 67-76 (1991) - [c8]Merrick L. Furst, Jeffrey C. Jackson, Sean W. Smith:
Improved Learning of AC0 Functions. COLT 1991: 317-325 - [c7]James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich:
The Expressive Power of Voting Polynomials. STOC 1991: 402-409
1980 – 1989
- 1989
- [j7]Merrick L. Furst, Jonathan L. Gross, Richard Statman:
Genus distributions for two classes of graphs. J. Comb. Theory B 46(1): 22-36 (1989) - [j6]Merrick L. Furst, Ravi Kannan:
Succinct Certificates for Almost All Subset Sum Problems. SIAM J. Comput. 18(3): 550-558 (1989) - 1988
- [j5]Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch:
Finding a maximum-genus graph imbedding. J. ACM 35(3): 523-534 (1988) - 1987
- [j4]James R. Driscoll, Merrick L. Furst:
Computing Short Generator Sequences. Inf. Comput. 72(2): 117-132 (1987) - [j3]Jonathan L. Gross, Merrick L. Furst:
Hierarchy for imbedding-distribution invariants of a graph. J. Graph Theory 11(2): 205-220 (1987) - [c6]Jin-Yi Cai, Merrick L. Furst:
PSPACE survives three-bit bottlenecks. SCT 1987: 94-102 - 1985
- [j2]Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer:
Pseudorandom Number Generation and Space Complexity. Inf. Control. 64(1-3): 43-51 (1985) - 1984
- [j1]Merrick L. Furst, James B. Saxe, Michael Sipser:
Parity, Circuits, and the Polynomial-Time Hierarchy. Math. Syst. Theory 17(1): 13-27 (1984) - 1983
- [c5]Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer:
Pseudorandom Number Generation and Space Complexity. FCT 1983: 171-176 - [c4]Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton:
Multi-Party Protocols. STOC 1983: 94-99 - [c3]James R. Driscoll, Merrick L. Furst:
On the Diameter of Permutation Groups. STOC 1983: 152-160 - 1981
- [b1]Merrick L. Furst:
A Subexponential Algorithm for Trivalent Graph Isomorphism. Cornell University, USA, 1981 - [c2]Merrick L. Furst, James B. Saxe, Michael Sipser:
Parity, Circuits, and the Polynomial-Time Hierarchy. FOCS 1981: 260-270 - 1980
- [c1]Merrick L. Furst, John E. Hopcroft, Eugene M. Luks:
Polynomial-Time Algorithms for Permutation Groups. FOCS 1980: 36-41
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: