Artur Jeż


Ontology type: schema:Person     


Person Info

NAME

Artur

SURNAME

Jeż

Publications in SciGraph latest 50 shown

  • 2020-02-25 Recompression: Technique for Word Equations and Compressed Data in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2019-07-10 Deciding Context Unification (with Regular Constraints) in DEVELOPMENTS IN LANGUAGE THEORY
  • 2014-09-11 One-Variable Word Equations in Linear Time in ALGORITHMICA
  • 2014 Finding All Solutions of Equations in Free Groups and Monoids with Involution in COMPUTER SCIENCE - THEORY AND APPLICATIONS
  • 2014 Context Unification is in PSPACE in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2014 A really Simple Approximation of Smallest Grammar in COMBINATORIAL PATTERN MATCHING
  • 2013-12-06 Validating the Knuth-Morris-Pratt Failure Function, Fast and Online in THEORY OF COMPUTING SYSTEMS
  • 2013-01-18 The Complexity of Compressed Membership Problems for Finite Automata in THEORY OF COMPUTING SYSTEMS
  • 2013 Recompression: Word Equations and Beyond in DEVELOPMENTS IN LANGUAGE THEORY
  • 2013 One-Variable Word Equations in Linear Time in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2013 Approximation of Grammar-Based Compression via Recompression in COMBINATORIAL PATTERN MATCHING
  • 2013 Unambiguous Conjunctive Grammars over a One-Letter Alphabet in DEVELOPMENTS IN LANGUAGE THEORY
  • 2012 Faster Fully Compressed Pattern Matching by Recompression in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2012 On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2012 Hyper-minimization for Deterministic Tree Automata in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2011-10-04 Collecting Weighted Items from a Dynamic Queue in ALGORITHMICA
  • 2011-08-04 Representing Hyper-arithmetical Sets by Equations over Sets of Integers in THEORY OF COMPUTING SYSTEMS
  • 2011-03-10 One-Nonterminal Conjunctive Grammars over a Unary Alphabet in THEORY OF COMPUTING SYSTEMS
  • 2011 On Minimising Automata with Errors in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011
  • 2011 Computing All ℓ-Cover Automata Fast in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2010 Validating the Knuth-Morris-Pratt Failure Function, Fast and Online in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2010 Least and Greatest Solutions of Equations over Sets of Integers in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010
  • 2009-12-23 Complexity of Equations over Sets of Natural Numbers in THEORY OF COMPUTING SYSTEMS
  • 2009 One-Nonterminal Conjunctive Grammars over a Unary Alphabet in COMPUTER SCIENCE - THEORY AND APPLICATIONS
  • 2009 Hyper-minimisation Made Efficient in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009
  • 2008-08-21 Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth in THEORY OF COMPUTING SYSTEMS
  • 2008-01-01 On the Computational Completeness of Equations over Sets of Natural Numbers in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2007 Conjunctive Grammars Can Generate Non-regular Unary Languages in DEVELOPMENTS IN LANGUAGE THEORY
  • 2007-01-01 Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 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.8505.8", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.419528.3", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.12847.38", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.425308.8", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.4372.2", 
            "type": "Organization"
          }
        ], 
        "familyName": "Je\u017c", 
        "givenName": "Artur", 
        "id": "sg:person.015252371751.76", 
        "identifier": [
          {
            "name": "orcid_id", 
            "type": "PropertyValue", 
            "value": "0000-0003-4321-3105"
          }
        ], 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015252371751.76", 
          "https://orcid.org/0000-0003-4321-3105"
        ], 
        "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_788.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.015252371751.76'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     

    This table displays all metadata directly associated to this object as RDF triples.

    29 TRIPLES      11 PREDICATES      17 URIs      8 LITERALS      3 BLANK NODES

    Subject Predicate Object
    1 sg:person.015252371751.76 schema:affiliation Naf4d138884ce4e6ab45f50431c888bfe
    2 grid-institutes:grid.12847.38
    3 grid-institutes:grid.419528.3
    4 grid-institutes:grid.425308.8
    5 grid-institutes:grid.4372.2
    6 schema:familyName Jeż
    7 schema:givenName Artur
    8 schema:identifier N7c4a4a423e8e4f069ee36acc4f35a89c
    9 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015252371751.76
    10 https://orcid.org/0000-0003-4321-3105
    11 schema:sdDatePublished 2022-01-01T19:57
    12 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    13 schema:sdPublisher N8aa43c0e5a614010bba1cd86c5cf1425
    14 sgo:license sg:explorer/license/
    15 sgo:sdDataset persons
    16 rdf:type schema:Person
    17 N7c4a4a423e8e4f069ee36acc4f35a89c schema:name orcid_id
    18 schema:value 0000-0003-4321-3105
    19 rdf:type schema:PropertyValue
    20 N8aa43c0e5a614010bba1cd86c5cf1425 schema:name Springer Nature - SN SciGraph project
    21 rdf:type schema:Organization
    22 Naf4d138884ce4e6ab45f50431c888bfe schema:affiliation grid-institutes:grid.8505.8
    23 sgo:isCurrent true
    24 rdf:type schema:OrganizationRole
    25 grid-institutes:grid.12847.38 schema:Organization
    26 grid-institutes:grid.419528.3 schema:Organization
    27 grid-institutes:grid.425308.8 schema:Organization
    28 grid-institutes:grid.4372.2 schema:Organization
    29 grid-institutes:grid.8505.8 schema:Organization
     




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


    ...