Aleksandrs Belovs. Non-intersecting Complexity. In Jirí Wiedermann, Gerard Tel, Jaroslav Pokorný, Mária Bieliková, Julius Stuller, editors, SOFSEM 2006: Theory and Practice of Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merín, Czech Republic, January 21-27, 2006, Proceedings. Volume 3831 of Lecture Notes in Computer Science, pages 158-165, Springer, 2006. [doi]
@inproceedings{Belovs06:0,
title = {Non-intersecting Complexity},
author = {Aleksandrs Belovs},
year = {2006},
doi = {10.1007/11611257_13},
url = {http://dx.doi.org/10.1007/11611257_13},
researchr = {https://researchr.org/publication/Belovs06%3A0},
cites = {0},
citedby = {0},
pages = {158-165},
booktitle = {SOFSEM 2006: Theory and Practice of Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merín, Czech Republic, January 21-27, 2006, Proceedings},
editor = {Jirí Wiedermann and Gerard Tel and Jaroslav Pokorný and Mária Bieliková and Julius Stuller},
volume = {3831},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-31198-X},
}