Sergey S. Fedin, Alexander S. Kulikov. Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms. In Rodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne, editors, Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings. Volume 3162 of Lecture Notes in Computer Science, pages 248-259, Springer, 2004. [doi]
@inproceedings{FedinK04,
title = {Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms},
author = {Sergey S. Fedin and Alexander S. Kulikov},
year = {2004},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3162&spage=248},
researchr = {https://researchr.org/publication/FedinK04},
cites = {0},
citedby = {0},
pages = {248-259},
booktitle = {Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings},
editor = {Rodney G. Downey and Michael R. Fellows and Frank K. H. A. Dehne},
volume = {3162},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-23071-8},
}