default search action
Search dblp for Publications
export results for "toc:db/journals/jacm/jacm38.bht:"
@article{DBLP:journals/jacm/AlonDO91, author = {Noga Alon and A. K. Dewdney and Teunis J. Ott}, title = {Efficient Simulation of Finite Automata by Neural Nets}, journal = {J. {ACM}}, volume = {38}, number = {2}, pages = {495--514}, year = {1991}, url = {https://doi.org/10.1145/103516.103523}, doi = {10.1145/103516.103523}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/AlonDO91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/ArkinPY91, author = {Esther M. Arkin and Christos H. Papadimitriou and Mihalis Yannakakis}, title = {Modularity of Cycles and Paths in Graphs}, journal = {J. {ACM}}, volume = {38}, number = {2}, pages = {255--274}, year = {1991}, url = {https://doi.org/10.1145/103516.103517}, doi = {10.1145/103516.103517}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/ArkinPY91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/AtallahCW91, author = {Mikhail J. Atallah and Danny Z. Chen and Hubert Wagener}, title = {An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point}, journal = {J. {ACM}}, volume = {38}, number = {3}, pages = {516--533}, year = {1991}, url = {https://doi.org/10.1145/116825.116827}, doi = {10.1145/116825.116827}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/AtallahCW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/BalasMPT91, author = {Egon Balas and Donald L. Miller and Joseph F. Pekny and Paolo Toth}, title = {A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem}, journal = {J. {ACM}}, volume = {38}, number = {4}, pages = {985--1004}, year = {1991}, url = {https://doi.org/10.1145/115234.115349}, doi = {10.1145/115234.115349}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/BalasMPT91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/BambosW91, author = {Nicholas Bambos and Jean C. Walrand}, title = {On Stability and Performance of Parallel Processing Systems}, journal = {J. {ACM}}, volume = {38}, number = {2}, pages = {429--452}, year = {1991}, url = {https://doi.org/10.1145/103516.103520}, doi = {10.1145/103516.103520}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/BambosW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/BergerR91, author = {Bonnie Berger and John Rompel}, title = {Simulating (log c n)-Wise Independence in {NC}}, journal = {J. {ACM}}, volume = {38}, number = {4}, pages = {1026--1046}, year = {1991}, url = {https://doi.org/10.1145/115234.115347}, doi = {10.1145/115234.115347}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/BergerR91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/BloomE91, author = {Stephen L. Bloom and Zolt{\'{a}}n {\'{E}}sik}, title = {Floyd-Hoare Logic in Iteration Theories}, journal = {J. {ACM}}, volume = {38}, number = {4}, pages = {887--934}, year = {1991}, url = {https://doi.org/10.1145/115234.115352}, doi = {10.1145/115234.115352}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/BloomE91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Bryant91, author = {Randal E. Bryant}, title = {A Methodology for Hardware Verification Based on Logic Simulation}, journal = {J. {ACM}}, volume = {38}, number = {2}, pages = {299--328}, year = {1991}, url = {https://doi.org/10.1145/103516.103519}, doi = {10.1145/103516.103519}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Bryant91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/ChanH91, author = {Edward P. F. Chan and H{\'{e}}ctor J. Hern{\'{a}}ndez}, title = {Independence-Reducible Database Schemes}, journal = {J. {ACM}}, volume = {38}, number = {4}, pages = {854--886}, year = {1991}, url = {https://doi.org/10.1145/115234.115362}, doi = {10.1145/115234.115362}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/ChanH91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/ChandruH91, author = {Vijay Chandru and John N. Hooker}, title = {Extended Horn Sets In Propositional Logic}, journal = {J. {ACM}}, volume = {38}, number = {1}, pages = {205--221}, year = {1991}, url = {https://doi.org/10.1145/102782.102789}, doi = {10.1145/102782.102789}, timestamp = {Sun, 03 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/ChandruH91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Condon91, author = {Anne Condon}, title = {Space-Bounded Probabilistic Game Automata}, journal = {J. {ACM}}, volume = {38}, number = {2}, pages = {472--494}, year = {1991}, url = {https://doi.org/10.1145/103516.128681}, doi = {10.1145/103516.128681}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Condon91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/CrochemoreP91, author = {Maxime Crochemore and Dominique Perrin}, title = {Two-Way String Matching}, journal = {J. {ACM}}, volume = {38}, number = {3}, pages = {651--675}, year = {1991}, url = {https://doi.org/10.1145/116825.116845}, doi = {10.1145/116825.116845}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/CrochemoreP91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/DobkinS91, author = {David P. Dobkin and Subhash Suri}, title = {Maintenance of Geometric Extrema}, journal = {J. {ACM}}, volume = {38}, number = {2}, pages = {275--298}, year = {1991}, url = {https://doi.org/10.1145/103516.103518}, doi = {10.1145/103516.103518}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/DobkinS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/DyerFK91, author = {Martin E. Dyer and Alan M. Frieze and Ravi Kannan}, title = {A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies}, journal = {J. {ACM}}, volume = {38}, number = {1}, pages = {1--17}, year = {1991}, url = {https://doi.org/10.1145/102782.102783}, doi = {10.1145/102782.102783}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/DyerFK91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/FaginHV91, author = {Ronald Fagin and Joseph Y. Halpern and Moshe Y. Vardi}, title = {A Model-Theoretic Analysis of Knowledge}, journal = {J. {ACM}}, volume = {38}, number = {2}, pages = {382--428}, year = {1991}, url = {https://doi.org/10.1145/103516.128680}, doi = {10.1145/103516.128680}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/FaginHV91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Frederickson91, author = {Greg N. Frederickson}, title = {Planar Graph Decomposition and All Pairs Shortest Paths}, journal = {J. {ACM}}, volume = {38}, number = {1}, pages = {162--204}, year = {1991}, url = {https://doi.org/10.1145/102782.102788}, doi = {10.1145/102782.102788}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Frederickson91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/GabowT91, author = {Harold N. Gabow and Robert Endre Tarjan}, title = {Faster Scaling Algorithms for General Graph-Matching Problems}, journal = {J. {ACM}}, volume = {38}, number = {4}, pages = {815--853}, year = {1991}, url = {https://doi.org/10.1145/115234.115366}, doi = {10.1145/115234.115366}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/GabowT91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/GelderRS91, author = {Allen Van Gelder and Kenneth A. Ross and John S. Schlipf}, title = {The Well-Founded Semantics for General Logic Programs}, journal = {J. {ACM}}, volume = {38}, number = {3}, pages = {620--650}, year = {1991}, url = {https://doi.org/10.1145/116825.116838}, doi = {10.1145/116825.116838}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/GelderRS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Glasserman91, author = {Paul Glasserman}, title = {Structural Conditions for Perturbation Analysis of Queuing Systems}, journal = {J. {ACM}}, volume = {38}, number = {4}, pages = {1005--1025}, year = {1991}, url = {https://doi.org/10.1145/115234.115348}, doi = {10.1145/115234.115348}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Glasserman91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/GoldreichMW91, author = {Oded Goldreich and Silvio Micali and Avi Wigderson}, title = {Proofs that Yield Nothing But Their Validity for All Languages in {NP} Have Zero-Knowledge Proof Systems}, journal = {J. {ACM}}, volume = {38}, number = {3}, pages = {691--729}, year = {1991}, url = {https://doi.org/10.1145/116825.116852}, doi = {10.1145/116825.116852}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/GoldreichMW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/HalpernS91, author = {Joseph Y. Halpern and Yoav Shoham}, title = {A Propositional Modal Logic of Time Intervals}, journal = {J. {ACM}}, volume = {38}, number = {4}, pages = {935--962}, year = {1991}, url = {https://doi.org/10.1145/115234.115351}, doi = {10.1145/115234.115351}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/HalpernS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/HsiangR91, author = {Jieh Hsiang and Micha{\"{e}}l Rusinowitch}, title = {Proving Refutational Completeness of Theorem-Proving Strategies: The Transfinite Semantic Tree Method}, journal = {J. {ACM}}, volume = {38}, number = {3}, pages = {559--587}, year = {1991}, url = {https://doi.org/10.1145/116825.116833}, doi = {10.1145/116825.116833}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/HsiangR91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Imielinski91, author = {Tomasz Imielinski}, title = {Abstraction in Query Processing}, journal = {J. {ACM}}, volume = {38}, number = {3}, pages = {534--558}, year = {1991}, url = {https://doi.org/10.1145/116825.116832}, doi = {10.1145/116825.116832}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Imielinski91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/IoannidisW91, author = {Yannis E. Ioannidis and Eugene Wong}, title = {Towards an Algebraic Theory of Recursion}, journal = {J. {ACM}}, volume = {38}, number = {2}, pages = {329--381}, year = {1991}, url = {https://doi.org/10.1145/103516.103521}, doi = {10.1145/103516.103521}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/IoannidisW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Kissin91, author = {Gloria Kissin}, title = {Upper and Lower Bounds on Switching Energy in {VLSI}}, journal = {J. {ACM}}, volume = {38}, number = {1}, pages = {222--254}, year = {1991}, url = {https://doi.org/10.1145/102782.102790}, doi = {10.1145/102782.102790}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Kissin91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Leighton91, author = {Frank Thomson Leighton}, title = {Letter from the Editor}, journal = {J. {ACM}}, volume = {38}, number = {3}, pages = {515--515}, year = {1991}, timestamp = {Thu, 20 Nov 2003 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Leighton91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/MansourST91, author = {Yishay Mansour and Baruch Schieber and Prasoon Tiwari}, title = {A Lower Bound for Integer Greatest Common Divisor Computations}, journal = {J. {ACM}}, volume = {38}, number = {2}, pages = {453--471}, year = {1991}, url = {https://doi.org/10.1145/103516.103522}, doi = {10.1145/103516.103522}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/MansourST91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/MarekT91, author = {V. Wiktor Marek and Miroslaw Truszczynski}, title = {Autoepistemic Logic}, journal = {J. {ACM}}, volume = {38}, number = {3}, pages = {588--619}, year = {1991}, url = {https://doi.org/10.1145/116825.116836}, doi = {10.1145/116825.116836}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/MarekT91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/MitchellP91, author = {Joseph S. B. Mitchell and Christos H. Papadimitriou}, title = {The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision}, journal = {J. {ACM}}, volume = {38}, number = {1}, pages = {18--73}, year = {1991}, url = {https://doi.org/10.1145/102782.102784}, doi = {10.1145/102782.102784}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/MitchellP91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Mulmuley91, author = {Ketan Mulmuley}, title = {A Fast Planar Partition Algorithm, {II}}, journal = {J. {ACM}}, volume = {38}, number = {1}, pages = {74--103}, year = {1991}, url = {https://doi.org/10.1145/102782.102785}, doi = {10.1145/102782.102785}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Mulmuley91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/OzverenWA91, author = {C{\"{u}}neyt M. {\"{O}}zveren and Alan S. Willsky and Panos J. Antsaklis}, title = {Stability and Stabilizability of Discrete Event Dynamic Systems}, journal = {J. {ACM}}, volume = {38}, number = {3}, pages = {730--752}, year = {1991}, url = {https://doi.org/10.1145/116825.116855}, doi = {10.1145/116825.116855}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/OzverenWA91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/RossY91, author = {Keith W. Ross and David D. Yao}, title = {Optimal Load Balancing and Scheduling in a Distributed Computer System}, journal = {J. {ACM}}, volume = {38}, number = {3}, pages = {676--690}, year = {1991}, url = {https://doi.org/10.1145/116825.116847}, doi = {10.1145/116825.116847}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/RossY91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Sagiv91, author = {Yehoshua Sagiv}, title = {Evaluation of Queries in Independent Database Schemes}, journal = {J. {ACM}}, volume = {38}, number = {1}, pages = {120--161}, year = {1991}, url = {https://doi.org/10.1145/102782.102787}, doi = {10.1145/102782.102787}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Sagiv91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/StewartW91, author = {Bradley S. Stewart and Chelsea C. White III}, title = {Multiobjective A*}, journal = {J. {ACM}}, volume = {38}, number = {4}, pages = {775--814}, year = {1991}, url = {https://doi.org/10.1145/115234.115368}, doi = {10.1145/115234.115368}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/StewartW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/TiomkinK91, author = {Michael L. Tiomkin and Michael Kaminski}, title = {Nonmonotonic Default Modal Logics}, journal = {J. {ACM}}, volume = {38}, number = {4}, pages = {963--984}, year = {1991}, url = {https://doi.org/10.1145/115234.115350}, doi = {10.1145/115234.115350}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/TiomkinK91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Toran91, author = {Jacobo Tor{\'{a}}n}, title = {Complexity Classes Defined by Counting Quantifiers}, journal = {J. {ACM}}, volume = {38}, number = {3}, pages = {753--774}, year = {1991}, url = {https://doi.org/10.1145/116825.116858}, doi = {10.1145/116825.116858}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Toran91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Willard91, author = {Dan E. Willard}, title = {Optimal Sample Cost Residues for Differential Database Batch Query Problems}, journal = {J. {ACM}}, volume = {38}, number = {1}, pages = {104--119}, year = {1991}, url = {https://doi.org/10.1145/102782.102786}, doi = {10.1145/102782.102786}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Willard91.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.