Search dblp for Publications

export results for "toc:db/journals/jal/jal23.bht:"

 download as .bib file

@article{DBLP:journals/jal/AroyaNS97,
  author       = {Ishai Ben{-}Aroya and
                  Ilan Newman and
                  Assaf Schuster},
  title        = {Randomized Single-Target Hot-Potato Routing},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {1},
  pages        = {101--120},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0811},
  doi          = {10.1006/JAGM.1996.0811},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/AroyaNS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BartalR97,
  author       = {Yair Bartal and
                  Adi Ros{\'{e}}n},
  title        = {The Distributed k-Server Problem - {A} Competitive Distributed Translator
                  for k-Server Algorithms},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {241--264},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0826},
  doi          = {10.1006/JAGM.1996.0826},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BartalR97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BradfordFS97,
  author       = {Phillip G. Bradford and
                  Rudolf Fleischer and
                  Michiel H. M. Smid},
  title        = {More Efficient Parallel Totally Monotone Matrix Searching},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {386--400},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0824},
  doi          = {10.1006/JAGM.1996.0824},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BradfordFS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BrinkmannD97,
  author       = {Gunnar Brinkmann and
                  Andreas W. M. Dress},
  title        = {A Constructive Enumeration of Fullerenes},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {345--358},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0806},
  doi          = {10.1006/JAGM.1996.0806},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BrinkmannD97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/CzumajGPR97,
  author       = {Artur Czumaj and
                  Leszek Gasieniec and
                  Marek Piotr{\'{o}}w and
                  Wojciech Rytter},
  title        = {Sequential and Parallel Approximation of Shortest Superstrings},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {1},
  pages        = {74--100},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0823},
  doi          = {10.1006/JAGM.1996.0823},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/CzumajGPR97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Eppstein97,
  author       = {David Eppstein},
  title        = {Minimum Range Balanced Cuts via Dynamic Subset Sums},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {375--385},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0841},
  doi          = {10.1006/JAGM.1996.0841},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Eppstein97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/GarayGKMY97,
  author       = {Juan A. Garay and
                  Inder S. Gopal and
                  Shay Kutten and
                  Yishay Mansour and
                  Moti Yung},
  title        = {Efficient On-Line Call Control Algorithms},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {1},
  pages        = {180--194},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0821},
  doi          = {10.1006/JAGM.1996.0821},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/GarayGKMY97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/GoodrichT97,
  author       = {Michael T. Goodrich and
                  Roberto Tamassia},
  title        = {Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via
                  Balanced Geodesic Triangulations},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {1},
  pages        = {51--73},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1995.0797},
  doi          = {10.1006/JAGM.1995.0797},
  timestamp    = {Fri, 13 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/GoodrichT97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Halldorsson97,
  author       = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {Parallel and On-Line Graph Coloring},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {265--280},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0836},
  doi          = {10.1006/JAGM.1996.0836},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/Halldorsson97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/HighamKAA97,
  author       = {Lisa Higham and
                  David G. Kirkpatrick and
                  Karl R. Abrahamson and
                  Andrew Adler},
  title        = {Optimal Algorithms for Probabilistic Solitude Detection on Anonymous
                  Rings},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {291--328},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0828},
  doi          = {10.1006/JAGM.1996.0828},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/HighamKAA97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Khuller97,
  author       = {Samir Khuller},
  title        = {Problems},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {401--403},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1997.0847},
  doi          = {10.1006/JAGM.1997.0847},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Khuller97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/KranakisK97,
  author       = {Evangelos Kranakis and
                  Danny Krizanc},
  title        = {Distributed Computing on Anonymous Hypercube Networks},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {1},
  pages        = {32--50},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0817},
  doi          = {10.1006/JAGM.1996.0817},
  timestamp    = {Fri, 13 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/KranakisK97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/LoeblN97,
  author       = {Martin Loebl and
                  Jaroslav Nesetril},
  title        = {Linearity and Unprovability of Set Union Problem Strategies. I. Linearity
                  of Strong Postorder},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {207--220},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0815},
  doi          = {10.1006/JAGM.1996.0815},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/LoeblN97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/PittelW97,
  author       = {Boris G. Pittel and
                  Robert S. Weishaar},
  title        = {On-Line Coloring of Sparse Random Graphs and Random Trees},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {1},
  pages        = {195--205},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0827},
  doi          = {10.1006/JAGM.1996.0827},
  timestamp    = {Fri, 26 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/PittelW97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/PlaxtonS97,
  author       = {C. Greg Plaxton and
                  Torsten Suel},
  title        = {Lower Bounds for Shellsort},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {221--240},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0825},
  doi          = {10.1006/JAGM.1996.0825},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/PlaxtonS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Ramachandran97,
  author       = {Vijaya Ramachandran},
  title        = {Parallel Algorithms for Reducible Flow Graphs},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {1},
  pages        = {1--31},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0820},
  doi          = {10.1006/JAGM.1996.0820},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Ramachandran97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/ShiouraU97,
  author       = {Akiyoshi Shioura and
                  Takeaki Uno},
  title        = {A Linear Time Algorithm for Finding a k-Tree Core},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {281--290},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0838},
  doi          = {10.1006/JAGM.1996.0838},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/ShiouraU97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Thorup97,
  author       = {Mikkel Thorup},
  title        = {Parallel Shortcutting of Rooted Trees},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {1},
  pages        = {139--159},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0829},
  doi          = {10.1006/JAGM.1996.0829},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Thorup97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Thurimella97,
  author       = {Ramakrishna Thurimella},
  title        = {Sub-Linear Distributed Algorithms for Sparse Certificates and Biconnected
                  Components},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {1},
  pages        = {160--179},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0832},
  doi          = {10.1006/JAGM.1996.0832},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Thurimella97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Wang97,
  author       = {Biing{-}Feng Wang},
  title        = {Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {329--344},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0839},
  doi          = {10.1006/JAGM.1996.0839},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Wang97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Weihe97,
  author       = {Karsten Weihe},
  title        = {Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {1},
  pages        = {121--138},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0831},
  doi          = {10.1006/JAGM.1996.0831},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Weihe97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/ZhouSN97,
  author       = {Xiao Zhou and
                  Hitoshi Suzuki and
                  Takao Nishizeki},
  title        = {An {NC} Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs},
  journal      = {J. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {359--374},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0830},
  doi          = {10.1006/JAGM.1996.0830},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/ZhouSN97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.