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/tcs147.bht:"
download as .bib file
@article{DBLP:journals/tcs/AigrainB95,
author = {Philippe Aigrain and
Dani{\`{e}}le Beauquier},
title = {Polyomino Tilings, Cellular Automata and Codicity},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {165--180},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00201-S},
doi = {10.1016/0304-3975(94)00201-S},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AigrainB95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AmaldiK95,
author = {Edoardo Amaldi and
Viggo Kann},
title = {The Complexity and Approximability of Finding Maximum Feasible Subsystems
of Linear Relations},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {181--210},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00254-G},
doi = {10.1016/0304-3975(94)00254-G},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AmaldiK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ArquesG95,
author = {Didier Arqu{\`{e}}s and
Olivier Grange},
title = {A Fast Scan-Line Algorithm For Topological Filling Of Well-Nested
Objects in 2.5D Digital Pictures},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {211--248},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00137-8},
doi = {10.1016/0304-3975(94)00137-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ArquesG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BampisKT95,
author = {Evripidis Bampis and
Jean{-}Claude K{\"{o}}nig and
Denis Trystram},
title = {Optimal Parallel Execution of Complete Binary Trees and Grids Into
Most Popular Interconnection Networks},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {1--18},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00267-M},
doi = {10.1016/0304-3975(94)00267-M},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BampisKT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BlotVPS95,
author = {Jo{\"{e}}l Blot and
Wenceslas Fernandez de la Vega and
Vangelis Th. Paschos and
Rachid Saad},
title = {Average Case Analysis of Greedy Algorithms for Optimisation Problems
on Set Systems},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {267--298},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)00242-O},
doi = {10.1016/0304-3975(95)00242-O},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BlotVPS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderDFW95,
author = {Hans L. Bodlaender and
Rodney G. Downey and
Michael R. Fellows and
Harold T. Wareham},
title = {The Parameterized Complexity of Sequence Alignment and Consensus},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {31--54},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00251-D},
doi = {10.1016/0304-3975(94)00251-D},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderDFW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChengEP95,
author = {Allan Cheng and
Javier Esparza and
Jens Palsberg},
title = {Complexity Results for 1-Safe Nets},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {117--136},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00231-7},
doi = {10.1016/0304-3975(94)00231-7},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChengEP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GasieniecPR95,
author = {Leszek Gasieniec and
Wojciech Plandowski and
Wojciech Rytter},
title = {The Zooming Method: {A} Recursive Approach to Time-Space Efficient
String-Matching},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {19--30},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00249-I},
doi = {10.1016/0304-3975(94)00249-I},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GasieniecPR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JansenM95,
author = {Klaus Jansen and
Haiko M{\"{u}}ller},
title = {The Minimum Broadcast Time Problem for Several Processor Networks},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {69--85},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00230-G},
doi = {10.1016/0304-3975(94)00230-G},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JansenM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Nishida95,
author = {Taishin Y. Nishida},
title = {Quasi-Deterministic 0L Systems and Their Representation},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {87--116},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00250-M},
doi = {10.1016/0304-3975(94)00250-M},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Nishida95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Schurz95,
author = {Gerhard Schurz},
title = {Most General First Order Theorems are not Recursively Enumerable},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {149--163},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00229-C},
doi = {10.1016/0304-3975(94)00229-C},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Schurz95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sureson95,
author = {Claude Sureson},
title = {{NP} != co-NP and Models of Arithmetic},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {55--67},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00234-A},
doi = {10.1016/0304-3975(94)00234-A},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sureson95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YuC95,
author = {Chang{-}Wu Yu and
Gen{-}Huey Chen},
title = {Efficient Parallel Algorithms for Doubly Convex-Bipartite Graphs},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {249--265},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00220-D},
doi = {10.1016/0304-3975(94)00220-D},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YuC95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Zimand95,
author = {Marius Zimand},
title = {On the Topological Size of p-m-Complete Degrees},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {137--147},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00240-J},
doi = {10.1016/0304-3975(94)00240-J},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Zimand95.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-21 22:12 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:
