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/tcs74.bht:"
download as .bib file
@article{DBLP:journals/tcs/Anselmo90,
author = {Marcella Anselmo},
title = {Sur les Codes ZigZag et Leur D{\'{e}}cidabilit{\'{e}}},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {3},
pages = {341--354},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90083-T},
doi = {10.1016/0304-3975(90)90083-T},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Anselmo90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BabaiPRS90,
author = {L{\'{a}}szl{\'{o}} Babai and
Pavel Pudl{\'{a}}k and
Vojtech R{\"{o}}dl and
Endre Szemer{\'{e}}di},
title = {Lower Bounds to the Complexity of Symmetric Boolean Functions},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {3},
pages = {313--323},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90080-2},
doi = {10.1016/0304-3975(90)90080-2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BabaiPRS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bezem90,
author = {Marc Bezem},
title = {Completeness of Resolution Revisited},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {2},
pages = {227--237},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90139-9},
doi = {10.1016/0304-3975(90)90139-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bezem90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Diekert90,
author = {Volker Diekert},
title = {Word Problems Over Traces which are Solvable in Linear Time},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {1},
pages = {3--18},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90003-Z},
doi = {10.1016/0304-3975(90)90003-Z},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Diekert90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Fernandez-CamachoS90,
author = {Mar{\'{\i}}a{-}In{\'{e}}s Fern{\'{a}}ndez{-}Camacho and
Jean{-}Marc Steyaert},
title = {Algebraic Simplification in Computer Algebra: An Analysis of Bottom-up
Algorithms},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {3},
pages = {273--298},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90078-V},
doi = {10.1016/0304-3975(90)90078-V},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Fernandez-CamachoS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FussellT90,
author = {Donald S. Fussell and
Ramakrishna Thurimella},
title = {Successive Approximation in Parallel Graph Algorithms},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {1},
pages = {19--35},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90004-2},
doi = {10.1016/0304-3975(90)90004-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FussellT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Gastin90,
author = {Paul Gastin},
title = {Un Mod{\`{e}}le Asynchrone pour les Syst{\`{e}}mes Distribu{\'{e}}s},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {1},
pages = {121--162},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90134-4},
doi = {10.1016/0304-3975(90)90134-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Gastin90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Gavilanes-FrancoL90,
author = {Antonio Gavilanes{-}Franco and
Francisca Lucio{-}Carrasco},
title = {A First Order Logic for Partial Functions},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {1},
pages = {37--69},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90005-3},
doi = {10.1016/0304-3975(90)90005-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Gavilanes-FrancoL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GecsegJ90,
author = {Ferenc G{\'{e}}cseg and
Helmut J{\"{u}}rgensen},
title = {Automata Represented by Products of Soliton Automata},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {2},
pages = {163--181},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90135-5},
doi = {10.1016/0304-3975(90)90135-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GecsegJ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HartmanisH90,
author = {Juris Hartmanis and
Lane A. Hemachandra},
title = {Robust Machines Accept Easy Sets},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {2},
pages = {217--225},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90138-8},
doi = {10.1016/0304-3975(90)90138-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HartmanisH90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/He90,
author = {Xin He},
title = {An Efficient Algorithm for Edge Coloring Planar Graphs with Delta
Colors},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {3},
pages = {299--312},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90079-W},
doi = {10.1016/0304-3975(90)90079-W},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/He90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hertrampf90,
author = {Ulrich Hertrampf},
title = {Relations Among Mod-Classes},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {3},
pages = {325--328},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90081-R},
doi = {10.1016/0304-3975(90)90081-R},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Hertrampf90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Huttel90,
author = {Hans H{\"{u}}ttel},
title = {SnS Can be Modally Characterized},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {2},
pages = {239--248},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90140-D},
doi = {10.1016/0304-3975(90)90140-D},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Huttel90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Jancar90,
author = {Petr Jancar},
title = {Decidability of a Temporal Logic Problem for Petri Nets},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {1},
pages = {71--93},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90006-4},
doi = {10.1016/0304-3975(90)90006-4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Jancar90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kummer90,
author = {Martin Kummer},
title = {An Easy Priority-Free Proof of a Theorem of Friedberg},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {2},
pages = {249--251},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90141-4},
doi = {10.1016/0304-3975(90)90141-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kummer90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Okulicka90,
author = {Felicja Okulicka},
title = {On Priority in Cosy},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {2},
pages = {199--216},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90137-7},
doi = {10.1016/0304-3975(90)90137-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Okulicka90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OommenHM90,
author = {B. John Oommen and
E. R. Hansen and
J. Ian Munro},
title = {Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {2},
pages = {183--197},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90136-6},
doi = {10.1016/0304-3975(90)90136-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/OommenHM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PreparataT90,
author = {Franco P. Preparata and
Roberto Tamassia},
title = {Dynamic Planar Point Location with Optimal Query Time},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {1},
pages = {95--114},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90007-5},
doi = {10.1016/0304-3975(90)90007-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PreparataT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Romeuf90,
author = {Jean{-}Fran{\c{c}}ois Romeuf},
title = {A Polynomial Algorithm for Solving Systems of Two Linear Diophantine
Equations},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {3},
pages = {329--340},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90082-S},
doi = {10.1016/0304-3975(90)90082-S},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Romeuf90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Szepietowski90,
author = {Andrzej Szepietowski},
title = {If Deterministic and Nondeterministic Space Complexities are Equal
for \emph{log log n}, then they are also Equal for \emph{log n}},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {1},
pages = {115--119},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90008-6},
doi = {10.1016/0304-3975(90)90008-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Szepietowski90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Szymanski90,
author = {Jerzy Szymanski},
title = {On the Complexity of Algorithms on Recursive Trees},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {3},
pages = {355--361},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90084-U},
doi = {10.1016/0304-3975(90)90084-U},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Szymanski90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangYD90,
author = {Jingzhong Zhang and
Lu Yang and
Mike Deng},
title = {The Parallel Numerical Method of Mechanical Theorem Proving},
journal = {Theor. Comput. Sci.},
volume = {74},
number = {3},
pages = {253--271},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90077-U},
doi = {10.1016/0304-3975(90)90077-U},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhangYD90.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-24 23: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:
