Thore Husfeldt, Theis Rauhe. Hardness Results for Dynamic Problems by Extensions of Fredman and Saks Chronogram Method. In Kim Guldstrand Larsen, Sven Skyum, Glynn Winskel, editors, Automata, Languages and Programming, 25th International Colloquium, ICALP 98, Aalborg, Denmark, July 13-17, 1998, Proceedings. Volume 1443 of Lecture Notes in Computer Science, pages 67-78, Springer, 1998. [doi]
@inproceedings{HusfeldtR98,
title = {Hardness Results for Dynamic Problems by Extensions of Fredman and Saks Chronogram Method},
author = {Thore Husfeldt and Theis Rauhe},
year = {1998},
url = {http://link.springer.de/link/service/series/0558/bibs/1443/14430067.htm},
researchr = {https://researchr.org/publication/HusfeldtR98},
cites = {0},
citedby = {0},
pages = {67-78},
booktitle = {Automata, Languages and Programming, 25th International Colloquium, ICALP 98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
editor = {Kim Guldstrand Larsen and Sven Skyum and Glynn Winskel},
volume = {1443},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-64781-3},
}