@InProceedings{groote_et_al:LIPIcs.CONCUR.2021.31, author = {Groote, Jan Friso and Martens, Jan and de Vink, Erik}, title = {{Bisimulation by Partitioning Is \Omega((m+n)log n)}}, booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)}, pages = {31:1--31:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-203-7}, ISSN = {1868-8969}, year = {2021}, volume = {203}, editor = {Haddad, Serge and Varacca, Daniele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.31}, URN = {urn:nbn:de:0030-drops-144087}, doi = {10.4230/LIPIcs.CONCUR.2021.31}, annote = {Keywords: Bisimilarity, partition refinement, labeled transition system, lowerbound} }