Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter

Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter

Content
Grafik
Authors
  • Chatterjee, Krishnendu
  • Dvořák, Wolfgang
  • Henzinger, Monika
  • Loitzenbauer, Veronika
Grafik Top
Projects
Grafik Top
Shortfacts
Category
 Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)
Divisions
 Theory and Applications of Algorithms
Subjects
 Theoretische Informatik
Event Location
 New Orleans, LA, USA
Event Type
 Conference
Event Dates
 January 7-10, 2018
Date
 2018
Export
Grafik Top
Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
EPrints Logo
CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.