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/jacm32.bht:"
download as .bib file
@article{DBLP:journals/jacm/Abiteboul85,
author = {Serge Abiteboul},
title = {Disaggregations in Databases},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {79--101},
year = {1985},
url = {https://doi.org/10.1145/2455.2463},
doi = {10.1145/2455.2463},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Abiteboul85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AdlerM85,
author = {Ilan Adler and
Nimrod Megiddo},
title = {A Simplex Algorithm Whose Average Number of Steps Is Bounded between
Two Quadratic Functions of the Smaller Dimension},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {871--895},
year = {1985},
url = {https://doi.org/10.1145/4221.4222},
doi = {10.1145/4221.4222},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AdlerM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Awerbuch85,
author = {Baruch Awerbuch},
title = {Complexity of Network Synchronization},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {804--823},
year = {1985},
url = {https://doi.org/10.1145/4221.4227},
doi = {10.1145/4221.4227},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Awerbuch85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BagchiM85,
author = {Amitava Bagchi and
A. Mahanti},
title = {Three Approaches to Heuristic Search in Networks},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {1--27},
year = {1985},
url = {https://doi.org/10.1145/2455.2458},
doi = {10.1145/2455.2458},
timestamp = {Thu, 26 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BagchiM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BakerCW85,
author = {Brenda S. Baker and
Edward G. Coffman Jr. and
Dan E. Willard},
title = {Algorithms for Resolving Conflicts in Dynamic Storage Allocation},
journal = {J. {ACM}},
volume = {32},
number = {2},
pages = {327--343},
year = {1985},
url = {https://doi.org/10.1145/3149.335126},
doi = {10.1145/3149.335126},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BakerCW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Bauer85,
author = {Michael A. Bauer},
title = {Soundness and Completeness of a Synthesis Algorithm Based on Example
Computations},
journal = {J. {ACM}},
volume = {32},
number = {2},
pages = {249--279},
year = {1985},
url = {https://doi.org/10.1145/3149.3150},
doi = {10.1145/3149.3150},
timestamp = {Fri, 13 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Bauer85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BenderB85,
author = {Edward A. Bender and
Jon T. Butler},
title = {Enumeration of Structured Flowcharts},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {537--548},
year = {1985},
url = {https://doi.org/10.1145/3828.3832},
doi = {10.1145/3828.3832},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BenderB85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrachaT85,
author = {Gabriel Bracha and
Sam Toueg},
title = {Asynchronous Consensus and Broadcast Protocols},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {824--840},
year = {1985},
url = {https://doi.org/10.1145/4221.214134},
doi = {10.1145/4221.214134},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BrachaT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BuckleyS85,
author = {Gael N. Buckley and
Abraham Silberschatz},
title = {Beyond Two-Phase Locking},
journal = {J. {ACM}},
volume = {32},
number = {2},
pages = {314--326},
year = {1985},
url = {https://doi.org/10.1145/3149.3151},
doi = {10.1145/3149.3151},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BuckleyS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CaoS85,
author = {Wei{-}Lu Cao and
William J. Stewart},
title = {Iterative Aggregation/Disaggregation Techniques for Nearly Uncoupled
Markov Chains},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {702--719},
year = {1985},
url = {https://doi.org/10.1145/3828.214137},
doi = {10.1145/3828.214137},
timestamp = {Mon, 13 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CaoS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChazelleM85,
author = {Bernard Chazelle and
Louis Monier},
title = {A Model of Computation for {VLSI} with Related Complexity Results},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {573--588},
year = {1985},
url = {https://doi.org/10.1145/3828.3834},
doi = {10.1145/3828.3834},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChazelleM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CornuejolsNP85,
author = {G{\'{e}}rard Cornu{\'{e}}jols and
Denis Naddef and
William R. Pulleyblank},
title = {The Traveling Salesman Problem in Graphs with 3-Edge Cutsets},
journal = {J. {ACM}},
volume = {32},
number = {2},
pages = {383--410},
year = {1985},
url = {https://doi.org/10.1145/3149.3154},
doi = {10.1145/3149.3154},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CornuejolsNP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Cunningham85,
author = {William H. Cunningham},
title = {Optimal Attach and Reinforcement of a Network},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {549--561},
year = {1985},
url = {https://doi.org/10.1145/3828.3829},
doi = {10.1145/3828.3829},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Cunningham85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DechterP85,
author = {Rina Dechter and
Judea Pearl},
title = {Generalized Best-First Search Strategies and the Optimality of A*},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {505--536},
year = {1985},
url = {https://doi.org/10.1145/3828.3830},
doi = {10.1145/3828.3830},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DechterP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DolevR85,
author = {Danny Dolev and
R{\"{u}}diger Reischuk},
title = {Bounds on Information Exchange for Byzantine Agreement},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {191--204},
year = {1985},
url = {https://doi.org/10.1145/2455.214112},
doi = {10.1145/2455.214112},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DolevR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EvenSY85,
author = {Shimon Even and
Alan L. Selman and
Yacov Yacobi},
title = {Hard-Core Theorems for Complexity Classes},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {205--217},
year = {1985},
url = {https://doi.org/10.1145/2455.214111},
doi = {10.1145/2455.214111},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EvenSY85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Faigle85,
author = {Ulrich Faigle},
title = {On Ordered Languages and the Optimization of Linear Functions by Greedy
Algorithms},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {861--870},
year = {1985},
url = {https://doi.org/10.1145/4221.4998},
doi = {10.1145/4221.4998},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Faigle85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FischerLP85,
author = {Michael J. Fischer and
Nancy A. Lynch and
Mike Paterson},
title = {Impossibility of Distributed Consensus with One Faulty Process},
journal = {J. {ACM}},
volume = {32},
number = {2},
pages = {374--382},
year = {1985},
url = {https://doi.org/10.1145/3149.214121},
doi = {10.1145/3149.214121},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FischerLP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Freuder85,
author = {Eugene C. Freuder},
title = {A Sufficient Condition for Backtrack-Bounded Search},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {755--761},
year = {1985},
url = {https://doi.org/10.1145/4221.4225},
doi = {10.1145/4221.4225},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Freuder85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FuchsK85,
author = {Ken Fuchs and
Dennis G. Kafura},
title = {Memory-Constrained Task Scheduling on a Network of Dual Processors},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {102--129},
year = {1985},
url = {https://doi.org/10.1145/2455.2456},
doi = {10.1145/2455.2456},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FuchsK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Garcia-MolinaB85,
author = {Hector Garcia{-}Molina and
Daniel Barbar{\'{a}}},
title = {How to Assign Votes in a Distributed System},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {841--860},
year = {1985},
url = {https://doi.org/10.1145/4221.4223},
doi = {10.1145/4221.4223},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Garcia-MolinaB85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobL85,
author = {Georg Gottlob and
Alexander Leitsch},
title = {On the Efficiency of Subsumption Algorithms},
journal = {J. {ACM}},
volume = {32},
number = {2},
pages = {280--295},
year = {1985},
url = {https://doi.org/10.1145/3149.214118},
doi = {10.1145/3149.214118},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GottlobL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GreenbergW85,
author = {Albert G. Greenberg and
Shmuel Winograd},
title = {A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts
Deterministically in Multiple Access Channels},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {589--596},
year = {1985},
url = {https://doi.org/10.1145/3828.214125},
doi = {10.1145/3828.214125},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GreenbergW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Gurari85,
author = {Eitan M. Gurari},
title = {Decidable Problems for Powerful Programs},
journal = {J. {ACM}},
volume = {32},
number = {2},
pages = {466--483},
year = {1985},
url = {https://doi.org/10.1145/3149.3157},
doi = {10.1145/3149.3157},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Gurari85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Heide85,
author = {Friedhelm Meyer auf der Heide},
title = {Lower Bounds for Solving Linear Diophantine Equations on Random Access
Machines},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {929--937},
year = {1985},
url = {https://doi.org/10.1145/4221.4250},
doi = {10.1145/4221.4250},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Heide85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hennessy85,
author = {Matthew Hennessy},
title = {Acceptance Trees},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {896--928},
year = {1985},
url = {https://doi.org/10.1145/4221.4249},
doi = {10.1145/4221.4249},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Hennessy85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HennessyM85,
author = {Matthew Hennessy and
Robin Milner},
title = {Algebraic Laws for Nondeterminism and Concurrency},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {137--161},
year = {1985},
url = {https://doi.org/10.1145/2455.2460},
doi = {10.1145/2455.2460},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HennessyM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HochbaumM85,
author = {Dorit S. Hochbaum and
Wolfgang Maass},
title = {Approximation Schemes for Covering and Packing Problems in Image Processing
and {VLSI}},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {130--136},
year = {1985},
url = {https://doi.org/10.1145/2455.214106},
doi = {10.1145/2455.214106},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HochbaumM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KarpW85,
author = {Richard M. Karp and
Avi Wigderson},
title = {A Fast Parallel Algorithm for the Maximal Independent Set Problem},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {762--773},
year = {1985},
url = {https://doi.org/10.1145/4221.4226},
doi = {10.1145/4221.4226},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KarpW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Klawe85,
author = {Maria M. Klawe},
title = {A Tight Bound for Black and White Pebbles on the Pyramid},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {218--228},
year = {1985},
url = {https://doi.org/10.1145/2455.214115},
doi = {10.1145/2455.214115},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Klawe85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LagariasO85,
author = {J. C. Lagarias and
Andrew M. Odlyzko},
title = {Solving Low-Density Subset Sum Problems},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {229--246},
year = {1985},
url = {https://doi.org/10.1145/2455.2461},
doi = {10.1145/2455.2461},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LagariasO85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LamportM85,
author = {Leslie Lamport and
P. M. Melliar{-}Smith},
title = {Synchronizing Clocks in the Presence of Faults},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {52--78},
year = {1985},
url = {https://doi.org/10.1145/2455.2457},
doi = {10.1145/2455.2457},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LamportM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LeeL85,
author = {C. C. Lee and
D. T. Lee},
title = {A Simple On-Line Bin-Packing Algorithm},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {562--572},
year = {1985},
url = {https://doi.org/10.1145/3828.3833},
doi = {10.1145/3828.3833},
timestamp = {Wed, 12 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LeeL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MahantiB85,
author = {A. Mahanti and
Amitava Bagchi},
title = {{AND/OR} Graph Heuristic Search Methods},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {28--51},
year = {1985},
url = {https://doi.org/10.1145/2455.2459},
doi = {10.1145/2455.2459},
timestamp = {Thu, 26 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/MahantiB85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ManberT85,
author = {Udi Manber and
Martin Tompa},
title = {The Complexity of Problems on Probabilistic Nondeterministic, and
Alternating Decision Trees},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {720--732},
year = {1985},
url = {https://doi.org/10.1145/3828.3838},
doi = {10.1145/3828.3838},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ManberT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MoranSM85,
author = {Shlomo Moran and
Marc Snir and
Udi Manber},
title = {Applications of Ramsey's Theorem to Decision Tree Complexity},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {938--949},
year = {1985},
url = {https://doi.org/10.1145/4221.4259},
doi = {10.1145/4221.4259},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MoranSM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Papadimitriou85,
author = {Christos H. Papadimitriou},
title = {Correction to "A Theorem in Database Concurrency Control"},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {750},
year = {1985},
timestamp = {Fri, 14 Sep 2012 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Papadimitriou85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Sacca85,
author = {Domenico Sacc{\`{a}}},
title = {Closures of Database Hypergraphs},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {774--803},
year = {1985},
url = {https://doi.org/10.1145/4221.4997},
doi = {10.1145/4221.4997},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Sacca85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SistlaC85,
author = {A. Prasad Sistla and
Edmund M. Clarke},
title = {The Complexity of Propositional Linear Temporal Logics},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {733--749},
year = {1985},
url = {https://doi.org/10.1145/3828.3837},
doi = {10.1145/3828.3837},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SistlaC85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SkyumV85,
author = {Sven Skyum and
Leslie G. Valiant},
title = {A Complexity Theory Based on Boolean Algebra},
journal = {J. {ACM}},
volume = {32},
number = {2},
pages = {484--502},
year = {1985},
url = {https://doi.org/10.1145/3149.3158},
doi = {10.1145/3149.3158},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SkyumV85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SleatorT85,
author = {Daniel Dominic Sleator and
Robert Endre Tarjan},
title = {Self-Adjusting Binary Search Trees},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {652--686},
year = {1985},
url = {https://doi.org/10.1145/3828.3835},
doi = {10.1145/3828.3835},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SleatorT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SmithS85,
author = {M. E. Gonzalez Smith and
James A. Storer},
title = {Parallel Algorithms for Data Compression},
journal = {J. {ACM}},
volume = {32},
number = {2},
pages = {344--373},
year = {1985},
url = {https://doi.org/10.1145/3149.3152},
doi = {10.1145/3149.3152},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SmithS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/StaplesN85,
author = {John Staples and
V. L. Nguyen},
title = {A Fixpoint Semantics for Nondeterministic Data Flow},
journal = {J. {ACM}},
volume = {32},
number = {2},
pages = {411--444},
year = {1985},
url = {https://doi.org/10.1145/3149.3155},
doi = {10.1145/3149.3155},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/StaplesN85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/TantawiT85,
author = {Asser N. Tantawi and
Donald F. Towsley},
title = {Optimal Static Load Balancing in Distributed Computer Systems},
journal = {J. {ACM}},
volume = {32},
number = {2},
pages = {445--465},
year = {1985},
url = {https://doi.org/10.1145/3149.3156},
doi = {10.1145/3149.3156},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/TantawiT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/TaySG85,
author = {Y. C. Tay and
Rajan Suri and
Nathan Goodman},
title = {A Mean Value Performance Model for Locking in Databases: The No-Waiting
Case},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {618--651},
year = {1985},
url = {https://doi.org/10.1145/3828.3831},
doi = {10.1145/3828.3831},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/TaySG85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vantilborgh85,
author = {Hendrik Vantilborgh},
title = {Aggregation with an Error of O(epsilon\({}^{\mbox{2}}\))},
journal = {J. {ACM}},
volume = {32},
number = {1},
pages = {162--190},
year = {1985},
url = {https://doi.org/10.1145/2455.214107},
doi = {10.1145/2455.214107},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vantilborgh85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/WangLS85,
author = {Ching{-}Chy Wang and
Errol L. Lloyd and
Mary Lou Soffa},
title = {Feedback Vertex Sets and Cyclically Reducible Graphs},
journal = {J. {ACM}},
volume = {32},
number = {2},
pages = {296--313},
year = {1985},
url = {https://doi.org/10.1145/3149.3159},
doi = {10.1145/3149.3159},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/WangLS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/WillardL85,
author = {Dan E. Willard and
George S. Lueker},
title = {Adding Range Restriction Capability to Dynamic Data Structures},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {597--617},
year = {1985},
url = {https://doi.org/10.1145/3828.3839},
doi = {10.1145/3828.3839},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/WillardL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yannakakis85,
author = {Mihalis Yannakakis},
title = {A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {950--988},
year = {1985},
url = {https://doi.org/10.1145/4221.4228},
doi = {10.1145/4221.4228},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Yannakakis85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yao85,
author = {Andrew Chi{-}Chih Yao},
title = {Uniform Hashing Is Optimal},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {687--693},
year = {1985},
url = {https://doi.org/10.1145/3828.3836},
doi = {10.1145/3828.3836},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Yao85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Zerling85,
author = {David Zerling},
title = {Generating Binary Trees Using Rotations},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {694--701},
year = {1985},
url = {https://doi.org/10.1145/3828.214141},
doi = {10.1145/3828.214141},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Zerling85.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 18:19 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:
