Items where authors include "Loff, B."

Article

Chattopadhyay, A., Koucký, M., Loff, B. et al. (1 more author) (2019) Simulation theorems via pseudo-random properties. Computational Complexity, 28. pp. 617-659. ISSN 1016-3328

Proceedings Paper

Loff, B. and Mukhopadhyay, S. orcid.org/0000-0002-3722-4679 (2019) Lifting theorems for equality. In: Niedermeier, R. and Paul, C., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 13-16 Mar 2019, Berlin, Germany. Leibniz International Proceedings in Informatics, 126 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany , 50:1-50:19. ISBN 978-3-95977-100-9

Chattopadhyay, A., Koucký, M., Loff, B. et al. (1 more author) (2018) Simulation beats richness: new data-structure lower bounds. In: Diakonikolas, I. and Kempe, D., (eds.) STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. STOC '18: Symposium on Theory of Computing, 25-29 Jun 2018, CA, Los Angeles, USA. Association for Computing Machinery (ACM) , pp. 1013-1020. ISBN 9781450355599

Chattopadhyay, A., Dvořák, P., Koucký, M. et al. (2 more authors) (2017) Lower bounds for elimination via weak regularity. In: Vollmer, H. and Vallée, B., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 08-11 Mar 2017, Hannover, Germany. Leibniz International Proceedings in Informatics, 66 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany , 21:1-21:14. ISBN 978-3-95977-028-6