Search dblp for Publications

export results for "toc:db/journals/algorithmica/algorithmica3.bht:"

 download as .bib file

@article{DBLP:journals/algorithmica/AfratiPP88,
  author       = {Foto N. Afrati and
                  Christos H. Papadimitriou and
                  George Papageorgiou},
  title        = {The Synthesis of Communication Protocols},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {451--472},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762126},
  doi          = {10.1007/BF01762126},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AfratiPP88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AggarwalCGOY88,
  author       = {Alok Aggarwal and
                  Bernard Chazelle and
                  Leonidas J. Guibas and
                  Colm {\'{O}}'D{\'{u}}nlaing and
                  Chee{-}Keng Yap},
  title        = {Parallel Computational Geometry},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {293--327},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762120},
  doi          = {10.1007/BF01762120},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AggarwalCGOY88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ApostolicoILSV88,
  author       = {Alberto Apostolico and
                  Costas S. Iliopoulos and
                  Gad M. Landau and
                  Baruch Schieber and
                  Uzi Vishkin},
  title        = {Parallel Construction of a Suffix Tree with Applications},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {347--365},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762122},
  doi          = {10.1007/BF01762122},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ApostolicoILSV88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AtallahG88,
  author       = {Mikhail J. Atallah and
                  Michael T. Goodrich},
  title        = {Parallel Algorithms for Some Functions of two Convex Polygons},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {535--548},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762130},
  doi          = {10.1007/BF01762130},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AtallahG88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bern88,
  author       = {Marshall W. Bern},
  title        = {Two Probabilistic Results on Rectilinear Steiner Trees},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {191--204},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762114},
  doi          = {10.1007/BF01762114},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Bern88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BhaskerS88,
  author       = {Jayaram Bhasker and
                  Sartaj Sahni},
  title        = {A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated
                  Graph},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {247--278},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762117},
  doi          = {10.1007/BF01762117},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BhaskerS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Chazelle88,
  author       = {Bernard Chazelle},
  title        = {An Algorithm for Segment-Dragging and Its Implementation},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {205--221},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762115},
  doi          = {10.1007/BF01762115},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Chazelle88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChoiH88,
  author       = {Hyeong{-}Ah Choi and
                  S. Louis Hakimi},
  title        = {Data Transfers in Networks},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {223--245},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762116},
  doi          = {10.1007/BF01762116},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChoiH88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ColeV88,
  author       = {Richard Cole and
                  Uzi Vishkin},
  title        = {The Accelerated Centroid Decomposition Technique for Optimal Parallel
                  Tree Evaluation in Logarithmic Time},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {329--346},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762121},
  doi          = {10.1007/BF01762121},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ColeV88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CzerwinskiR88,
  author       = {Paul Czerwinski and
                  Vijaya Ramachandran},
  title        = {Optimal {VLSI} Graph Embeddings in Variable Aspect Ratio Rectangles},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {487--510},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762128},
  doi          = {10.1007/BF01762128},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CzerwinskiR88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DobkinSW88,
  author       = {David P. Dobkin and
                  Diane L. Souvaine and
                  Christopher J. Van Wyk},
  title        = {Decomposition and Intersection of Simple Splinegons},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {473--485},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762127},
  doi          = {10.1007/BF01762127},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DobkinSW88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FellowsFL88,
  author       = {Michael R. Fellows and
                  Donald K. Friesen and
                  Michael A. Langston},
  title        = {On Finding Optimal and Near-Optimal Lineal Spanning Trees},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {549--560},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762131},
  doi          = {10.1007/BF01762131},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FellowsFL88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FichRW88,
  author       = {Faith E. Fich and
                  Prabhakar Ragde and
                  Avi Wigderson},
  title        = {Simulations Among Concurrent-Write PRAMs},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {43--51},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762109},
  doi          = {10.1007/BF01762109},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FichRW88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FredericksonJ88,
  author       = {Greg N. Frederickson and
                  Ravi Janardan},
  title        = {Designing Networks with Compact Routing Tables},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {171--190},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762113},
  doi          = {10.1007/BF01762113},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FredericksonJ88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KanellakisS88,
  author       = {Paris C. Kanellakis and
                  Scott A. Smolka},
  title        = {On the Analysis of Cooperation and Antagonism in Networks of Communicating
                  Processes},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {421--450},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762125},
  doi          = {10.1007/BF01762125},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KanellakisS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KarlinMRS88,
  author       = {Anna R. Karlin and
                  Mark S. Manasse and
                  Larry Rudolph and
                  Daniel Dominic Sleator},
  title        = {Competitive Snoopy Caching},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {77--119},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762111},
  doi          = {10.1007/BF01762111},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KarlinMRS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LadinLS88,
  author       = {Rivka Ladin and
                  Barbara Liskov and
                  Liuba Shrira},
  title        = {A Technique for Constructing Highly Available Services},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {393--420},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762124},
  doi          = {10.1007/BF01762124},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LadinLS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LeisersonM88,
  author       = {Charles E. Leiserson and
                  Bruce M. Maggs},
  title        = {Communication-Efficient Parallel Algorithms for Distributed Random-Access
                  Machines},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {53--77},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762110},
  doi          = {10.1007/BF01762110},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LeisersonM88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MarbergG88,
  author       = {John M. Marberg and
                  Eli Gafni},
  title        = {Sorting in Constant Number of Row and Column Phases on a Mesh},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {561--572},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762132},
  doi          = {10.1007/BF01762132},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MarbergG88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MosesT88,
  author       = {Yoram Moses and
                  Mark R. Tuttle},
  title        = {Programming Simultaneous Actions Using Common Knowledge},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {121--169},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762112},
  doi          = {10.1007/BF01762112},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MosesT88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MullenderV88,
  author       = {Sape J. Mullender and
                  Paul M. B. Vit{\'{a}}nyi},
  title        = {Distributed Match-Making},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {367--391},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762123},
  doi          = {10.1007/BF01762123},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MullenderV88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PetersonL88,
  author       = {Paul A. Peterson and
                  Michael C. Loui},
  title        = {The General Maximum Matching Algorithm of Micali and Vazirani},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {511--533},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762129},
  doi          = {10.1007/BF01762129},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/PetersonL88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/UllmanG88,
  author       = {Jeffrey D. Ullman and
                  Allen Van Gelder},
  title        = {Parallel Complexity of Logical Query Programs},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {5--42},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762108},
  doi          = {10.1007/BF01762108},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/UllmanG88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Vitter88,
  author       = {Jeffrey Scott Vitter},
  title        = {Editor's Foreword: Special Issue on Parallel and Distributed Computing,
                  Part {I}},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {1--3},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762107},
  doi          = {10.1007/BF01762107},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Vitter88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Vitter88a,
  author       = {Jeffrey Scott Vitter},
  title        = {Editor's Foreword: Special Issue on Parallel and Distributed Computing,
                  Part {II}},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {289--291},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762119},
  doi          = {10.1007/BF01762119},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Vitter88a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Yap88,
  author       = {Chee{-}Keng Yap},
  title        = {Parallel Triangulation of a Polygon in Two Cails to the Trapezoidal
                  Map},
  journal      = {Algorithmica},
  volume       = {3},
  pages        = {279--288},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF01762118},
  doi          = {10.1007/BF01762118},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Yap88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics