@inproceedings{DBLP:conf/mfcs/ChlebusDRS89,
author = {Bogdan S. Chlebus and
Krzysztof Diks and
Wojciech Rytter and
Tomasz Szymacha},
title = {Parallel Complexity of Lexicographically First Order Problems
for Tree-Structured Graphs (Extended Abstract)},
booktitle = {MFCS},
year = {1989},
pages = {185-195},
ee = {http://dx.doi.org/10.1007/3-540-51486-4_66},
crossref = {DBLP:conf/mfcs/1989},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/mfcs/1989,
editor = {Antoni Kreczmar and
Grazyna Mirkowska},
title = {Mathematical Foundations of Computer Science 1989, MFCS'89,
Porabka-Kozubnik, Poland, August 28 - September 1, 1989,
Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {379},
year = {1989},
isbn = {3-540-51486-4},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Last update 2009-06-10 CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
