Erich Kaltofen


Ontology type: schema:Person     


Person Info

NAME

Erich

SURNAME

Kaltofen

Publications in SciGraph latest 50 shown

  • 2014 Symbolic Computation and Complexity Theory Transcript of My Talk in COMPUTER MATHEMATICS
  • 2014 Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations in COMPUTER MATHEMATICS
  • 2012 The “Seven Dwarfs” of Symbolic Computation in NUMERICAL AND SYMBOLIC SCIENTIFIC COMPUTING
  • 2010-09 Efficiently Certifying Non-Integer Powers in COMPUTATIONAL COMPLEXITY
  • 2009 Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares in APPROXIMATE COMMUTATIVE ALGEBRA
  • 2007 Structured Low Rank Approximation of a Sylvester Matrix in SYMBOLIC-NUMERIC COMPUTATION
  • 2005-06-09 Polynomial factorization 1987–1991 in LATIN '92
  • 2005-02 On the complexity of computing determinants in COMPUTATIONAL COMPLEXITY
  • 2003 Computer Algebra — Historical Development, Characterization, and Prospects in COMPUTER ALGEBRA HANDBOOK
  • 2003 Meetings and Publications in COMPUTER ALGEBRA HANDBOOK
  • 1999-07 Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields in ALGORITHMICA
  • 1996 Prediction Based Task Scheduling in Distributed Computing in LANGUAGES, COMPILERS AND RUN-TIME SYSTEMS FOR SCALABLE COMPUTERS
  • 1994 A Distributed Approach to Problem Solving in Maple in MAPLE V: MATHEMATICS AND ITS APPLICATIONS
  • 1993 Process scheduling in DSC and the large sparse linear systems challenge in DESIGN AND IMPLEMENTATION OF SYMBOLIC COMPUTATION SYSTEMS
  • 1993 Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems in APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES
  • 1991-07 On fast multiplication of polynomials over arbitrary algebras in ACTA INFORMATICA
  • 1991 On wiedemann's method of solving sparse linear systems in APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES
  • 1991 Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields by Integer Lattice Reduction in NUMBER THEORY
  • 1990-09 Computing the irreducible real factors and components of an algebraic curve in APPLICABLE ALGEBRA IN ENGINEERING, COMMUNICATION AND COMPUTING
  • 1989 Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices in EUROCAL '87
  • 1989 Improved sparse multivariate polynomial interpolation algorithms in SYMBOLIC AND ALGEBRAIC COMPUTATION
  • 1986 Efficient parallel evaluation of straight-line code and arithmetic circuits in VLSI ALGORITHMS AND ARCHITECTURES
  • 1985 Arithmetic in quadratic fields with unique factorization in EUROCAL '85
  • 1985 Sparse hensel lifting in EUROCAL '85
  • 1984 Effective Hilbert irreducibility in EUROSAM 84
  • 1984 A note on the Risch differential equation in EUROSAM 84
  • 1984 Explicit construction of the hilbert class fields of imaginary quadratic fields with class numbers 7 and 11 in EUROSAM 84
  • 1983 On the complexity of finding short vectors in integer lattices in COMPUTER ALGEBRA
  • 1983 Polynomial-time factorization of multivariate polynomials over finite fields in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 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.40803.3f", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.33647.35", 
            "type": "Organization"
          }
        ], 
        "familyName": "Kaltofen", 
        "givenName": "Erich", 
        "id": "sg:person.013117774373.47", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013117774373.47"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:45", 
        "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_1532.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.013117774373.47'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...