Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jal/AmirAL97,
  author       = {Amihood Amir and
                  Alberto Apostolico and
                  Moshe Lewenstein},
  title        = {Inverse Pattern Matching},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {2},
  pages        = {325--339},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0850},
  doi          = {10.1006/JAGM.1996.0850},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/AmirAL97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/AmirBF97,
  author       = {Amihood Amir and
                  Gary Benson and
                  Martin Farach},
  title        = {Optimal Two-Dimensional Compressed Matching},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {2},
  pages        = {354--379},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1997.0860},
  doi          = {10.1006/JAGM.1997.0860},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/AmirBF97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BalasubramanianRS97,
  author       = {R. Balasubramanian and
                  Venkatesh Raman and
                  G. Srinivasaragavan},
  title        = {Finding Scores in Tournaments},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {2},
  pages        = {380--394},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1997.0865},
  doi          = {10.1006/JAGM.1997.0865},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BalasubramanianRS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BodlaenderE97,
  author       = {Hans L. Bodlaender and
                  Joost Engelfriet},
  title        = {Domino Treewidth},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {1},
  pages        = {94--123},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0854},
  doi          = {10.1006/JAGM.1996.0854},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BodlaenderE97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BreslauerJJ97,
  author       = {Dany Breslauer and
                  Tao Jiang and
                  Zhigen Jiang},
  title        = {Rotations of Periodic Strings and Short Superstrings},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {2},
  pages        = {340--353},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1997.0861},
  doi          = {10.1006/JAGM.1997.0861},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BreslauerJJ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BroderM97,
  author       = {Andrei Z. Broder and
                  Ernst W. Mayr},
  title        = {Counting Minimum Weight Spanning Trees},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {1},
  pages        = {171--176},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0851},
  doi          = {10.1006/JAGM.1996.0851},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BroderM97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/ChrobakLRW97,
  author       = {Marek Chrobak and
                  Lawrence L. Larmore and
                  Nick Reingold and
                  Jeffery R. Westbrook},
  title        = {Page Migration Algorithms Using Work Functions},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {1},
  pages        = {124--157},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0853},
  doi          = {10.1006/JAGM.1996.0853},
  timestamp    = {Fri, 13 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/ChrobakLRW97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/DubiosB97,
  author       = {O. Dubios and
                  Yacine Boufkhad},
  title        = {A General Upper Bound for the Satisfiability Threshold of Random r-SAT
                  Formulae},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {2},
  pages        = {395--420},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1997.0867},
  doi          = {10.1006/JAGM.1997.0867},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/DubiosB97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/EppsteinH97,
  author       = {David Eppstein and
                  Daniel S. Hirschberg},
  title        = {Choosing Subsets with Maximum Weighted Average},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {1},
  pages        = {177--193},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0849},
  doi          = {10.1006/JAGM.1996.0849},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/EppsteinH97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/EvenLW97,
  author       = {Shimon Even and
                  Ami Litman and
                  Peter Winkler},
  title        = {Computing with Snakes in Directed Networks of Automata},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {1},
  pages        = {158--170},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0840},
  doi          = {10.1006/JAGM.1996.0840},
  timestamp    = {Mon, 23 Oct 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/EvenLW97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/FeketeKKRY97,
  author       = {S{\'{a}}ndor P. Fekete and
                  Samir Khuller and
                  Monika Klemmstein and
                  Balaji Raghavachari and
                  Neal E. Young},
  title        = {A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning
                  Trees},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {2},
  pages        = {310--324},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1997.0862},
  doi          = {10.1006/JAGM.1997.0862},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/FeketeKKRY97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/FingerhutST97,
  author       = {J. Andrew Fingerhut and
                  Subhash Suri and
                  Jonathan S. Turner},
  title        = {Designing Least-Cost Nonblocking Broadband Networks},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {2},
  pages        = {287--309},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1997.0866},
  doi          = {10.1006/JAGM.1997.0866},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/FingerhutST97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Frederickson97,
  author       = {Greg N. Frederickson},
  title        = {A Data Structure for Dynamically Maintaining Rooted Trees},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {1},
  pages        = {37--65},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0835},
  doi          = {10.1006/JAGM.1996.0835},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Frederickson97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/GiancarloG97,
  author       = {Raffaele Giancarlo and
                  Roberto Grossi},
  title        = {Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data
                  Structures and Optimal On-Line Search Algorithms},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {2},
  pages        = {223--265},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0844},
  doi          = {10.1006/JAGM.1996.0844},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/GiancarloG97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Guttmann-BeckH97,
  author       = {Nili Guttmann{-}Beck and
                  Refael Hassin},
  title        = {Approximation Algorithms for Min-Max Tree Partition},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {2},
  pages        = {266--286},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0848},
  doi          = {10.1006/JAGM.1996.0848},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Guttmann-BeckH97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Haldar97,
  author       = {S. Haldar},
  title        = {An 'All Pairs Shortest Paths' Distributed Algorithm Using 2n{\({^2}\)}
                  Messages},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {1},
  pages        = {20--36},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0842},
  doi          = {10.1006/JAGM.1996.0842},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Haldar97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/HambruschT97,
  author       = {Susanne E. Hambrusch and
                  Hung{-}Yi Tu},
  title        = {Edge Weight Reduction Problems in Directed Acyclic Graphs},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {1},
  pages        = {66--93},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1997.0856},
  doi          = {10.1006/JAGM.1997.0856},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/HambruschT97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Henzinger97,
  author       = {Monika Rauch Henzinger},
  title        = {A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental
                  Approximation Algorithms for Edge and Vertex Connectivity},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {1},
  pages        = {194--220},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1997.0855},
  doi          = {10.1006/JAGM.1997.0855},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Henzinger97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/MoranT97,
  author       = {Shlomo Moran and
                  Gadi Taubenfeld},
  title        = {A Lower Bound on Wait-Free Counting},
  journal      = {J. Algorithms},
  volume       = {24},
  number       = {1},
  pages        = {1--19},
  year         = {1997},
  url          = {https://doi.org/10.1006/jagm.1996.0837},
  doi          = {10.1006/JAGM.1996.0837},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/MoranT97.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.