BibTeX records: Merrick L. Furst

download as .bib file

@inproceedings{DBLP:conf/siggraph/0001FDI09,
  author       = {David L. Roberts and
                  Merrick L. Furst and
                  Brian Dorn and
                  Charles L. Isbell Jr.},
  title        = {Using influence and persuasion to shape player experiences},
  booktitle    = {Sandbox@SIGGRAPH},
  pages        = {23--30},
  publisher    = {{ACM}},
  year         = {2009}
}

@inproceedings{DBLP:conf/icids/RobertsIRBF08,
  author       = {David L. Roberts and
                  Charles Lee Isbell Jr. and
                  Mark O. Riedl and
                  Ian Bogost and
                  Merrick L. Furst},
  title        = {On the Use of Computational Models of Influence for Managing Interactive
                  Virtual Experiences},
  booktitle    = {{ICIDS}},
  series       = {Lecture Notes in Computer Science},
  volume       = {5334},
  pages        = {268--272},
  publisher    = {Springer},
  year         = {2008}
}

@inproceedings{DBLP:conf/sigcse/FurstIG07,
  author       = {Merrick L. Furst and
                  Charles L. Isbell Jr. and
                  Mark Guzdial},
  title        = {Threads\({}^{\mbox{TM}}\): how to restructure a computer science curriculum
                  for a flat world},
  booktitle    = {{SIGCSE}},
  pages        = {420--424},
  publisher    = {{ACM}},
  year         = {2007}
}

@article{DBLP:journals/ai/BlumF97,
  author       = {Avrim Blum and
                  Merrick L. Furst},
  title        = {Fast Planning Through Planning Graph Analysis},
  journal      = {Artif. Intell.},
  volume       = {90},
  number       = {1-2},
  pages        = {281--300},
  year         = {1997}
}

@inproceedings{DBLP:conf/ijcai/BlumF95,
  author       = {Avrim Blum and
                  Merrick L. Furst},
  title        = {Fast Planning Through Planning Graph Analysis},
  booktitle    = {{IJCAI}},
  pages        = {1636--1642},
  publisher    = {Morgan Kaufmann},
  year         = {1995}
}

@article{DBLP:journals/combinatorica/AspnesBFR94,
  author       = {James Aspnes and
                  Richard Beigel and
                  Merrick L. Furst and
                  Steven Rudich},
  title        = {The Expressive Power of Voting Polynomials},
  journal      = {Comb.},
  volume       = {14},
  number       = {2},
  pages        = {135--148},
  year         = {1994}
}

@inproceedings{DBLP:conf/stoc/BlumFJKMR94,
  author       = {Avrim Blum and
                  Merrick L. Furst and
                  Jeffrey C. Jackson and
                  Michael J. Kearns and
                  Yishay Mansour and
                  Steven Rudich},
  title        = {Weakly learning {DNF} and characterizing statistical query learning
                  using Fourier analysis},
  booktitle    = {{STOC}},
  pages        = {253--262},
  publisher    = {{ACM}},
  year         = {1994}
}

@inproceedings{DBLP:conf/crypto/BlumFKL93,
  author       = {Avrim Blum and
                  Merrick L. Furst and
                  Michael J. Kearns and
                  Richard J. Lipton},
  title        = {Cryptographic Primitives Based on Hard Learning Problems},
  booktitle    = {{CRYPTO}},
  series       = {Lecture Notes in Computer Science},
  volume       = {773},
  pages        = {278--291},
  publisher    = {Springer},
  year         = {1993}
}

@inproceedings{DBLP:conf/icnn/OlikerFM93,
  author       = {Shai Oliker and
                  Merrick L. Furst and
                  Oded Maimon},
  title        = {Design architectures and training of neural networks with a distributed
                  genetic algorithm},
  booktitle    = {{ICNN}},
  pages        = {199--202},
  publisher    = {{IEEE}},
  year         = {1993}
}

@article{DBLP:journals/compsys/OlikerFM92,
  author       = {Shai Oliker and
                  Merrick L. Furst and
                  Oded Maimon},
  title        = {A Distributed Genetic Algorithm for Neural Network Design and Training},
  journal      = {Complex Syst.},
  volume       = {6},
  number       = {5},
  year         = {1992}
}

@inproceedings{DBLP:conf/icassp/RosenfeldHF92,
  author       = {Ronald Rosenfeld and
                  Xuedong Huang and
                  Merrick L. Furst},
  title        = {Exploiting correlations among competing models with application to
                  large vocabulary speech recognition},
  booktitle    = {{ICASSP}},
  pages        = {5--8},
  publisher    = {{IEEE} Computer Society},
  year         = {1992}
}

@article{DBLP:journals/ijfcs/CaiF91,
  author       = {Jin{-}yi Cai and
                  Merrick L. Furst},
  title        = {{PSPACE} Survives Constant-Width Bottlenecks},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {2},
  number       = {1},
  pages        = {67--76},
  year         = {1991}
}

@inproceedings{DBLP:conf/colt/FurstJS91,
  author       = {Merrick L. Furst and
                  Jeffrey C. Jackson and
                  Sean W. Smith},
  title        = {Improved Learning of AC\({}^{\mbox{0}}\) Functions},
  booktitle    = {{COLT}},
  pages        = {317--325},
  publisher    = {Morgan Kaufmann},
  year         = {1991}
}

@inproceedings{DBLP:conf/stoc/AspnesBFR91,
  author       = {James Aspnes and
                  Richard Beigel and
                  Merrick L. Furst and
                  Steven Rudich},
  title        = {The Expressive Power of Voting Polynomials},
  booktitle    = {{STOC}},
  pages        = {402--409},
  publisher    = {{ACM}},
  year         = {1991}
}

@article{DBLP:journals/jct/FurstGS89,
  author       = {Merrick L. Furst and
                  Jonathan L. Gross and
                  Richard Statman},
  title        = {Genus distributions for two classes of graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {46},
  number       = {1},
  pages        = {22--36},
  year         = {1989}
}

@article{DBLP:journals/siamcomp/FurstK89,
  author       = {Merrick L. Furst and
                  Ravi Kannan},
  title        = {Succinct Certificates for Almost All Subset Sum Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {18},
  number       = {3},
  pages        = {550--558},
  year         = {1989}
}

@article{DBLP:journals/jacm/FurstGM88,
  author       = {Merrick L. Furst and
                  Jonathan L. Gross and
                  Lyle A. McGeoch},
  title        = {Finding a maximum-genus graph imbedding},
  journal      = {J. {ACM}},
  volume       = {35},
  number       = {3},
  pages        = {523--534},
  year         = {1988}
}

@article{DBLP:journals/iandc/DriscollF87,
  author       = {James R. Driscoll and
                  Merrick L. Furst},
  title        = {Computing Short Generator Sequences},
  journal      = {Inf. Comput.},
  volume       = {72},
  number       = {2},
  pages        = {117--132},
  year         = {1987}
}

@article{DBLP:journals/jgt/GrossF87,
  author       = {Jonathan L. Gross and
                  Merrick L. Furst},
  title        = {Hierarchy for imbedding-distribution invariants of a graph},
  journal      = {J. Graph Theory},
  volume       = {11},
  number       = {2},
  pages        = {205--220},
  year         = {1987}
}

@inproceedings{DBLP:conf/coco/CaiF87,
  author       = {Jin{-}Yi Cai and
                  Merrick L. Furst},
  title        = {{PSPACE} survives three-bit bottlenecks},
  booktitle    = {{SCT}},
  pages        = {94--102},
  publisher    = {{IEEE} Computer Society},
  year         = {1987}
}

@article{DBLP:journals/iandc/FurstLS85,
  author       = {Merrick L. Furst and
                  Richard J. Lipton and
                  Larry J. Stockmeyer},
  title        = {Pseudorandom Number Generation and Space Complexity},
  journal      = {Inf. Control.},
  volume       = {64},
  number       = {1-3},
  pages        = {43--51},
  year         = {1985}
}

@article{DBLP:journals/mst/FurstSS84,
  author       = {Merrick L. Furst and
                  James B. Saxe and
                  Michael Sipser},
  title        = {Parity, Circuits, and the Polynomial-Time Hierarchy},
  journal      = {Math. Syst. Theory},
  volume       = {17},
  number       = {1},
  pages        = {13--27},
  year         = {1984}
}

@inproceedings{DBLP:conf/fct/FurstLS83,
  author       = {Merrick L. Furst and
                  Richard J. Lipton and
                  Larry J. Stockmeyer},
  title        = {Pseudorandom Number Generation and Space Complexity},
  booktitle    = {{FCT}},
  series       = {Lecture Notes in Computer Science},
  volume       = {158},
  pages        = {171--176},
  publisher    = {Springer},
  year         = {1983}
}

@inproceedings{DBLP:conf/stoc/ChandraFL83b,
  author       = {Ashok K. Chandra and
                  Merrick L. Furst and
                  Richard J. Lipton},
  title        = {Multi-Party Protocols},
  booktitle    = {{STOC}},
  pages        = {94--99},
  publisher    = {{ACM}},
  year         = {1983}
}

@inproceedings{DBLP:conf/stoc/DriscollF83,
  author       = {James R. Driscoll and
                  Merrick L. Furst},
  title        = {On the Diameter of Permutation Groups},
  booktitle    = {{STOC}},
  pages        = {152--160},
  publisher    = {{ACM}},
  year         = {1983}
}

@phdthesis{DBLP:phd/us/Furst81,
  author       = {Merrick L. Furst},
  title        = {A Subexponential Algorithm for Trivalent Graph Isomorphism},
  school       = {Cornell University, {USA}},
  year         = {1981}
}

@inproceedings{DBLP:conf/focs/FurstSS81,
  author       = {Merrick L. Furst and
                  James B. Saxe and
                  Michael Sipser},
  title        = {Parity, Circuits, and the Polynomial-Time Hierarchy},
  booktitle    = {{FOCS}},
  pages        = {260--270},
  publisher    = {{IEEE} Computer Society},
  year         = {1981}
}

@inproceedings{DBLP:conf/focs/FurstHL80,
  author       = {Merrick L. Furst and
                  John E. Hopcroft and
                  Eugene M. Luks},
  title        = {Polynomial-Time Algorithms for Permutation Groups},
  booktitle    = {{FOCS}},
  pages        = {36--41},
  publisher    = {{IEEE} Computer Society},
  year         = {1980}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.