English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Fine-Grained Complexity of Regular Expression Pattern Matching and Membership

MPS-Authors
/persons/resource/persons256289

Schepper,  Philipp
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Schepper, P. (2020). Fine-Grained Complexity of Regular Expression Pattern Matching and Membership. In F. Grandoni, G. Herman, & P. Sanders (Eds.), 28th Annual European Symposium on Algorithms. Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ESA.2020.80.


Cite as: http://hdl.handle.net/21.11116/0000-0007-DBC1-8
Abstract
There is no abstract available