Wojciech Plandowski


Ontology type: schema:Person     


Person Info

NAME

Wojciech

SURNAME

Plandowski

Publications in SciGraph latest 50 shown

  • 2014 Finding All Solutions of Equations in Free Groups and Monoids with Involution in COMPUTER SCIENCE - THEORY AND APPLICATIONS
  • 2009-12-02 On Word Equations in One Variable in ALGORITHMICA
  • 2009 Word Equations with One Unknown in DEVELOPMENTS IN LANGUAGE THEORY
  • 2003-06-18 Test Sets for Large Families of Languages in DEVELOPMENTS IN LANGUAGE THEORY
  • 2002-06-21 Three Heuristics for δ-Matching: δ-BM Algorithms in COMBINATORIAL PATTERN MATCHING
  • 2001-08-02 On the Complexity of Decidable Cases of Commutation Problem for Languages in FUNDAMENTALS OF COMPUTATION THEORY
  • 2000-03-24 Two-Variable Word Equations in STACS 2000
  • 1999-07-08 The Compression of Subsegments of Images Described by Finite Automata in COMBINATORIAL PATTERN MATCHING
  • 1999 Complexity of Language Recognition Problems for Compressed Words in JEWELS ARE FOREVER
  • 1998 Locally periodic infinite words and a chaotic behaviour in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1998 On defect effect of bi-infinite words in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998
  • 1998 Application of Lempel-Ziv encodings to the solution of word equations in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1997 On the complexity of pattern matching for highly compressed two-dimensional texts in COMBINATORIAL PATTERN MATCHING
  • 1997 The expressibility of languages and relations by word equations in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1997 Pattern-matching problems for 2-dimensional images described by finite automata in FUNDAMENTALS OF COMPUTATION THEORY
  • 1996 Randomized efficient algorithms for compressed strings: the finger-print approach in COMBINATORIAL PATTERN MATCHING
  • 1996 Parallel Alternating-Direction Access Machine in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1996
  • 1996 Efficient algorithms for Lempel-Ziv encoding in ALGORITHM THEORY — SWAT'96
  • 1995 Two-dimensional pattern matching in linear time and small space in STACS 95
  • 1995 Constant-space string matching with smaller number of comparisons: sequential sampling in COMBINATORIAL PATTERN MATCHING
  • 1994 Testing equivalence of morphisms on context-free languages in ALGORITHMS — ESA '94
  • 1994 On the size of independent systems of equations in semigroups in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1994
  • 1992 Polynomial size test sets for context-free languages in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1992 Speeding up two string-matching algorithms in STACS 92
  • 1991 Exact analysis of three tree contraction algorithms in FUNDAMENTALS OF COMPUTATION THEORY
  • 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.12847.38", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.1374.1", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.470079.d", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.4372.2", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.10025.36", 
            "type": "Organization"
          }
        ], 
        "familyName": "Plandowski", 
        "givenName": "Wojciech", 
        "id": "sg:person.010207617143.19", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010207617143.19"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-08-04T17:37", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/person/person_508.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.010207617143.19'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...