Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/tcs/tcs237.bht:"
download as .bib file
@article{DBLP:journals/tcs/AlimontiK00,
author = {Paola Alimonti and
Viggo Kann},
title = {Some APX-completeness results for cubic graphs},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {123--134},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00158-3},
doi = {10.1016/S0304-3975(98)00158-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlimontiK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Anderson00,
author = {James A. Anderson},
title = {The intersection of retracts of A*},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {439--445},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00323-0},
doi = {10.1016/S0304-3975(99)00323-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Anderson00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ApostolicoB00,
author = {Alberto Apostolico and
Valentin E. Brimkov},
title = {Fibonacci arrays and their two-dimensional repetitions},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {263--273},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00182-0},
doi = {10.1016/S0304-3975(98)00182-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ApostolicoB00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Birget00,
author = {Jean{-}Camille Birget},
title = {Reductions and functors from problems to word problems},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {81--104},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00131-5},
doi = {10.1016/S0304-3975(98)00131-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Birget00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Cheng00,
author = {Siu{-}Wing Cheng},
title = {The Steiner tree problem for terminals on the boundary of a rectilinear
polygon},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {213--238},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00171-6},
doi = {10.1016/S0304-3975(98)00171-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Cheng00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Courcelle00,
author = {Bruno Courcelle},
title = {The monadic second-order logic of graphs {XII:} planar graphs and
planar maps},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {1--32},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00305-9},
doi = {10.1016/S0304-3975(99)00305-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Courcelle00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Geffert00,
author = {Viliam Geffert},
title = {A variant of inductive counting},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {465--475},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00338-2},
doi = {10.1016/S0304-3975(99)00338-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Geffert00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GeffertKP00,
author = {Viliam Geffert and
Jyrki Katajainen and
Tomi Pasanen},
title = {Asymptotically efficient in-place merging},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {159--181},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00162-5},
doi = {10.1016/S0304-3975(98)00162-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GeffertKP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/IwamaKT00,
author = {Kazuo Iwama and
Yahiko Kambayashi and
Kazuya Takaki},
title = {Tight bounds on the number of states of DFAs that are equivalent to
n-state NFAs},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {485--494},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00029-3},
doi = {10.1016/S0304-3975(00)00029-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/IwamaKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KimS00,
author = {Changwook Kim and
Ivan Hal Sudborough},
title = {Leftmove-bounded picture languages},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {183--195},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00164-9},
doi = {10.1016/S0304-3975(98)00164-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KimS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KurkaM00,
author = {Petr Kurka and
Alejandro Maass},
title = {Realtime subshifts},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {307--325},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00192-3},
doi = {10.1016/S0304-3975(98)00192-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KurkaM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Litow00,
author = {Bruce E. Litow},
title = {On Hadamard square roots of unity},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {447--454},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00327-8},
doi = {10.1016/S0304-3975(99)00327-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Litow00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LodayaW00,
author = {Kamal Lodaya and
Pascal Weil},
title = {Series-parallel languages and the bounded-width property},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {347--380},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00031-1},
doi = {10.1016/S0304-3975(00)00031-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LodayaW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Lokam00,
author = {Satyanarayana V. Lokam},
title = {On the rigidity of Vandermonde matrices},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {477--483},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00008-6},
doi = {10.1016/S0304-3975(00)00008-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Lokam00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MalvestutoM00,
author = {Francesco M. Malvestuto and
Marina Moscarini},
title = {Decomposition of a hypergraph by partial-edge separators},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {57--79},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00128-5},
doi = {10.1016/S0304-3975(98)00128-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MalvestutoM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Mandache00,
author = {Niculae Mandache},
title = {On the computational power of context-free {PC} grammar systems},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {135--148},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00159-5},
doi = {10.1016/S0304-3975(98)00159-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Mandache00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Meduna00,
author = {Alexander Meduna},
title = {Terminating left-hand sides of scattered context productions M. Nivat},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {423--427},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00292-3},
doi = {10.1016/S0304-3975(99)00292-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Meduna00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MooreC00,
author = {Cristopher Moore and
James P. Crutchfield},
title = {Quantum automata and quantum grammars},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {275--306},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00191-1},
doi = {10.1016/S0304-3975(98)00191-1},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MooreC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Navarro00,
author = {Gonzalo Navarro},
title = {Improved approximate pattern matching on hypertext},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {455--463},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00333-3},
doi = {10.1016/S0304-3975(99)00333-3},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Navarro00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Poon00,
author = {Chung Keung Poon},
title = {A space lower bound for st-connectivity on node-named JAGs},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {327--345},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00019-0},
doi = {10.1016/S0304-3975(00)00019-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Poon00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sarkar00,
author = {U. K. Sarkar},
title = {On the design of a constructive algorithm to solve the multi-peg towers
of Hanoi problem},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {407--421},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00020-7},
doi = {10.1016/S0304-3975(00)00020-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sarkar00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SchuurmanW00,
author = {Petra Schuurman and
Gerhard J. Woeginger},
title = {A polynomial time approximation scheme for the two-stage multiprocessor
flow shop problem},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {105--122},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00157-1},
doi = {10.1016/S0304-3975(98)00157-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SchuurmanW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Senellart00,
author = {Jean Senellart},
title = {Fast pattern matching in indexed texts},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {239--262},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00173-X},
doi = {10.1016/S0304-3975(98)00173-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Senellart00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SenguptaV00,
author = {Rimli Sengupta and
H. Venkateswaran},
title = {Non-cancellative Boolean circuits: {A} generalization of monotone
boolean circuits},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {197--212},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00170-4},
doi = {10.1016/S0304-3975(98)00170-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SenguptaV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SimonT00,
author = {Janos Simon and
Shi{-}Chun Tsai},
title = {On the bottleneck counting argument},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {429--437},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00321-7},
doi = {10.1016/S0304-3975(99)00321-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SimonT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TohyamaA00,
author = {Hiroaki Tohyama and
Akeo Adachi},
title = {Complexity of path discovery game problems},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {381--406},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00331-X},
doi = {10.1016/S0304-3975(99)00331-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TohyamaA00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WaltE00,
author = {Andries P. J. van der Walt and
Sigrid Ewert},
title = {A shrinking lemma for random forbidding context languages},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {149--158},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00160-1},
doi = {10.1016/S0304-3975(98)00160-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WaltE00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Wang00,
author = {Yongge Wang},
title = {Resource bounded randomness and computational complexity},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {33--55},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00119-4},
doi = {10.1016/S0304-3975(98)00119-4},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Wang00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-06-06 14:28 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
