default search action
Search dblp for Publications
export results for "toc:db/journals/dmtcs/dmtcs4.bht:"
@article{DBLP:journals/dmtcs/Bernasconi01, author = {Anna Bernasconi}, title = {On a hierarchy of Boolean functions hard to compute in constant depth}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {79--90}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.283}, doi = {10.46298/DMTCS.283}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/Bernasconi01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/Curtin01, author = {Eugene Curtin}, title = {Cubic Cayley graphs with small diameter}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {123--132}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.285}, doi = {10.46298/DMTCS.285}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/Curtin01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/FongS01, author = {Jessica H. Fong and Martin Strauss}, title = {An Approximate Lp Difference Algorithm for Massive Data Streams}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {301--322}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.290}, doi = {10.46298/DMTCS.290}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/FongS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/Frid01, author = {Anna E. Frid}, title = {Overlap-free symmetric {D0L} words}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {357--362}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.293}, doi = {10.46298/DMTCS.293}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/Frid01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/GrassbergerH01, author = {Johannes Grassberger and G{\"{u}}nther H{\"{o}}rmann}, title = {A note on representations of the finite Heisenberg group and sums of greatest common divisors}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {91--100}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.284}, doi = {10.46298/DMTCS.284}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/GrassbergerH01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/Grolmusz01, author = {Vince Grolmusz}, title = {A Degree-Decreasing Lemma for {(MOD} q - {MOD} p) Circuits}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {247--254}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.289}, doi = {10.46298/DMTCS.289}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/Grolmusz01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/Grun01, author = {Gabrielle Assunta Gr{\"{u}}n}, title = {An Efficient Algorithm for the Maximum Distance Problem}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {323--350}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.291}, doi = {10.46298/DMTCS.291}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/Grun01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/HabibPV01, author = {Michel Habib and Christophe Paul and Laurent Viennot}, title = {Linear time recognition of P4-indifference graphs}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {173--178}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.269}, doi = {10.46298/DMTCS.269}, timestamp = {Fri, 07 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmtcs/HabibPV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/HoangL01, author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and Van Bang Le}, title = {P4-Colorings and P4-Bipartite Graphs}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {109--122}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.272}, doi = {10.46298/DMTCS.272}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/HoangL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/Koiran01, author = {Pascal Koiran}, title = {The topological entropy of iterated piecewise affine maps is uncomputable}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {351--356}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.292}, doi = {10.46298/DMTCS.292}, timestamp = {Fri, 07 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmtcs/Koiran01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/KrummeF01, author = {David W. Krumme and Paraskevi Fragopoulou}, title = {Minimum Eccentricity Multicast Trees}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {157--172}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.278}, doi = {10.46298/DMTCS.278}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/KrummeF01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/MagoniP01, author = {Damien Magoni and Jean{-}Jacques Pansiot}, title = {Oriented multicast routing algorithm applied to network-level agent search}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {255--272}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.268}, doi = {10.46298/DMTCS.268}, timestamp = {Tue, 31 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/MagoniP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/MantaciR01, author = {Roberto Mantaci and Fanja Rakotondrajao}, title = {A permutations representation that knows what "Eulerian" means}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {101--108}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.271}, doi = {10.46298/DMTCS.271}, timestamp = {Tue, 31 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/MantaciR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/Manuch01, author = {J{\'{a}}n Manuch}, title = {Defect Effect of Bi-infinite Words in the Two-element Case}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {273--290}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.279}, doi = {10.46298/DMTCS.279}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/Manuch01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/MenakermanR01, author = {Nir Menakerman and Raphael Rom}, title = {Analysis of Transmissions Scheduling with Packet Fragmentation}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {139--156}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.277}, doi = {10.46298/DMTCS.277}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/MenakermanR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/Moss01, author = {Lawrence S. Moss}, title = {Simple Equational Specifications of Rational Arithmetic}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {291--300}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.280}, doi = {10.46298/DMTCS.280}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/Moss01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/MullerNT01, author = {Martin M{\"{u}}ller and Joachim Niehren and Ralf Treinen}, title = {The first-order theory of ordering constraints over feature trees}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {193--234}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.267}, doi = {10.46298/DMTCS.267}, timestamp = {Tue, 11 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmtcs/MullerNT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/PeichlV01, author = {Timo Peichl and Heribert Vollmer}, title = {Finite Automata with Generalized Acceptance Criteria}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {179--192}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.287}, doi = {10.46298/DMTCS.287}, timestamp = {Tue, 31 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/PeichlV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/RandazzoLM01, author = {C. D. Randazzo and Henrique Pacca Loureiro Luna and P. Mahey}, title = {Benders decomposition for local access network design with two technologies}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {235--246}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.288}, doi = {10.46298/DMTCS.288}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/RandazzoLM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/Schachinger01, author = {Werner Schachinger}, title = {Asymptotic normality of recursive algorithms via martingale difference arrays}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {363--398}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.281}, doi = {10.46298/DMTCS.281}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/Schachinger01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/Subramanian01, author = {C. R. Subramanian}, title = {Paths of specified length in random k-partite graphs}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {2}, pages = {133--138}, year = {2001}, url = {https://doi.org/10.46298/dmtcs.286}, doi = {10.46298/DMTCS.286}, timestamp = {Tue, 14 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/Subramanian01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/AlloucheS00, author = {Jean{-}Paul Allouche and Jeffrey O. Shallit}, title = {Sums of Digits, Overlaps, and Palindromes}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {1}, pages = {1--10}, year = {2000}, url = {https://doi.org/10.46298/dmtcs.282}, doi = {10.46298/DMTCS.282}, timestamp = {Fri, 07 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmtcs/AlloucheS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/BarcucciLPP00, author = {Elena Barcucci and Alberto Del Lungo and Elisa Pergola and Renzo Pinzani}, title = {Permutations avoiding an increasing number of length-increasing forbidden subsequences}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {1}, pages = {31--44}, year = {2000}, url = {https://doi.org/10.46298/dmtcs.273}, doi = {10.46298/DMTCS.273}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/BarcucciLPP00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/Boudet00, author = {Alexandre Boudet}, title = {Unification of Higher-order Patterns modulo Simple Syntactic Equational Theories}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {1}, pages = {11--30}, year = {2000}, url = {https://doi.org/10.46298/dmtcs.270}, doi = {10.46298/DMTCS.270}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/Boudet00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/Dohmen00, author = {Klaus Dohmen}, title = {Improved inclusion-exclusion identities via closure operators}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {1}, pages = {61--66}, year = {2000}, url = {https://doi.org/10.46298/dmtcs.275}, doi = {10.46298/DMTCS.275}, timestamp = {Tue, 31 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/Dohmen00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/MansourV00, author = {Toufik Mansour and Alek Vainshtein}, title = {Avoiding maximal parabolic subgroups of S\({}_{\mbox{k}}\)}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {1}, pages = {81--90}, year = {2000}, url = {https://doi.org/10.46298/dmtcs.276}, doi = {10.46298/DMTCS.276}, timestamp = {Fri, 07 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmtcs/MansourV00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/McConnellS00, author = {Ross M. McConnell and Jeremy P. Spinrad}, title = {Ordered Vertex Partitioning}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {4}, number = {1}, pages = {45--60}, year = {2000}, url = {https://doi.org/10.46298/dmtcs.274}, doi = {10.46298/DMTCS.274}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/McConnellS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.