Zvi Galil


Ontology type: schema:Person     


Person Info

NAME

Zvi

SURNAME

Galil

Publications in SciGraph latest 50 shown

  • 2013 Forty Years of Text Indexing in COMBINATORIAL PATTERN MATCHING
  • 2011 Real-Time Streaming String-Matching in COMBINATORIAL PATTERN MATCHING
  • 2010 Old and New in Stringology in COMBINATORIAL PATTERN MATCHING
  • 2001-05-18 A Secure Public-Key Authentication Scheme in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’89
  • 2001-05 A Generalization of a Lower Bound Technique due to Fredman and Saks in ALGORITHMICA
  • 1995-10 Finding all periods and initial palindromes of a string in parallel in ALGORITHMICA
  • 1995 Sensing versus nonsensing automata in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1995 Lower bounds on algebraic random access machines in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1995 Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary in ALGORITHMS — ESA '95
  • 1994 Parallel detection of all palindromes in a string in STACS 94
  • 1993 Efficient Algorithms for Sequence Analysis in SEQUENCES II
  • 1993 Parallel string matching algorithms in SEQUENCES II
  • 1992 Optimal parallel algorithms for periods, palindromes and squares in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1991 An almost linear-time algorithm for the dense subset-sum problem in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1991 On the power of multiple reads in a chip in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1991 Maintaining biconnected components of dynamic planar graphs in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1990 Recent progress in string algorithms in ALGORITHMS
  • 1990 Efficient Algorithms with Applications to Molecular Biology in SEQUENCES
  • 1989-03 On 3-pushdown graphs with large separators in COMBINATORICA
  • 1989 Parallel algorithmic techniques for combinatorial computation in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1989 An improved algorithm for approximate string matching in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1988-06 Improved processor bounds for combinatorial problems in RNC in COMBINATORICA
  • 1988 Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model (Extended Abstract) in ADVANCES IN CRYPTOLOGY — CRYPTO ’87
  • 1986-06 Efficient algorithms for finding minimum spanning trees in undirected and directed graphs in COMBINATORICA
  • 1986 Symmetric Public-Key Encryption in ADVANCES IN CRYPTOLOGY — CRYPTO ’85 PROCEEDINGS
  • 1986 Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1985 Open Problems in Stringology in COMBINATORIAL ALGORITHMS ON WORDS
  • 1985 Distributed algorithms in synchronous broadcasting networks in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1984-12 A time-space tradeoff for language recognition in MATHEMATICAL SYSTEMS THEORY
  • 1983 Efficient algorithms for finding maximal matching in graphs in CAAP'83
  • 1982 On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1980-09 An O(V5/3E2/3) algorithm for the maximal flow problem in ACTA INFORMATICA
  • 1980-01 Applications of efficient mergeable heaps for optimization problems on trees in ACTA INFORMATICA
  • 1980 An almost linear time algorithm for computing a dependency basis in a relational data base in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1979-12 Storage representations for tree-like data structures in MATHEMATICAL SYSTEMS THEORY
  • 1978 On improving the worst case running time of the Boyer-Moore string matching algorithm in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1977-12 Real-time recognition of substring repetition and reversal in MATHEMATICAL SYSTEMS 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": "https://www.grid.ac/institutes/grid.21729.3f", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.278125.b", 
            "type": "Organization"
          }
        ], 
        "familyName": "Galil", 
        "givenName": "Zvi", 
        "id": "sg:person.0675716504.71", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0675716504.71"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:16", 
        "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_1079.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.0675716504.71'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...