@article{Bampis-Konig-Trystram/95,
AUTHOR = {Bampis, E. and K{\"o}nig, J.-C. and Trystram, D.},
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},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Gasieniec-Plandowski-Rytter/95a,
AUTHOR = {Gasieniec, Leszek and Plandowski, Wojciech and Rytter, Wojciech},
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},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Bodlaender-Downey-Fellows-Wareham/95,
AUTHOR = {Bodlaender, Hans L. and Downey, Rodney G. and Fellows, Michael R. and Wareham, Harold T.},
TITLE = {The parameterized complexity of sequence alignment and consensus},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {147},
NUMBER = {1-2},
PAGES = {31-54},
YEAR = {1995},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Sureson/95,
AUTHOR = {Sureson, Claude},
TITLE = {$\NP\neq co-\NP$ and models of arithmetic},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {147},
NUMBER = {1-2},
PAGES = {55-67},
YEAR = {1995},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Jansen-Muller/95,
AUTHOR = {Jansen, Klaus and M{\"u}ller, Haiko},
TITLE = {The minimum broadcast time problem for several processor networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {147},
NUMBER = {1-2},
PAGES = {69-85},
YEAR = {1995},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Nishida/95,
AUTHOR = {Nishida, Taishin Y.},
TITLE = {Quasi-deterministic 0L systems and their representation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {147},
NUMBER = {1-2},
PAGES = {87-116},
YEAR = {1995},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Cheng-Esparza-Palsberg/95,
AUTHOR = {Cheng, Allan and Esparza, Javier and Palsberg, Jens},
TITLE = {Complexity results for 1-safe nets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {147},
NUMBER = {1-2},
PAGES = {117-136},
YEAR = {1995},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Zimand/95a,
AUTHOR = {Zimand, Marius},
TITLE = {On the topological size of $p$-$m$-complete degrees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {147},
NUMBER = {1-2},
PAGES = {137-147},
YEAR = {1995},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Schurz/95,
AUTHOR = {Schurz, Gerhard},
TITLE = {Most general first order theorems are not recursively enumerable},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {147},
NUMBER = {1-2},
PAGES = {149-163},
YEAR = {1995},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Aigrain-Beauquier/95,
AUTHOR = {Aigrain, Philippe and Beauquier, Dani{\`{e}}le},
TITLE = {Polyomino tilings, cellular automata and codicity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {147},
NUMBER = {1-2},
PAGES = {165-180},
YEAR = {1995},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Amaldi-Kann/95,
AUTHOR = {Amaldi, Edoardo and Kann, Viggo},
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},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Arques-Grange/95,
AUTHOR = {Arqu{\`e}s, Didier and Grange, Olivier},
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},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Yu-Chen/95,
AUTHOR = {Yu, Chang-Wu and Chen, Gen-Huey},
TITLE = {Efficient parallel algorithms for doubly convex-bipartite graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {147},
NUMBER = {1-2},
PAGES = {249-265},
YEAR = {1995},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}
@article{Blot-Vega-Paschos-Saad/95,
AUTHOR = {Blot, Jo{\"{e}}l and Vega, Wenceslas Fernandez de la and Paschos, Vangelis Th. and Saad, Rachid},
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},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Tokyo},
}