Search dblp for Publications

export results for "toc:db/journals/tcs/tcs321.bht:"

 download as .bib file

@article{DBLP:journals/tcs/AlbertGHLRS04,
  author       = {Michael H. Albert and
                  Alexander Golynski and
                  Ang{\`{e}}le M. Hamel and
                  Alejandro L{\'{o}}pez{-}Ortiz and
                  S. Srinivasa Rao and
                  Mohammad Ali Safari},
  title        = {Longest increasing subsequences in sliding windows},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {405--414},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.03.057},
  doi          = {10.1016/J.TCS.2004.03.057},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AlbertGHLRS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BenderF04,
  author       = {Michael A. Bender and
                  Martin Farach{-}Colton},
  title        = {The Level Ancestor Problem simplified},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {1},
  pages        = {5--12},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2003.05.002},
  doi          = {10.1016/J.TCS.2003.05.002},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BenderF04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BornsteinV04,
  author       = {Claudson F. Bornstein and
                  Santosh S. Vempala},
  title        = {Flow metrics},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {1},
  pages        = {13--24},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2003.05.003},
  doi          = {10.1016/J.TCS.2003.05.003},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BornsteinV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BouyerDFP04,
  author       = {Patricia Bouyer and
                  Catherine Dufourd and
                  Emmanuel Fleury and
                  Antoine Petit},
  title        = {Updatable timed automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {291--345},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.04.003},
  doi          = {10.1016/J.TCS.2004.04.003},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BouyerDFP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BronnimannIKMMT04,
  author       = {Herv{\'{e}} Br{\"{o}}nnimann and
                  John Iacono and
                  Jyrki Katajainen and
                  Pat Morin and
                  Jason Morrison and
                  Godfried T. Toussaint},
  title        = {Space-efficient planar convex hull algorithms},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {1},
  pages        = {25--40},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2003.05.004},
  doi          = {10.1016/J.TCS.2003.05.004},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BronnimannIKMMT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CarmoDKL04,
  author       = {Renato Carmo and
                  Jair Donadelli and
                  Yoshiharu Kohayakawa and
                  Eduardo Sany Laber},
  title        = {Searching in random partially ordered sets},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {1},
  pages        = {41--57},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2003.06.001},
  doi          = {10.1016/J.TCS.2003.06.001},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CarmoDKL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CavaliereL04,
  author       = {Matteo Cavaliere and
                  Peter Leupold},
  title        = {Evolution and observation--a non-standard way to generate formal languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {233--248},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.03.036},
  doi          = {10.1016/J.TCS.2004.03.036},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CavaliereL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChiK04,
  author       = {Dong Pyo Chi and
                  DoYong Kwon},
  title        = {Sturmian words, beta-shifts, and transcendence},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {395--404},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.03.035},
  doi          = {10.1016/J.TCS.2004.03.035},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChiK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DowneyGR04,
  author       = {Rodney G. Downey and
                  Evan J. Griffiths and
                  Stephanie Reid},
  title        = {On Kurtz randomness},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {249--270},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.03.055},
  doi          = {10.1016/J.TCS.2004.03.055},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DowneyGR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EstebanGM04,
  author       = {Juan Luis Esteban and
                  Nicola Galesi and
                  Jochen Messner},
  title        = {On the complexity of resolution with bounded conjunctions},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {347--370},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.04.004},
  doi          = {10.1016/J.TCS.2004.04.004},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/EstebanGM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GarayR04,
  author       = {Juan A. Garay and
                  Sergio Rajsbaum},
  title        = {Preface},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {1},
  pages        = {1--3},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.02.027},
  doi          = {10.1016/J.TCS.2004.02.027},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GarayR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Garefalakis04,
  author       = {Theodoulos Garefalakis},
  title        = {The generalized Weil pairing and the discrete logarithm problem on
                  elliptic curves},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {1},
  pages        = {59--72},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2003.06.002},
  doi          = {10.1016/J.TCS.2003.06.002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Garefalakis04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HeviaK04,
  author       = {Alejandro Hevia and
                  Marcos A. Kiwi},
  title        = {Electronic jury voting protocols},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {1},
  pages        = {73--94},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2003.06.003},
  doi          = {10.1016/J.TCS.2003.06.003},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HeviaK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Holdsworth04,
  author       = {Jason J. Holdsworth},
  title        = {Graph traversal and graph transformation},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {215--231},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.03.034},
  doi          = {10.1016/J.TCS.2004.03.034},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Holdsworth04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Klazar04,
  author       = {Martin Klazar},
  title        = {On the least exponential growth admitting uncountably many closed
                  permutation classes},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {271--281},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.03.056},
  doi          = {10.1016/J.TCS.2004.03.056},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Klazar04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Li04,
  author       = {Keqin Li},
  title        = {Analysis of randomized load distribution for reproduction trees in
                  linear arrays and rings},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {195--214},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.03.033},
  doi          = {10.1016/J.TCS.2004.03.033},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Li04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MuthukrishnanS04,
  author       = {S. Muthukrishnan and
                  S{\"{u}}leyman Cenk Sahinalp},
  title        = {An efficient algorithm for sequence comparison with block reversals},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {1},
  pages        = {95--101},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2003.05.005},
  doi          = {10.1016/J.TCS.2003.05.005},
  timestamp    = {Fri, 07 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/MuthukrishnanS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/NavarroF04,
  author       = {Gonzalo Navarro and
                  Kimmo Fredriksson},
  title        = {Average complexity of exact and approximate multiple string matching},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {283--290},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.03.058},
  doi          = {10.1016/J.TCS.2004.03.058},
  timestamp    = {Wed, 28 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/NavarroF04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/NockN04,
  author       = {Richard Nock and
                  Frank Nielsen},
  title        = {On domain-partitioning induction criteria: worst-case bounds for the
                  worst-case based},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {371--382},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.05.004},
  doi          = {10.1016/J.TCS.2004.05.004},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/NockN04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ravikumar04,
  author       = {Bala Ravikumar},
  title        = {Peg-solitaire, string rewriting systems and finite automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {383--394},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.05.005},
  doi          = {10.1016/J.TCS.2004.05.005},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ravikumar04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/SalesM04,
  author       = {Cl{\'{a}}udia Linhares Sales and
                  Fr{\'{e}}d{\'{e}}ric Maffray},
  title        = {On dart-free perfectly contractile graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {171--194},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2003.11.026},
  doi          = {10.1016/J.TCS.2003.11.026},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/SalesM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ShachnaiT04,
  author       = {Hadas Shachnai and
                  Tami Tamir},
  title        = {Tight bounds for online class-constrained packing},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {1},
  pages        = {103--123},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2003.05.006},
  doi          = {10.1016/J.TCS.2003.05.006},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ShachnaiT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/StevensM04,
  author       = {Brett Stevens and
                  Eric Mendelsohn},
  title        = {Packing arrays},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {1},
  pages        = {125--148},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2003.06.004},
  doi          = {10.1016/J.TCS.2003.06.004},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/StevensM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/SzegedyC04,
  author       = {Mario Szegedy and
                  Xiaomin Chen},
  title        = {Computing Boolean functions from multiple faulty copies of input bits},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {1},
  pages        = {149--170},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2003.07.001},
  doi          = {10.1016/J.TCS.2003.07.001},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/SzegedyC04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Woginger04,
  author       = {Gerhard J. Woeginger},
  title        = {Seventeen lines and one-hundred-and-one points},
  journal      = {Theor. Comput. Sci.},
  volume       = {321},
  number       = {2-3},
  pages        = {415--421},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.tcs.2004.04.006},
  doi          = {10.1016/J.TCS.2004.04.006},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Woginger04.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.