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/tcs300.bht:"
download as .bib file
@article{DBLP:journals/tcs/AcetoBBL03,
author = {Luca Aceto and
Patricia Bouyer and
Augusto Burgue{\~{n}}o and
Kim Guldstrand Larsen},
title = {The power of reachability testing for timed automata},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {411--475},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00334-1},
doi = {10.1016/S0304-3975(02)00334-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AcetoBBL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AczelAMV03,
author = {Peter Aczel and
Jir{\'{\i}} Ad{\'{a}}mek and
Stefan Milius and
Jir{\'{\i}} Velebil},
title = {Infinite trees and completely iterative theories: a coalgebraic view},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {1--45},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00728-4},
doi = {10.1016/S0304-3975(02)00728-4},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AczelAMV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AyariBK03,
author = {Abdelwaheb Ayari and
David A. Basin and
Felix Klaedtke},
title = {Decision procedures for inductive Boolean functions based on alternating
automata},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {301--329},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00089-0},
doi = {10.1016/S0304-3975(02)00089-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AyariBK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Carlucci03,
author = {Lorenzo Carlucci},
title = {A new proof-theoretic proof of the independence of Kirby-Paris' Hydra
Theorem},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {365--378},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00332-8},
doi = {10.1016/S0304-3975(02)00332-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Carlucci03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CattaniW03,
author = {Gian Luca Cattani and
Glynn Winskel},
title = {Presheaf models for CCS-like languages},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {47--89},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(01)00209-2},
doi = {10.1016/S0304-3975(01)00209-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CattaniW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/David03,
author = {Ren{\'{e}} David},
title = {Decidability results for primitive recursive algorithms},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {477--504},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00732-6},
doi = {10.1016/S0304-3975(02)00732-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/David03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Demri03,
author = {St{\'{e}}phane Demri},
title = {A polynomial space construction of tree-like models for logics with
local chains of modal connectives},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {235--258},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00082-8},
doi = {10.1016/S0304-3975(02)00082-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Demri03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DevillersKR03,
author = {Raymond R. Devillers and
Hanna Klaudel and
Robert{-}C. Riemann},
title = {General parameterised refinement and recursion for the M-net calculus},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {259--300},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00088-9},
doi = {10.1016/S0304-3975(02)00088-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DevillersKR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FinkelsteinFL03,
author = {Stacy E. Finkelstein and
Peter J. Freyd and
James Lipton},
title = {A new framework for declarative programming},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {91--160},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(01)00308-5},
doi = {10.1016/S0304-3975(01)00308-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FinkelsteinFL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GordonJ03,
author = {Andrew D. Gordon and
Alan Jeffrey},
title = {Typing correspondence assertions for communication protocols},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {379--409},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00333-X},
doi = {10.1016/S0304-3975(02)00333-X},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GordonJ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MohamedSC03,
author = {Otmane A{\"{\i}}t Mohamed and
Xiaoyu Song and
Eduard Cerny},
title = {On the non-termination of M-based abstract state enumeration},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {161--179},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(01)00345-0},
doi = {10.1016/S0304-3975(01)00345-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MohamedSC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rabinovich03,
author = {Alexander Moshe Rabinovich},
title = {Automata over continuous time},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {331--363},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00331-6},
doi = {10.1016/S0304-3975(02)00331-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rabinovich03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Vagvolgyi03b,
author = {S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi},
title = {Intersection of finitely generated congruences over term algebra},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {209--234},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00080-4},
doi = {10.1016/S0304-3975(02)00080-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Vagvolgyi03b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Wabenhorst03,
author = {Axel Wabenhorst},
title = {Induction in the Timed Interval Calculus},
journal = {Theor. Comput. Sci.},
volume = {300},
number = {1-3},
pages = {181--207},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(01)00378-4},
doi = {10.1016/S0304-3975(01)00378-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Wabenhorst03.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-31 01:09 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:
