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/tcs164.bht:"
download as .bib file
@article{DBLP:journals/tcs/CarlssonCM96,
author = {Svante Carlsson and
Jingsen Chen and
Christer Mattsson},
title = {Heaps with Bits},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {1--12},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00152-2},
doi = {10.1016/0304-3975(95)00152-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CarlssonCM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaseJS96,
author = {John Case and
Sanjay Jain and
Arun Sharma},
title = {Anomalous Learning Helps Succinctness},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {13--28},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00154-9},
doi = {10.1016/0304-3975(95)00154-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaseJS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiksP96,
author = {Krzysztof Diks and
Andrzej Pelc},
title = {Reliable Computations on Faulty {EREW} {PRAM}},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {107--122},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00186-7},
doi = {10.1016/0304-3975(95)00186-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DiksP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Felice96,
author = {Clelia de Felice},
title = {An Application of Haj{\'{o}}s Factorizations to Variable-Length
Codes},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {223--252},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00223-5},
doi = {10.1016/0304-3975(95)00223-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Felice96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Fill96,
author = {James Allen Fill},
title = {Limits and Rates of Convergence for the Distribution of Search Cost
Under the Move-to-Front Rule},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {185--206},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00210-3},
doi = {10.1016/0304-3975(95)00210-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Fill96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FinkelT96,
author = {Alain Finkel and
Isabelle Tellier},
title = {A Polynomial Algorithm for the Membership Problem with Categorial
Grammars},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {207--221},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00211-1},
doi = {10.1016/0304-3975(95)00211-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FinkelT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GuptaN96,
author = {Arvind Gupta and
Naomi Nishimura},
title = {The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {287--298},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(96)00046-1},
doi = {10.1016/0304-3975(96)00046-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GuptaN96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Harrison96,
author = {John Harrison},
title = {On Almost Cylindrical Languages and the Decidability of the {D0L}
and {PWD0L} Primitivity Problems},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {29--40},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00168-9},
doi = {10.1016/0304-3975(95)00168-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Harrison96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hubert96,
author = {Pascal Hubert},
title = {Propri{\'{e}}t{\'{e}}s combinatoires des suites d{\'{e}}finies
par le billard dans les triangles pavants},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {165--183},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00208-1},
doi = {10.1016/0304-3975(95)00208-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Hubert96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/IliopoulosP96,
author = {Costas S. Iliopoulos and
Kunsoo Park},
title = {A Work-Time Optimal Algorithm for Computing All String Covers},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {299--310},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(96)00047-3},
doi = {10.1016/0304-3975(96)00047-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/IliopoulosP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LutzM96,
author = {Jack H. Lutz and
Elvira Mayordomo},
title = {Cook Versus Karp-Levin: Separating Completeness Notions if {NP} is
not Small},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {141--163},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00189-1},
doi = {10.1016/0304-3975(95)00189-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LutzM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Middendorf96,
author = {Martin Middendorf},
title = {Two-Dimensional Partitioning Problems},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {73--106},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00185-9},
doi = {10.1016/0304-3975(95)00185-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Middendorf96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Moews96,
author = {David Moews},
title = {Coin-Sliding and Go},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {253--276},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(96)00048-5},
doi = {10.1016/0304-3975(96)00048-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Moews96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Picouleau96,
author = {Christophe Picouleau},
title = {Worst-Case Analysis of Fast Heuristics for Packing Squares into a
Square},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {59--72},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00184-0},
doi = {10.1016/0304-3975(95)00184-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Picouleau96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SalomaaWY96,
author = {Kai Salomaa and
Derick Wood and
Sheng Yu},
title = {Structural Equivalence and {ET0L} Grammars},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {123--140},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00187-5},
doi = {10.1016/0304-3975(95)00187-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SalomaaWY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sirvent96,
author = {V{\'{\i}}ctor F. Sirvent},
title = {Relationships Between the Dynamical Systems Associated to the Rauzy
Substitutions},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {41--57},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00170-0},
doi = {10.1016/0304-3975(95)00170-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sirvent96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tomescu96,
author = {Ioan Tomescu},
title = {On the Asymptotic Average Length of a Maximum Common Subsequence for
Words Over a Finite Alphabet},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {277--285},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00259-6},
doi = {10.1016/0304-3975(95)00259-6},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Tomescu96.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-09-03 00:25 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:
