Viliam Geffert


Ontology type: schema:Person     


Person Info

NAME

Viliam

SURNAME

Geffert

Publications in SciGraph latest 50 shown

  • 2018-05-26 Minimal Useful Size of Counters for (Real-Time) Multicounter Automata in MACHINES, COMPUTATIONS, AND UNIVERSALITY
  • 2018-04-25 Complement for Two-Way Alternating Automata in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2018-02-09 Unary Coded PSPACE-Complete Languages in ASPACE(loglog n) in THEORY OF COMPUTING SYSTEMS
  • 2017 Unary Coded PSPACE-Complete Languages in ASPACE(loglog n) in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2016 Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space in DEVELOPMENTS IN LANGUAGE THEORY
  • 2014 Two Double-Exponential Gaps for Automata with a Limited Pushdown in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2014 Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014
  • 2014 Classical Automata on Promise Problems in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2013 A Direct Construction of Finite State Automata for Pushdown Store Languages in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2013 Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2012-07 Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata in ALGORITHMICA
  • 2012 Two-Way Automata Making Choices Only at the Endmarkers in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2012 Removing Nondeterminism in Constant Height Pushdown Automata in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2012 Unary Coded NP-Complete Languages in ASPACE (log log n) in DEVELOPMENTS IN LANGUAGE THEORY
  • 2011 The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2011 In-Place Sorting in SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2010 Two-Way Unary Automata versus Logarithmic Space in DEVELOPMENTS IN LANGUAGE THEORY
  • 2010 Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata in LATIN 2010: THEORETICAL INFORMATICS
  • 2009 Multiway In-Place Merging in FUNDAMENTALS OF COMPUTATION THEORY
  • 2009 Factoring and Testing Primes in Small Space in SOFSEM 2009: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2008 More Concise Representation of Regular Languages by Automata and Regular Expressions in DEVELOPMENTS IN LANGUAGE THEORY
  • 2006 Magic Numbers in the State Hierarchy of Finite Automata in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006
  • 2005 Complementing Two-Way Finite Automata in DEVELOPMENTS IN LANGUAGE THEORY
  • 2001-09-05 Space Hierarchy Theorem Revised in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001
  • 2001-09-05 Converting Two—Way Nondeterministic Unary Automata into Simpler Automata in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001
  • 1995 Bridging across the log(n) space frontier in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1995
  • 1990 Speed-up theorem without tape compression in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1990
  • 1990 Nondeterministic computations in sublogarithmic space and space constructibility in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1988 Context-free-like forms for the phrase-structure grammars in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1988
  • 1986 Grammars with context dependency restricted to synchronization in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1986
  • Affiliations

    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": "https://www.grid.ac/institutes/grid.11175.33", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Geffert", 
        "givenName": "Viliam", 
        "id": "sg:person.011213555111.15", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011213555111.15"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:39", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1431.json", 
        "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.011213555111.15'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...