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/tcs158.bht:"
download as .bib file
@article{DBLP:journals/tcs/AgrawalA96,
author = {Manindra Agrawal and
Vikraman Arvind},
title = {Geometric Sets of Low Information Content},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {193--219},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00073-9},
doi = {10.1016/0304-3975(95)00073-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AgrawalA96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AgrawalA96a,
author = {Manindra Agrawal and
Vikraman Arvind},
title = {Quasi-Linear Truth-Table Reductions to p-Selective Sets},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {361--370},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00167-0},
doi = {10.1016/0304-3975(95)00167-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AgrawalA96a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Breslauer96,
author = {Dany Breslauer},
title = {Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {177--192},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00068-2},
doi = {10.1016/0304-3975(95)00068-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Breslauer96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Burckel96,
author = {Serge Burckel},
title = {Closed Iterative Calculus},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {371--378},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00171-9},
doi = {10.1016/0304-3975(95)00171-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Burckel96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DemangeP96,
author = {Marc Demange and
Vangelis Th. Paschos},
title = {On an Approximation Measure Founded on the Links Between Optimization
and Polynomial Approximation Theory},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {117--141},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00060-7},
doi = {10.1016/0304-3975(95)00060-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DemangeP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Fabre96,
author = {St{\'{e}}phane Fabre},
title = {D{\'{e}}pendance de syst{\`{e}}mes de num{\'{e}}ration associ{\'{e}}s
{\`{a}} des puissances d'un nombre de Pisot},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {65--79},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00042-9},
doi = {10.1016/0304-3975(95)00042-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Fabre96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FerreiraG96,
author = {Afonso Ferreira and
Miltos D. Grammatikakis},
title = {Randomized Routing on Generalized Hypercubes},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {53--64},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00041-0},
doi = {10.1016/0304-3975(95)00041-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FerreiraG96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GabarroMM96,
author = {Joaquim Gabarr{\'{o}} and
Conrado Martinez and
Xavier Messeguer},
title = {A Design of a Parallel Dictionary Using Skip Lists},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {1--33},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(94)00288-6},
doi = {10.1016/0304-3975(94)00288-6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GabarroMM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HirshfeldJM96,
author = {Yoram Hirshfeld and
Mark Jerrum and
Faron Moller},
title = {A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free
Processes},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {143--159},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00064-X},
doi = {10.1016/0304-3975(95)00064-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HirshfeldJM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Jonoska96,
author = {Natasa Jonoska},
title = {Sofic Shifts with Synchronizing Presentations},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {81--115},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(96)00058-8},
doi = {10.1016/0304-3975(96)00058-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Jonoska96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Koskas96,
author = {Michel Koskas},
title = {About the p-Paperfolding Words},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {35--51},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00008-9},
doi = {10.1016/0304-3975(95)00008-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Koskas96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Mocas96,
author = {Sarah Mocas},
title = {Separating Classes in the Exponential-Time Hierarchy From Classes
in {PH}},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {221--231},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00078-X},
doi = {10.1016/0304-3975(95)00078-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Mocas96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NishidaS96,
author = {Taishin Y. Nishida and
Arto Salomaa},
title = {Slender 0L Languages},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {161--176},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00067-4},
doi = {10.1016/0304-3975(95)00067-4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/NishidaS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RamalingamR96,
author = {G. Ramalingam and
Thomas W. Reps},
title = {On the Computational Complexity of Dynamic Graph Problems},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {233--277},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00079-8},
doi = {10.1016/0304-3975(95)00079-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RamalingamR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Takahashi96a,
author = {Yoshikane Takahashi},
title = {Solving Optimization Problems with Variable-Constraint by an Extended
Cohen-Grossberg Model},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {279--341},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00085-2},
doi = {10.1016/0304-3975(95)00085-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Takahashi96a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZwickP96,
author = {Uri Zwick and
Mike Paterson},
title = {The Complexity of Mean Payoff Games on Graphs},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {343--359},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00188-3},
doi = {10.1016/0304-3975(95)00188-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZwickP96.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-05-18 23:18 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:
