Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jacm/jacm39.bht:"
download as .bib file
@article{DBLP:journals/jacm/AcetoH92,
author = {Luca Aceto and
Matthew Hennessy},
title = {Termination, Deadlock, and Divergence},
journal = {J. {ACM}},
volume = {39},
number = {1},
pages = {147--187},
year = {1992},
url = {https://doi.org/10.1145/147508.147527},
doi = {10.1145/147508.147527},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AcetoH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AllenderH92,
author = {Eric Allender and
Lane A. Hemachandra},
title = {Lower Bounds for the Low Hierarchy},
journal = {J. {ACM}},
volume = {39},
number = {1},
pages = {234--251},
year = {1992},
url = {https://doi.org/10.1145/147508.147546},
doi = {10.1145/147508.147546},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AllenderH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeaudryMT92,
author = {Martin Beaudry and
Pierre McKenzie and
Denis Th{\'{e}}rien},
title = {The Membership Problem in Aperiodic Transformation Monoids},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {599--616},
year = {1992},
url = {https://doi.org/10.1145/146637.146661},
doi = {10.1145/146637.146661},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BeaudryMT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BellareM92,
author = {Mihir Bellare and
Silvio Micali},
title = {How to Sign Given Any Trapdoor Permutation},
journal = {J. {ACM}},
volume = {39},
number = {1},
pages = {214--233},
year = {1992},
url = {https://doi.org/10.1145/147508.147537},
doi = {10.1145/147508.147537},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BellareM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ben-AmramG92,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
title = {On Pointers versus Addresses},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {617--648},
year = {1992},
url = {https://doi.org/10.1145/146637.146666},
doi = {10.1145/146637.146666},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Ben-AmramG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BillionnetCS92,
author = {Alain Billionnet and
Marie{-}Christine Costa and
Alain Sutter},
title = {An Efficient Algorithm for a Task Allocation Problem},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {502--518},
year = {1992},
url = {https://doi.org/10.1145/146637.146646},
doi = {10.1145/146637.146646},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BillionnetCS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BorodinLS92,
author = {Allan Borodin and
Nathan Linial and
Michael E. Saks},
title = {An Optimal On-Line Algorithm for Metrical Task System},
journal = {J. {ACM}},
volume = {39},
number = {4},
pages = {745--763},
year = {1992},
url = {https://doi.org/10.1145/146585.146588},
doi = {10.1145/146585.146588},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BorodinLS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChazelleE92,
author = {Bernard Chazelle and
Herbert Edelsbrunner},
title = {An Optimal Algorithm for Intersecting Line Segments in the Plane},
journal = {J. {ACM}},
volume = {39},
number = {1},
pages = {1--54},
year = {1992},
url = {https://doi.org/10.1145/147508.147511},
doi = {10.1145/147508.147511},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChazelleE92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CollinsDMP92,
author = {Oliver Collins and
Sam Dolinar and
Robert J. McEliece and
Fabrizio Pollara},
title = {A {VLSI} Decomposition of the deBruijn Graph},
journal = {J. {ACM}},
volume = {39},
number = {4},
pages = {931--948},
year = {1992},
url = {https://doi.org/10.1145/146585.146620},
doi = {10.1145/146585.146620},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CollinsDMP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Debray92,
author = {Saumya K. Debray},
title = {Efficient Dataflow Analysis of Logic Programs},
journal = {J. {ACM}},
volume = {39},
number = {4},
pages = {949--984},
year = {1992},
url = {https://doi.org/10.1145/146585.146624},
doi = {10.1145/146585.146624},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Debray92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Demolombe92,
author = {Robert Demolombe},
title = {Syntactical Characterization of a Subset of Domain-Independent Formulas},
journal = {J. {ACM}},
volume = {39},
number = {1},
pages = {71--94},
year = {1992},
url = {https://doi.org/10.1145/147508.147520},
doi = {10.1145/147508.147520},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Demolombe92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DillencourtST92,
author = {Michael B. Dillencourt and
Hanan Samet and
Markku Tamminen},
title = {A General Approach to Connected-Component Labelling for Arbitrary
Image Representations},
journal = {J. {ACM}},
volume = {39},
number = {2},
pages = {253--280},
year = {1992},
url = {https://doi.org/10.1145/128749.128750},
doi = {10.1145/128749.128750},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DillencourtST92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DillencourtST92a,
author = {Michael B. Dillencourt and
Hanan Samet and
Markku Tamminen},
title = {Corrigenda: 'A General Approach to Connected-Component Labelling for
Arbitrary Image Representations'},
journal = {J. {ACM}},
volume = {39},
number = {4},
pages = {985--986},
year = {1992},
timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DillencourtST92a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DowdyCKT92,
author = {Lawrence W. Dowdy and
Brian M. Carlson and
Alan T. Krantz and
Satish K. Tripathi},
title = {Single-Class Bounds of Multi-Class Queuing Networks},
journal = {J. {ACM}},
volume = {39},
number = {1},
pages = {188--213},
year = {1992},
url = {https://doi.org/10.1145/147508.147530},
doi = {10.1145/147508.147530},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DowdyCKT92.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}
}
@article{DBLP:journals/jacm/EppsteinGGI92,
author = {David Eppstein and
Zvi Galil and
Raffaele Giancarlo and
Giuseppe F. Italiano},
title = {Sparse Dynamic Programming {I:} Linear Cost Functions},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {519--545},
year = {1992},
url = {https://doi.org/10.1145/146637.146650},
doi = {10.1145/146637.146650},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/EppsteinGGI92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EppsteinGGI92a,
author = {David Eppstein and
Zvi Galil and
Raffaele Giancarlo and
Giuseppe F. Italiano},
title = {Sparse Dynamic Programming {II:} Convex and Concave Cost Functions},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {546--567},
year = {1992},
url = {https://doi.org/10.1145/146637.146656},
doi = {10.1145/146637.146656},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/EppsteinGGI92a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FaginHV92,
author = {Ronald Fagin and
Joseph Y. Halpern and
Moshe Y. Vardi},
title = {What Can Machines Know? On the Properties of Knowledge in Distributed
Systems},
journal = {J. {ACM}},
volume = {39},
number = {2},
pages = {328--376},
year = {1992},
url = {https://doi.org/10.1145/128749.150945},
doi = {10.1145/128749.150945},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FaginHV92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FiatNSS92,
author = {Amos Fiat and
Moni Naor and
Jeanette P. Schmidt and
Alan Siegel},
title = {Nonoblivious Hashing},
journal = {J. {ACM}},
volume = {39},
number = {4},
pages = {764--782},
year = {1992},
url = {https://doi.org/10.1145/146585.146591},
doi = {10.1145/146585.146591},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FiatNSS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GallierNRS92,
author = {Jean H. Gallier and
Paliath Narendran and
Stan Raatz and
Wayne Snyder},
title = {Theorem Proving Using Equational Matings and Rigid E-Unification},
journal = {J. {ACM}},
volume = {39},
number = {2},
pages = {377--429},
year = {1992},
url = {https://doi.org/10.1145/128749.128754},
doi = {10.1145/128749.128754},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GallierNRS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GasarchS92,
author = {William I. Gasarch and
Carl H. Smith},
title = {Learning via Queries},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {649--674},
year = {1992},
url = {https://doi.org/10.1145/146637.146670},
doi = {10.1145/146637.146670},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GasarchS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GermanS92,
author = {Steven M. German and
A. Prasad Sistla},
title = {Reasoning about Systems with Many Processes},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {675--735},
year = {1992},
url = {https://doi.org/10.1145/146637.146681},
doi = {10.1145/146637.146681},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GermanS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoguenB92,
author = {Joseph A. Goguen and
Rod M. Burstall},
title = {Institutions: Abstract Model Theory for Specification and Programming},
journal = {J. {ACM}},
volume = {39},
number = {1},
pages = {95--146},
year = {1992},
url = {https://doi.org/10.1145/147508.147524},
doi = {10.1145/147508.147524},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoguenB92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GreenbergM92,
author = {Albert G. Greenberg and
Neal Madras},
title = {How Fair is Fair Queuing?},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {568--598},
year = {1992},
url = {https://doi.org/10.1145/146637.146658},
doi = {10.1145/146637.146658},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GreenbergM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HalpernZ92,
author = {Joseph Y. Halpern and
Lenore D. Zuck},
title = {A Little Knowledge Goes a Long Way: Knowledge-Based Derivations and
Correctness Proofs for a Family of Protocols},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {449--478},
year = {1992},
url = {https://doi.org/10.1145/146637.146638},
doi = {10.1145/146637.146638},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HalpernZ92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HeathI92,
author = {Lenwood S. Heath and
Sorin Istrail},
title = {The Pagenumber of Genus g Graphs is O(g)},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {479--501},
year = {1992},
url = {https://doi.org/10.1145/146637.146643},
doi = {10.1145/146637.146643},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HeathI92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HerlihyLMW92,
author = {Maurice Herlihy and
Nancy A. Lynch and
Michael Merritt and
William E. Weihl},
title = {On the Correctness of Orphan Management Algorithms},
journal = {J. {ACM}},
volume = {39},
number = {4},
pages = {881--930},
year = {1992},
url = {https://doi.org/10.1145/146585.146616},
doi = {10.1145/146585.146616},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HerlihyLMW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KatajainenR92,
author = {Jyrki Katajainen and
Timo Raita},
title = {An Analysis of the Longest Match and the Greedy Heuristics in Text
Encoding},
journal = {J. {ACM}},
volume = {39},
number = {2},
pages = {281--294},
year = {1992},
url = {https://doi.org/10.1145/128749.128751},
doi = {10.1145/128749.128751},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KatajainenR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LundFKN92,
author = {Carsten Lund and
Lance Fortnow and
Howard J. Karloff and
Noam Nisan},
title = {Algebraic Methods for Interactive Proof Systems},
journal = {J. {ACM}},
volume = {39},
number = {4},
pages = {859--868},
year = {1992},
url = {https://doi.org/10.1145/146585.146605},
doi = {10.1145/146585.146605},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LundFKN92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MansourS92,
author = {Yishay Mansour and
Baruch Schieber},
title = {The Intractability of Bounded Protocols for On-Line Sequence Transmission
over Non-FIFO Channels},
journal = {J. {ACM}},
volume = {39},
number = {4},
pages = {783--799},
year = {1992},
url = {https://doi.org/10.1145/146585.146596},
doi = {10.1145/146585.146596},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MansourS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Myers92,
author = {Eugene W. Myers},
title = {A Four Russians Algorithm for Regular Expression Pattern Matching},
journal = {J. {ACM}},
volume = {39},
number = {2},
pages = {430--448},
year = {1992},
url = {https://doi.org/10.1145/128749.128755},
doi = {10.1145/128749.128755},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Myers92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RameshR92,
author = {R. Ramesh and
I. V. Ramakrishnan},
title = {Nonlinear Pattern Matching in Trees},
journal = {J. {ACM}},
volume = {39},
number = {2},
pages = {295--316},
year = {1992},
url = {https://doi.org/10.1145/128749.128752},
doi = {10.1145/128749.128752},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/RameshR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RazW92,
author = {Ran Raz and
Avi Wigderson},
title = {Monotone Circuits for Matching Require Linear Depth},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {736--744},
year = {1992},
url = {https://doi.org/10.1145/146637.146684},
doi = {10.1145/146637.146684},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/RazW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Shamir92,
author = {Adi Shamir},
title = {{IP} = {PSPACE}},
journal = {J. {ACM}},
volume = {39},
number = {4},
pages = {869--877},
year = {1992},
url = {https://doi.org/10.1145/146585.146609},
doi = {10.1145/146585.146609},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Shamir92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Shen92,
author = {Alexander Shen},
title = {{IP} = {PSPACE:} Simplified Proof},
journal = {J. {ACM}},
volume = {39},
number = {4},
pages = {878--880},
year = {1992},
url = {https://doi.org/10.1145/146585.146613},
doi = {10.1145/146585.146613},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Shen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Sprugnoli92,
author = {Renzo Sprugnoli},
title = {The Generation of Binary Trees as a Numerical Problem},
journal = {J. {ACM}},
volume = {39},
number = {2},
pages = {317--327},
year = {1992},
url = {https://doi.org/10.1145/128749.128753},
doi = {10.1145/128749.128753},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Sprugnoli92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Upfal92,
author = {Eli Upfal},
title = {An O(log(N)) Deterministic Packet-Routing Scheme},
journal = {J. {ACM}},
volume = {39},
number = {1},
pages = {55--70},
year = {1992},
url = {https://doi.org/10.1145/147508.147517},
doi = {10.1145/147508.147517},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Upfal92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-25 12:31 CEST from data curated 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:
