Markus Lohrey


Ontology type: schema:Person     


Person Info

NAME

Markus

SURNAME

Lohrey

Publications in SciGraph latest 50 shown

  • 2021-09-09 Complexity of Word Problems for HNN-Extensions in FUNDAMENTALS OF COMPUTATION THEORY
  • 2021-07-02 Compression Techniques in Group Theory in CONNECTING WITH COMPUTABILITY
  • 2020-09-17 A Comparison of Empirical Tree Entropies in STRING PROCESSING AND INFORMATION RETRIEVAL
  • 2020-08-14 Derandomization for Sliding Window Algorithms with Strict Correctness∗ in THEORY OF COMPUTING SYSTEMS
  • 2020-06-24 Balancing Straight-Line Programs for Strings and Trees in BEYOND THE HORIZON OF COMPUTABILITY
  • 2019-08-08 Grammar-Based Compression of Unranked Trees in THEORY OF COMPUTING SYSTEMS
  • 2019-07-10 Largest Common Prefix of a Regular Tree Language in FUNDAMENTALS OF COMPUTATION THEORY
  • 2019-05-16 Derandomization for Sliding Window Algorithms with Strict Correctness in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2018-08-30 Knapsack in Hyperbolic Groups in REACHABILITY PROBLEMS
  • 2018-04-25 Grammar-Based Compression of Unranked Trees in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2018-03-08 Sliding Window Algorithms for Regular Languages in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2017-09-12 Knapsack in Graph Groups in THEORY OF COMPUTING SYSTEMS
  • 2017-07-24 Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees in ALGORITHMICA
  • 2017-07-05 Evaluation of Circuits Over Nilpotent and Polycyclic Groups in ALGORITHMICA
  • 2017-02-06 Tree Compression Using String Grammars in ALGORITHMICA
  • 2017-01-11 Satisfiability of ECTL∗ with Local Tree Constraints in THEORY OF COMPUTING SYSTEMS
  • 2016-09-21 The Smallest Grammar Problem Revisited in STRING PROCESSING AND INFORMATION RETRIEVAL
  • 2016-07-25 On Boolean Closed Full Trios and Rational Kripke Frames in THEORY OF COMPUTING SYSTEMS
  • 2016-03-22 Tree Compression Using String Grammars in LATIN 2016: THEORETICAL INFORMATICS
  • 2015-12-26 Processing Succinct Matrices and Vectors in THEORY OF COMPUTING SYSTEMS
  • 2015-08-27 Equality Testing of Compressed Strings in COMBINATORICS ON WORDS
  • 2015-08-11 Parallel Identity Testing for Skew Circuits with Big Powers and Applications in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015
  • 2015-07-18 Path Checking for MTL and TPTL over Data Words in DEVELOPMENTS IN LANGUAGE THEORY
  • 2015-07-18 Grammar-Based Tree Compression in DEVELOPMENTS IN LANGUAGE THEORY
  • 2015-06-24 Evaluating Matrix Circuits in COMPUTING AND COMBINATORICS
  • 2015-06-23 Satisfiability of ECTL* with Tree Constraints in COMPUTER SCIENCE -- THEORY AND APPLICATIONS
  • 2015-06-20 Compressed Tree Canonization in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2014-05-25 XML Compression via Directed Acyclic Graphs in THEORY OF COMPUTING SYSTEMS
  • 2014 The Compressed Word Problem for Groups in NONE
  • 2014 Processing Succinct Matrices and Vectors in COMPUTER SCIENCE - THEORY AND APPLICATIONS
  • 2013 Rational Subsets and Submonoids of Wreath Products in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2013 Satisfiability of CTL* with Constraints in CONCUR 2013 – CONCURRENCY THEORY
  • 2012 Logspace Computations in Graph Groups and Coxeter Groups in LATIN 2012: THEORETICAL INFORMATICS
  • 2012 Tree-Automatic Well-Founded Trees in HOW THE WORLD COMPUTES
  • 2011 Compressed Word Problems for Inverse Monoids in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011
  • 2011 Isomorphism of Regular Trees and Words in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2011 Compressed Membership in Automata with Compressed Labels in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2010-10-22 Compressed Word Problems in HNN-extensions and Amalgamated Products in THEORY OF COMPUTING SYSTEMS
  • 2010-04-10 Tilings and Submonoids of Metabelian Groups in THEORY OF COMPUTING SYSTEMS
  • 2010 Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups in DEVELOPMENTS IN LANGUAGE THEORY
  • 2010 The Isomorphism Problem for ω-Automatic Trees in COMPUTER SCIENCE LOGIC
  • 2009-08-01 Fixpoint Logics over Hierarchical Structures in THEORY OF COMPUTING SYSTEMS
  • 2009 Automatic Structures of Bounded Degree Revisited in COMPUTER SCIENCE LOGIC
  • 2009 Parameter Reduction in Grammar-Compressed Trees in FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES
  • 2009 Compressed Word Problems in HNN-Extensions and Amalgamated Products in COMPUTER SCIENCE - THEORY AND APPLICATIONS
  • 2008-04-08 Partially commutative inverse monoids in SEMIGROUP FORUM
  • 2008-01-01 Hamiltonicity of automatic graphs in FIFTH IFIP INTERNATIONAL CONFERENCE ON THEORETICAL COMPUTER SCIENCE – TCS 2008
  • 2007-01-01 Efficient Computation in Groups Via Compression in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2007-01-01 PDL with Intersection and Converse Is 2EXP-Complete in FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES
  • 2006 Querying and Embedding Compressed Texts in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "http://www.grid.ac/institutes/grid.5836.8", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.9647.c", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.462842.e", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.411339.d", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.5719.a", 
            "type": "Organization"
          }
        ], 
        "familyName": "Lohrey", 
        "givenName": "Markus", 
        "id": "sg:person.015611460437.34", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015611460437.34"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-01-01T19:57", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/person/person_743.jsonl", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.015611460437.34'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.015611460437.34'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.015611460437.34'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.015611460437.34'


     




    Preview window. Press ESC to close (or click here)


    ...