Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Larry J. Stockmeyer
@inproceedings{DBLP:conf/latin/AjtaiDS06, author = {Mikl{\'{o}}s Ajtai and Cynthia Dwork and Larry J. Stockmeyer}, editor = {Jos{\'{e}} R. Correa and Alejandro Hevia and Marcos A. Kiwi}, title = {An Architecture for Provably Secure Computation}, booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3887}, pages = {56--67}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11682462\_10}, doi = {10.1007/11682462\_10}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/latin/AjtaiDS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tc/HoS04, author = {Ching{-}Tien Ho and Larry J. Stockmeyer}, title = {A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers}, journal = {{IEEE} Trans. Computers}, volume = {53}, number = {4}, pages = {427--439}, year = {2004}, url = {https://doi.org/10.1109/TC.2004.1268400}, doi = {10.1109/TC.2004.1268400}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tc/HoS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/DworkNRS03, author = {Cynthia Dwork and Moni Naor and Omer Reingold and Larry J. Stockmeyer}, title = {Magic Functions}, journal = {J. {ACM}}, volume = {50}, number = {6}, pages = {852--921}, year = {2003}, url = {https://doi.org/10.1145/950620.950623}, doi = {10.1145/950620.950623}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/DworkNRS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tkde/BurnsSL03, author = {Randal C. Burns and Larry J. Stockmeyer and Darrell D. E. Long}, title = {In-Place Reconstruction of Version Differences}, journal = {{IEEE} Trans. Knowl. Data Eng.}, volume = {15}, number = {4}, pages = {973--984}, year = {2003}, url = {https://doi.org/10.1109/TKDE.2003.1209013}, doi = {10.1109/TKDE.2003.1209013}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tkde/BurnsSL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/AjtaiBFLS02, author = {Mikl{\'{o}}s Ajtai and Randal C. Burns and Ronald Fagin and Darrell D. E. Long and Larry J. Stockmeyer}, title = {Compactly encoding unstructured inputs with differential compression}, journal = {J. {ACM}}, volume = {49}, number = {3}, pages = {318--367}, year = {2002}, url = {https://doi.org/10.1145/567112.567116}, doi = {10.1145/567112.567116}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/AjtaiBFLS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/StockmeyerM02, author = {Larry J. Stockmeyer and Albert R. Meyer}, title = {Cosmological lower bound on the circuit complexity of a small problem in logic}, journal = {J. {ACM}}, volume = {49}, number = {6}, pages = {753--784}, year = {2002}, url = {https://doi.org/10.1145/602220.602223}, doi = {10.1145/602220.602223}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/StockmeyerM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/StockmeyerM02, author = {Larry J. Stockmeyer and Dharmendra S. Modha}, title = {Links between complexity theory and constrained block coding}, journal = {{IEEE} Trans. Inf. Theory}, volume = {48}, number = {1}, pages = {59--88}, year = {2002}, url = {https://doi.org/10.1109/18.971739}, doi = {10.1109/18.971739}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/StockmeyerM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipps/HoS02, author = {Ching{-}Tien Ho and Larry J. Stockmeyer}, title = {A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers}, booktitle = {16th International Parallel and Distributed Processing Symposium {(IPDPS} 2002), 15-19 April 2002, Fort Lauderdale, FL, USA, CD-ROM/Abstracts Proceedings}, publisher = {{IEEE} Computer Society}, year = {2002}, url = {https://doi.org/10.1109/IPDPS.2002.1015530}, doi = {10.1109/IPDPS.2002.1015530}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipps/HoS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DworkS02, author = {Cynthia Dwork and Larry J. Stockmeyer}, editor = {John H. Reif}, title = {2-round zero knowledge and proof auditors}, booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing, May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada}, pages = {322--331}, publisher = {{ACM}}, year = {2002}, url = {https://doi.org/10.1145/509907.509958}, doi = {10.1145/509907.509958}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DworkS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cluster/BurnsRSL01, author = {Randal C. Burns and Robert M. Rees and Larry J. Stockmeyer and Darrell D. E. Long}, title = {Scalable Session Locking for a Distributed File System}, journal = {Clust. Comput.}, volume = {4}, number = {4}, pages = {295--306}, year = {2001}, url = {https://doi.org/10.1023/A:1011860527389}, doi = {10.1023/A:1011860527389}, timestamp = {Tue, 29 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cluster/BurnsRSL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/StockmeyerM01, author = {Larry J. Stockmeyer and Dharmendra S. Modha}, title = {Links Between Complexity Theory and Constrained Block Coding}, booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001}, pages = {226--243}, publisher = {{IEEE} Computer Society}, year = {2001}, url = {https://doi.org/10.1109/CCC.2001.933890}, doi = {10.1109/CCC.2001.933890}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/StockmeyerM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/AjtaiFS00, author = {Mikl{\'{o}}s Ajtai and Ronald Fagin and Larry J. Stockmeyer}, title = {The Closure of Monadic {NP}}, journal = {J. Comput. Syst. Sci.}, volume = {60}, number = {3}, pages = {660--716}, year = {2000}, url = {https://doi.org/10.1006/jcss.1999.1691}, doi = {10.1006/JCSS.1999.1691}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/AjtaiFS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DworkNRS99, author = {Cynthia Dwork and Moni Naor and Omer Reingold and Larry J. Stockmeyer}, title = {Magic Functions}, booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99, 17-18 October, 1999, New York, NY, {USA}}, pages = {523--534}, publisher = {{IEEE} Computer Society}, year = {1999}, url = {https://doi.org/10.1109/SFFCS.1999.814626}, doi = {10.1109/SFFCS.1999.814626}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DworkNRS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijcv/FaginS98, author = {Ronald Fagin and Larry J. Stockmeyer}, title = {Relaxing the Triangle Inequality in Pattern Matching}, journal = {Int. J. Comput. Vis.}, volume = {30}, number = {3}, pages = {219--231}, year = {1998}, url = {https://doi.org/10.1023/A:1008023416823}, doi = {10.1023/A:1008023416823}, timestamp = {Fri, 13 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ijcv/FaginS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isca/AlvarezBSC98, author = {Guillermo A. Alvarez and Walter A. Burkhard and Larry J. Stockmeyer and Flaviu Cristian}, editor = {Mateo Valero and Gurindar S. Sohi and Doug DeGroot}, title = {Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism}, booktitle = {Proceedings of the 25th Annual International Symposium on Computer Architecture, {ISCA} 1998, Barcelona, Spain, June 27 - July 1, 1998}, pages = {109--120}, publisher = {{IEEE} Computer Society}, year = {1998}, url = {https://doi.org/10.1109/ISCA.1998.694767}, doi = {10.1109/ISCA.1998.694767}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isca/AlvarezBSC98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AjtaiFS98, author = {Mikl{\'{o}}s Ajtai and Ronald Fagin and Larry J. Stockmeyer}, editor = {Jeffrey Scott Vitter}, title = {The Closure of Monadic {NP} (Extended Abstract)}, booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998}, pages = {309--318}, publisher = {{ACM}}, year = {1998}, url = {https://doi.org/10.1145/276698.276771}, doi = {10.1145/276698.276771}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AjtaiFS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ChoyFS96, author = {David M. Choy and Ronald Fagin and Larry J. Stockmeyer}, title = {Efficiently Extendible Mappings for Balanced Data Distribution}, journal = {Algorithmica}, volume = {16}, number = {2}, pages = {215--232}, year = {1996}, url = {https://doi.org/10.1007/BF01940647}, doi = {10.1007/BF01940647}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ChoyFS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MayerS96, author = {Alain J. Mayer and Larry J. Stockmeyer}, title = {The Complexity of {PDL} with Interleaving}, journal = {Theor. Comput. Sci.}, volume = {161}, number = {1{\&}2}, pages = {109--122}, year = {1996}, url = {https://doi.org/10.1016/0304-3975(95)00095-X}, doi = {10.1016/0304-3975(95)00095-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MayerS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/FaginSV95, author = {Ronald Fagin and Larry J. Stockmeyer and Moshe Y. Vardi}, title = {On Monadic {NP} vs. Monadic co-NP}, journal = {Inf. Comput.}, volume = {120}, number = {1}, pages = {78--92}, year = {1995}, url = {https://doi.org/10.1006/inco.1995.1100}, doi = {10.1006/INCO.1995.1100}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/FaginSV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/NaorS95, author = {Moni Naor and Larry J. Stockmeyer}, title = {What Can be Computed Locally?}, journal = {{SIAM} J. Comput.}, volume = {24}, number = {6}, pages = {1259--1277}, year = {1995}, url = {https://doi.org/10.1137/S0097539793254571}, doi = {10.1137/S0097539793254571}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/NaorS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/istcs/MayerNS95, author = {Alain J. Mayer and Moni Naor and Larry J. Stockmeyer}, title = {Local Computations on Static and Dynamic Graphs (Preliminary Version)}, booktitle = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS} 1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings}, pages = {268--278}, publisher = {{IEEE} Computer Society}, year = {1995}, url = {https://doi.org/10.1109/ISTCS.1995.377023}, doi = {10.1109/ISTCS.1995.377023}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/istcs/MayerNS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/MayerS94, author = {Alain J. Mayer and Larry J. Stockmeyer}, title = {The Complexity of Word Problems - This Time with Interleaving}, journal = {Inf. Comput.}, volume = {115}, number = {2}, pages = {293--311}, year = {1994}, url = {https://doi.org/10.1006/inco.1994.1098}, doi = {10.1006/INCO.1994.1098}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/MayerS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/AttiyaDLS94, author = {Hagit Attiya and Cynthia Dwork and Nancy A. Lynch and Larry J. Stockmeyer}, title = {Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty}, journal = {J. {ACM}}, volume = {41}, number = {1}, pages = {122--152}, year = {1994}, url = {https://doi.org/10.1145/174644.174649}, doi = {10.1145/174644.174649}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/AttiyaDLS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/AlonKRS94, author = {Noga Alon and Gil Kalai and Moty Ricklin and Larry J. Stockmeyer}, title = {Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling}, journal = {Theor. Comput. Sci.}, volume = {130}, number = {1}, pages = {175--201}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(94)90158-9}, doi = {10.1016/0304-3975(94)90158-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AlonKRS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/FaginSV93, author = {Ronald Fagin and Larry J. Stockmeyer and Moshe Y. Vardi}, title = {On Monadic {NP} vs. Monadic co-NP (Extended Abstract)}, booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993}, pages = {19--30}, publisher = {{IEEE} Computer Society}, year = {1993}, url = {https://doi.org/10.1109/SCT.1993.336544}, doi = {10.1109/SCT.1993.336544}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/FaginSV93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NaorS93, author = {Moni Naor and Larry J. Stockmeyer}, editor = {S. Rao Kosaraju and David S. Johnson and Alok Aggarwal}, title = {What can be computed locally?}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, {USA}}, pages = {184--193}, publisher = {{ACM}}, year = {1993}, url = {https://doi.org/10.1145/167088.167149}, doi = {10.1145/167088.167149}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/NaorS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/DworkS92, author = {Cynthia Dwork and Larry J. Stockmeyer}, title = {Finite State Verifiers {I:} The Power of Interaction}, journal = {J. {ACM}}, volume = {39}, number = {4}, pages = {800--828}, year = {1992}, url = {https://doi.org/10.1145/146585.146599}, doi = {10.1145/146585.146599}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/DworkS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/DworkS92a, author = {Cynthia Dwork and Larry J. Stockmeyer}, title = {Finite State Verifiers {II:} Zero Knowledge}, journal = {J. {ACM}}, volume = {39}, number = {4}, pages = {829--858}, year = {1992}, url = {https://doi.org/10.1145/146585.146601}, doi = {10.1145/146585.146601}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/DworkS92a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/AlonKRS92, author = {Noga Alon and Gil Kalai and Moty Ricklin and Larry J. Stockmeyer}, title = {Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract)}, booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992}, pages = {334--343}, publisher = {{IEEE} Computer Society}, year = {1992}, url = {https://doi.org/10.1109/SFCS.1992.267757}, doi = {10.1109/SFCS.1992.267757}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/AlonKRS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AttiyaDLS91, author = {Hagit Attiya and Cynthia Dwork and Nancy A. Lynch and Larry J. Stockmeyer}, editor = {Cris Koutsougeras and Jeffrey Scott Vitter}, title = {Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty}, booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, {USA}}, pages = {359--369}, publisher = {{ACM}}, year = {1991}, url = {https://doi.org/10.1145/103418.103457}, doi = {10.1145/103418.103457}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AttiyaDLS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DworkSS90, author = {Cynthia Dwork and David B. Shmoys and Larry J. Stockmeyer}, title = {Flipping Persuasively in Constant Time}, journal = {{SIAM} J. Comput.}, volume = {19}, number = {3}, pages = {472--499}, year = {1990}, url = {https://doi.org/10.1137/0219032}, doi = {10.1137/0219032}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DworkSS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DworkS90, author = {Cynthia Dwork and Larry J. Stockmeyer}, title = {A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata}, journal = {{SIAM} J. Comput.}, volume = {19}, number = {6}, pages = {1011--1023}, year = {1990}, url = {https://doi.org/10.1137/0219069}, doi = {10.1137/0219069}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DworkS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CoanDDS89, author = {Brian A. Coan and Danny Dolev and Cynthia Dwork and Larry J. Stockmeyer}, title = {The Distributed Firing Squad Problem}, journal = {{SIAM} J. Comput.}, volume = {18}, number = {5}, pages = {990--1012}, year = {1989}, url = {https://doi.org/10.1137/0218068}, doi = {10.1137/0218068}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/CoanDDS89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DworkS89, author = {Cynthia Dwork and Larry J. Stockmeyer}, title = {On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract)}, booktitle = {30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989}, pages = {480--485}, publisher = {{IEEE} Computer Society}, year = {1989}, url = {https://doi.org/10.1109/SFCS.1989.63522}, doi = {10.1109/SFCS.1989.63522}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DworkS89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/DworkLS88, author = {Cynthia Dwork and Nancy A. Lynch and Larry J. Stockmeyer}, title = {Consensus in the presence of partial synchrony}, journal = {J. {ACM}}, volume = {35}, number = {2}, pages = {288--323}, year = {1988}, url = {https://doi.org/10.1145/42282.42283}, doi = {10.1145/42282.42283}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/DworkLS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DworkKS88, author = {Cynthia Dwork and Paris C. Kanellakis and Larry J. Stockmeyer}, title = {Parallel Algorithms for Term Matching}, journal = {{SIAM} J. Comput.}, volume = {17}, number = {4}, pages = {711--731}, year = {1988}, url = {https://doi.org/10.1137/0217046}, doi = {10.1137/0217046}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DworkKS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/DworkS88, author = {Cynthia Dwork and Larry J. Stockmeyer}, editor = {Shafi Goldwasser}, title = {Zero-Knowledge With Finite State Verifiers}, booktitle = {Advances in Cryptology - {CRYPTO} '88, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {403}, pages = {71--75}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/0-387-34799-2\_6}, doi = {10.1007/0-387-34799-2\_6}, timestamp = {Fri, 17 Jul 2020 16:12:45 +0200}, biburl = {https://dblp.org/rec/conf/crypto/DworkS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/DolevDS87, author = {Danny Dolev and Cynthia Dwork and Larry J. Stockmeyer}, title = {On the minimal synchronism needed for distributed consensus}, journal = {J. {ACM}}, volume = {34}, number = {1}, pages = {77--97}, year = {1987}, url = {https://doi.org/10.1145/7531.7533}, doi = {10.1145/7531.7533}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/DolevDS87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsyml/Stockmeyer87, author = {Larry J. Stockmeyer}, title = {Classifying the Computational Complexity of Problems}, journal = {J. Symb. Log.}, volume = {52}, number = {1}, pages = {1--43}, year = {1987}, url = {https://doi.org/10.2307/2273858}, doi = {10.2307/2273858}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsyml/Stockmeyer87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cade/DworkCKS86, author = {Cynthia Dwork and Paris C. Kanellakis and Larry J. Stockmeyer}, editor = {J{\"{o}}rg H. Siekmann}, title = {Parallel Algorithms for Term Matching}, booktitle = {8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {230}, pages = {416--430}, publisher = {Springer}, year = {1986}, url = {https://doi.org/10.1007/3-540-16780-3\_109}, doi = {10.1007/3-540-16780-3\_109}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/cade/DworkCKS86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DworkSS86, author = {Cynthia Dwork and David B. Shmoys and Larry J. Stockmeyer}, title = {Flipping Persuasively in Constant Expected Time (Preliminary Version)}, booktitle = {27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986}, pages = {222--232}, publisher = {{IEEE} Computer Society}, year = {1986}, url = {https://doi.org/10.1109/SFCS.1986.20}, doi = {10.1109/SFCS.1986.20}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DworkSS86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1016/S0019-9958(85)80043-7}, doi = {10.1016/S0019-9958(85)80043-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/FurstLS85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Stockmeyer85, author = {Larry J. Stockmeyer}, title = {On Approximation Algorithms for {\#}P}, journal = {{SIAM} J. Comput.}, volume = {14}, number = {4}, pages = {849--861}, year = {1985}, url = {https://doi.org/10.1137/0214060}, doi = {10.1137/0214060}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/Stockmeyer85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FaginKPS85, author = {Ronald Fagin and Maria M. Klawe and Nicholas Pippenger and Larry J. Stockmeyer}, title = {Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions}, journal = {Theor. Comput. Sci.}, volume = {36}, pages = {239--250}, year = {1985}, url = {https://doi.org/10.1016/0304-3975(85)90045-3}, doi = {10.1016/0304-3975(85)90045-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FaginKPS85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/VardiS85, author = {Moshe Y. Vardi and Larry J. Stockmeyer}, editor = {Robert Sedgewick}, title = {Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report}, booktitle = {Proceedings of the 17th Annual {ACM} Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, {USA}}, pages = {240--251}, publisher = {{ACM}}, year = {1985}, url = {https://doi.org/10.1145/22145.22173}, doi = {10.1145/22145.22173}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/VardiS85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CoanDDS85, author = {Brian A. Coan and Danny Dolev and Cynthia Dwork and Larry J. Stockmeyer}, editor = {Robert Sedgewick}, title = {The Distributed Firing Squad Problem (Preliminary Version)}, booktitle = {Proceedings of the 17th Annual {ACM} Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, {USA}}, pages = {335--345}, publisher = {{ACM}}, year = {1985}, url = {https://doi.org/10.1145/22145.22182}, doi = {10.1145/22145.22182}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CoanDDS85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CarterSW85, author = {Larry Carter and Larry J. Stockmeyer and Mark N. Wegman}, editor = {Robert Sedgewick}, title = {The Complexity of Backtrack Searches (Preliminary Version)}, booktitle = {Proceedings of the 17th Annual {ACM} Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, {USA}}, pages = {449--457}, publisher = {{ACM}}, year = {1985}, url = {https://doi.org/10.1145/22145.22195}, doi = {10.1145/22145.22195}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CarterSW85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/LadnerSL84, author = {Richard E. Ladner and Larry J. Stockmeyer and Richard J. Lipton}, title = {Alternation Bounded Auxiliary Pushdown Automata}, journal = {Inf. Control.}, volume = {62}, number = {2/3}, pages = {93--108}, year = {1984}, url = {https://doi.org/10.1016/S0019-9958(84)80029-7}, doi = {10.1016/S0019-9958(84)80029-7}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/LadnerSL84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/GurevichSV84, author = {Yuri Gurevich and Larry J. Stockmeyer and Uzi Vishkin}, title = {Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems}, journal = {J. {ACM}}, volume = {31}, number = {3}, pages = {459--473}, year = {1984}, url = {https://doi.org/10.1145/828.322439}, doi = {10.1145/828.322439}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/GurevichSV84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/LadnerLS84, author = {Richard E. Ladner and Richard J. Lipton and Larry J. Stockmeyer}, title = {Alternating Pushdown and Stack Automata}, journal = {{SIAM} J. Comput.}, volume = {13}, number = {1}, pages = {135--155}, year = {1984}, url = {https://doi.org/10.1137/0213010}, doi = {10.1137/0213010}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/LadnerLS84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/StockmeyerV84, author = {Larry J. Stockmeyer and Uzi Vishkin}, title = {Simulation of Parallel Random Access Machines by Circuits}, journal = {{SIAM} J. Comput.}, volume = {13}, number = {2}, pages = {409--422}, year = {1984}, url = {https://doi.org/10.1137/0213027}, doi = {10.1137/0213027}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/StockmeyerV84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ChandraSV84, author = {Ashok K. Chandra and Larry J. Stockmeyer and Uzi Vishkin}, title = {Constant Depth Reducibility}, journal = {{SIAM} J. Comput.}, volume = {13}, number = {2}, pages = {423--439}, year = {1984}, url = {https://doi.org/10.1137/0213028}, doi = {10.1137/0213028}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ChandraSV84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/DworkLS84, author = {Cynthia Dwork and Nancy A. Lynch and Larry J. Stockmeyer}, editor = {Tiko Kameda and Jayadev Misra and Joseph G. Peters and Nicola Santoro}, title = {Consensus in the Presence of Partial Synchrony (Preliminary Version)}, booktitle = {Proceedings of the Third Annual {ACM} Symposium on Principles of Distributed Computing, Vancouver, B. C., Canada, August 27-29, 1984}, pages = {103--118}, publisher = {{ACM}}, year = {1984}, url = {https://dl.acm.org/citation.cfm?id=1599406}, timestamp = {Mon, 26 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/DworkLS84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Stockmeyer83, author = {Larry J. Stockmeyer}, title = {Optimal Orientations of Cells in Slicing Floorplan Designs}, journal = {Inf. Control.}, volume = {57}, number = {2/3}, pages = {91--101}, year = {1983}, url = {https://doi.org/10.1016/S0019-9958(83)80038-2}, doi = {10.1016/S0019-9958(83)80038-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Stockmeyer83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/FurstLS83, author = {Merrick L. Furst and Richard J. Lipton and Larry J. Stockmeyer}, editor = {Marek Karpinski}, title = {Pseudorandom Number Generation and Space Complexity}, booktitle = {Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983}, series = {Lecture Notes in Computer Science}, volume = {158}, pages = {171--176}, publisher = {Springer}, year = {1983}, url = {https://doi.org/10.1007/3-540-12689-9\_102}, doi = {10.1007/3-540-12689-9\_102}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/FurstLS83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DolevDS83, author = {Danny Dolev and Cynthia Dwork and Larry J. Stockmeyer}, title = {On the Minimal Synchronism Needed for Distributed Consensus}, booktitle = {24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona, USA, 7-9 November 1983}, pages = {393--402}, publisher = {{IEEE} Computer Society}, year = {1983}, url = {https://doi.org/10.1109/SFCS.1983.41}, doi = {10.1109/SFCS.1983.41}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DolevDS83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Stockmeyer83, author = {Larry J. Stockmeyer}, editor = {David S. Johnson and Ronald Fagin and Michael L. Fredman and David Harel and Richard M. Karp and Nancy A. Lynch and Christos H. Papadimitriou and Ronald L. Rivest and Walter L. Ruzzo and Joel I. Seiferas}, title = {The Complexity of Approximate Counting (Preliminary Version)}, booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, {USA}}, pages = {118--126}, publisher = {{ACM}}, year = {1983}, url = {https://doi.org/10.1145/800061.808740}, doi = {10.1145/800061.808740}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Stockmeyer83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/StockmeyerV82, author = {Larry J. Stockmeyer and Vijay V. Vazirani}, title = {NP-Completeness of Some Generalizations of the Maximum Matching Problem}, journal = {Inf. Process. Lett.}, volume = {15}, number = {1}, pages = {14--19}, year = {1982}, url = {https://doi.org/10.1016/0020-0190(82)90077-1}, doi = {10.1016/0020-0190(82)90077-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/StockmeyerV82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tc/OttmannRS82, author = {Thomas Ottmann and Arnold L. Rosenberg and Larry J. Stockmeyer}, title = {A Dictionary Machine (for {VLSI)}}, journal = {{IEEE} Trans. Computers}, volume = {31}, number = {9}, pages = {892--897}, year = {1982}, url = {https://doi.org/10.1109/TC.1982.1676104}, doi = {10.1109/TC.1982.1676104}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tc/OttmannRS82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/ChandraSV82, author = {Ashok K. Chandra and Larry J. Stockmeyer and Uzi Vishkin}, title = {A Complexity Theory for Unbounded Fan-In Parallelism}, booktitle = {23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982}, pages = {1--13}, publisher = {{IEEE} Computer Society}, year = {1982}, url = {https://doi.org/10.1109/SFCS.1982.3}, doi = {10.1109/SFCS.1982.3}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/ChandraSV82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/ChandraKS81, author = {Ashok K. Chandra and Dexter Kozen and Larry J. Stockmeyer}, title = {Alternation}, journal = {J. {ACM}}, volume = {28}, number = {1}, pages = {114--133}, year = {1981}, url = {https://doi.org/10.1145/322234.322243}, doi = {10.1145/322234.322243}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/ChandraKS81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/RosenbergSS80, author = {Arnold L. Rosenberg and Larry J. Stockmeyer and Lawrence Snyder}, title = {Uniform Data Encodings}, journal = {Theor. Comput. Sci.}, volume = {11}, pages = {145--165}, year = {1980}, url = {https://doi.org/10.1016/0304-3975(80)90043-2}, doi = {10.1016/0304-3975(80)90043-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/RosenbergSS80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/StockmeyerC79, author = {Larry J. Stockmeyer and Ashok K. Chandra}, title = {Provably Difficult Combinatorial Games}, journal = {{SIAM} J. Comput.}, volume = {8}, number = {2}, pages = {151--174}, year = {1979}, url = {https://doi.org/10.1137/0208013}, doi = {10.1137/0208013}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/StockmeyerC79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/StockmeyerW79, author = {Larry J. Stockmeyer and C. K. Wong}, title = {On the Number of Comparisons to Find the Intersection of Two Relations}, journal = {{SIAM} J. Comput.}, volume = {8}, number = {3}, pages = {388--404}, year = {1979}, url = {https://doi.org/10.1137/0208030}, doi = {10.1137/0208030}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/StockmeyerW79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cacm/KouSW78, author = {Lawrence T. Kou and Larry J. Stockmeyer and C. K. Wong}, title = {Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs}, journal = {Commun. {ACM}}, volume = {21}, number = {2}, pages = {135--139}, year = {1978}, url = {https://doi.org/10.1145/359340.359346}, doi = {10.1145/359340.359346}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cacm/KouSW78.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/LiptonS78, author = {Richard J. Lipton and Larry J. Stockmeyer}, title = {Evaluation of Polynomials with Super-Preconditioning}, journal = {J. Comput. Syst. Sci.}, volume = {16}, number = {2}, pages = {124--139}, year = {1978}, url = {https://doi.org/10.1016/0022-0000(78)90041-7}, doi = {10.1016/0022-0000(78)90041-7}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/LiptonS78.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/LadnerLS78, author = {Richard E. Ladner and Richard J. Lipton and Larry J. Stockmeyer}, title = {Alternating Pushdown Automata (Preliminary Report)}, booktitle = {19th Annual Symposium on Foundations of Computer Science, Ann Arbor, Michigan, USA, 16-18 October 1978}, pages = {92--106}, publisher = {{IEEE} Computer Society}, year = {1978}, url = {https://doi.org/10.1109/SFCS.1978.6}, doi = {10.1109/SFCS.1978.6}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/LadnerLS78.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/RosenbergS77, author = {Arnold L. Rosenberg and Larry J. Stockmeyer}, title = {Storage Schemes for Boundedly Extendible Arrays}, journal = {Acta Informatica}, volume = {7}, pages = {289--303}, year = {1977}, url = {https://doi.org/10.1007/BF00290338}, doi = {10.1007/BF00290338}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/RosenbergS77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/RosenbergS77, author = {Arnold L. Rosenberg and Larry J. Stockmeyer}, title = {Hashing Schemes for Extendible Arrays}, journal = {J. {ACM}}, volume = {24}, number = {2}, pages = {199--221}, year = {1977}, url = {https://doi.org/10.1145/322003.322006}, doi = {10.1145/322003.322006}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/RosenbergS77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Stockmeyer77, author = {Larry J. Stockmeyer}, title = {On the Combinational Complexity of Certain Symmetric Boolean Functions}, journal = {Math. Syst. Theory}, volume = {10}, pages = {323--336}, year = {1977}, url = {https://doi.org/10.1007/BF01683282}, doi = {10.1007/BF01683282}, timestamp = {Sun, 17 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/Stockmeyer77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/PrattS76, author = {Vaughan R. Pratt and Larry J. Stockmeyer}, title = {A Characterization of the Power of Vector Machines}, journal = {J. Comput. Syst. Sci.}, volume = {12}, number = {2}, pages = {198--221}, year = {1976}, url = {https://doi.org/10.1016/S0022-0000(76)80037-2}, doi = {10.1016/S0022-0000(76)80037-2}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/PrattS76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GareyJS76, author = {M. R. Garey and David S. Johnson and Larry J. Stockmeyer}, title = {Some Simplified NP-Complete Graph Problems}, journal = {Theor. Comput. Sci.}, volume = {1}, number = {3}, pages = {237--267}, year = {1976}, url = {https://doi.org/10.1016/0304-3975(76)90059-1}, doi = {10.1016/0304-3975(76)90059-1}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GareyJS76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Stockmeyer76, author = {Larry J. Stockmeyer}, title = {The Polynomial-Time Hierarchy}, journal = {Theor. Comput. Sci.}, volume = {3}, number = {1}, pages = {1--22}, year = {1976}, url = {https://doi.org/10.1016/0304-3975(76)90061-X}, doi = {10.1016/0304-3975(76)90061-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Stockmeyer76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/ChandraS76, author = {Ashok K. Chandra and Larry J. Stockmeyer}, title = {Alternation}, booktitle = {17th Annual Symposium on Foundations of Computer Science, Houston, Texas, USA, 25-27 October 1976}, pages = {98--108}, publisher = {{IEEE} Computer Society}, year = {1976}, url = {https://doi.org/10.1109/SFCS.1976.4}, doi = {10.1109/SFCS.1976.4}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/ChandraS76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LiptonS76, author = {Richard J. Lipton and Larry J. Stockmeyer}, editor = {Ashok K. Chandra and Detlef Wotschke and Emily P. Friedman and Michael A. Harrison}, title = {Evaluation of Polynomials with Super-Preconditioning}, booktitle = {Proceedings of the 8th Annual {ACM} Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, {USA}}, pages = {174--180}, publisher = {{ACM}}, year = {1976}, url = {https://doi.org/10.1145/800113.803645}, doi = {10.1145/800113.803645}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/LiptonS76.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/RosenbergS75, author = {Arnold L. Rosenberg and Larry J. Stockmeyer}, editor = {William C. Rounds and Nancy Martin and Jack W. Carlyle and Michael A. Harrison}, title = {Hashing Schemes for Extendible Arrays (Extended Arrays)}, booktitle = {Proceedings of the 7th Annual {ACM} Symposium on Theory of Computing, May 5-7, 1975, Albuquerque, New Mexico, {USA}}, pages = {159--166}, publisher = {{ACM}}, year = {1975}, url = {https://doi.org/10.1145/800116.803765}, doi = {10.1145/800116.803765}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/RosenbergS75.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/us/Stockmeyer74, author = {Larry J. Stockmeyer}, title = {The complexity of decision problems in automata theory and logic}, school = {Massachusetts Institute of Technology, {USA}}, year = {1974}, url = {http://hdl.handle.net/1721.1/15540}, timestamp = {Fri, 05 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/us/Stockmeyer74.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FischerS74, author = {Michael J. Fischer and Larry J. Stockmeyer}, title = {Fast On-Line Integer Multiplication}, journal = {J. Comput. Syst. Sci.}, volume = {9}, number = {3}, pages = {317--331}, year = {1974}, url = {https://doi.org/10.1016/S0022-0000(74)80047-4}, doi = {10.1016/S0022-0000(74)80047-4}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FischerS74.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GareyJS74, author = {M. R. Garey and David S. Johnson and Larry J. Stockmeyer}, editor = {Robert L. Constable and Robert W. Ritchie and Jack W. Carlyle and Michael A. Harrison}, title = {Some Simplified NP-Complete Problems}, booktitle = {Proceedings of the 6th Annual {ACM} Symposium on Theory of Computing, April 30 - May 2, 1974, Seattle, Washington, {USA}}, pages = {47--63}, publisher = {{ACM}}, year = {1974}, url = {https://doi.org/10.1145/800119.803884}, doi = {10.1145/800119.803884}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GareyJS74.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/PrattRS74, author = {Vaughan R. Pratt and Michael O. Rabin and Larry J. Stockmeyer}, editor = {Robert L. Constable and Robert W. Ritchie and Jack W. Carlyle and Michael A. Harrison}, title = {A Characterization of the Power of Vector Machines}, booktitle = {Proceedings of the 6th Annual {ACM} Symposium on Theory of Computing, April 30 - May 2, 1974, Seattle, Washington, {USA}}, pages = {122--134}, publisher = {{ACM}}, year = {1974}, url = {https://doi.org/10.1145/800119.803892}, doi = {10.1145/800119.803892}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/PrattRS74.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/PatersonS73, author = {Mike Paterson and Larry J. Stockmeyer}, title = {On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials}, journal = {{SIAM} J. Comput.}, volume = {2}, number = {1}, pages = {60--66}, year = {1973}, url = {https://doi.org/10.1137/0202007}, doi = {10.1137/0202007}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/PatersonS73.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/Stockmeyer73, author = {Larry J. Stockmeyer}, title = {Planar 3-colorability is polynomial complete}, journal = {{SIGACT} News}, volume = {5}, number = {3}, pages = {19--25}, year = {1973}, url = {https://doi.org/10.1145/1008293.1008294}, doi = {10.1145/1008293.1008294}, timestamp = {Thu, 05 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/Stockmeyer73.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/StockmeyerM73, author = {Larry J. Stockmeyer and Albert R. Meyer}, editor = {Alfred V. Aho and Allan Borodin and Robert L. Constable and Robert W. Floyd and Michael A. Harrison and Richard M. Karp and H. Raymond Strong}, title = {Word Problems Requiring Exponential Time: Preliminary Report}, booktitle = {Proceedings of the 5th Annual {ACM} Symposium on Theory of Computing, April 30 - May 2, 1973, Austin, Texas, {USA}}, pages = {1--9}, publisher = {{ACM}}, year = {1973}, url = {https://doi.org/10.1145/800125.804029}, doi = {10.1145/800125.804029}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/StockmeyerM73.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FischerS73, author = {Michael J. Fischer and Larry J. Stockmeyer}, editor = {Alfred V. Aho and Allan Borodin and Robert L. Constable and Robert W. Floyd and Michael A. Harrison and Richard M. Karp and H. Raymond Strong}, title = {Fast On-Line Integer Multiplication}, booktitle = {Proceedings of the 5th Annual {ACM} Symposium on Theory of Computing, April 30 - May 2, 1973, Austin, Texas, {USA}}, pages = {67--72}, publisher = {{ACM}}, year = {1973}, url = {https://doi.org/10.1145/800125.804037}, doi = {10.1145/800125.804037}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FischerS73.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/MeyerS72, author = {Albert R. Meyer and Larry J. Stockmeyer}, title = {The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space}, booktitle = {13th Annual Symposium on Switching and Automata Theory, College Park, Maryland, USA, October 25-27, 1972}, pages = {125--129}, publisher = {{IEEE} Computer Society}, year = {1972}, url = {https://doi.org/10.1109/SWAT.1972.29}, doi = {10.1109/SWAT.1972.29}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/MeyerS72.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/PatersonS71, author = {Mike Paterson and Larry J. Stockmeyer}, title = {Bounds on the Evaluation Time for Rational Polynomials}, booktitle = {12th Annual Symposium on Switching and Automata Theory, East Lansing, Michigan, USA, October 13-15, 1971}, pages = {140--143}, publisher = {{IEEE} Computer Society}, year = {1971}, url = {https://doi.org/10.1109/SWAT.1971.5}, doi = {10.1109/SWAT.1971.5}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/PatersonS71.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.