D-Index & Metrics Best Publications
Christian Bischof

Christian Bischof

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Engineering and Technology D-index 30 Citations 6,104 215 World Ranking 6465 National Ranking 229

Overview

What is he best known for?

The fields of study he is best known for:

  • Operating system
  • Programming language
  • Algorithm

Christian Bischof mostly deals with Algorithm, Automatic differentiation, QR decomposition, Parallel computing and Factorization. His Algorithm study also includes fields such as

  • Matrix which connect with Discrete mathematics, Subspace topology and Linear subspace,
  • RRQR factorization together with Sparse matrix and Block. The various areas that Christian Bischof examines in his Automatic differentiation study include Computer Aided Design and Fortran.

His work focuses on many connections between QR decomposition and other disciplines, such as Rank, that overlap with his field of interest in Applied mathematics and Mathematical optimization. The Parallel computing study combines topics in areas such as Basic Linear Algebra Subprograms, Visualization, Feature extraction, Eigenvalues and eigenvectors and Virtual reality. Christian Bischof interconnects Representation, Matrix multiplication, Householder's method, Householder transformation and Multiplication in the investigation of issues within Factorization.

His most cited work include:

  • LAPACK Users' Guide, 3rd ed. (413 citations)
  • LAPACK: a portable linear algebra library for high-performance computers (399 citations)
  • ADIFOR-Generating Derivative Codes from Fortran Programs (379 citations)

What are the main themes of his work throughout his whole career to date?

His primary scientific interests are in Automatic differentiation, Parallel computing, Algorithm, Fortran and Computation. His Automatic differentiation study is associated with Programming language. His Parallel computing study incorporates themes from Lattice problem and Scalability.

His work deals with themes such as Function, Matrix, QR decomposition and Chain rule, which intersect with Algorithm. His study looks at the relationship between Chain rule and fields such as Differential calculus, as well as how they intersect with chemical problems. His Fortran research includes themes of Numerical differentiation and Numerical analysis.

He most often published in these fields:

  • Automatic differentiation (33.33%)
  • Parallel computing (22.44%)
  • Algorithm (20.46%)

What were the highlights of his more recent work (between 2013-2020)?

  • Parallel computing (22.44%)
  • Lattice problem (4.29%)
  • Cryptography (3.63%)

In recent papers he was focusing on the following fields of study:

Christian Bischof mainly investigates Parallel computing, Lattice problem, Cryptography, Automatic differentiation and Solver. His Parallel computing study integrates concerns from other disciplines, such as Scalability, Compiler, Computer architecture, Code and Data structure. His Lattice problem study also includes

  • Theoretical computer science and Prime most often made with reference to Cryptosystem,
  • Non-blocking algorithm which connect with Linked list.

His Cryptography research is multidisciplinary, relying on both Computational complexity theory and Simulated annealing. His Operator overloading study in the realm of Automatic differentiation interacts with subjects such as Source transformation. His Solver research includes elements of Core and Speedup.

Between 2013 and 2020, his most popular works were:

  • Lock-Free GaussSieve for Linear Speedups in Parallel High Performance SVP Calculation (25 citations)
  • Tuning GaussSieve for Speed (25 citations)
  • Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP (23 citations)

In his most recent research, the most cited papers focused on:

  • Operating system
  • Programming language
  • Algorithm

His primary areas of investigation include Parallel computing, Lattice problem, Cryptography, Theoretical computer science and Cryptosystem. His Parallel computing research incorporates elements of Scalability, Compiler and Implementation. His biological study deals with issues like Solver, which deal with fields such as Performance engineering, Task, Automation, Supercomputer and Learning with errors.

His study in Theoretical computer science is interdisciplinary in nature, drawing from both Programming language, Source code, Operator overloading, Unreachable code and Code bloat. He usually deals with Code bloat and limits it to topics linked to Source lines of code and Automatic differentiation. His Algorithm study combines topics in areas such as Heuristics and Prime.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

ADIFOR-Generating Derivative Codes from Fortran Programs

Christian Bischof;Alan Carle;George Corliss;Andreas Griewank.
Scientific Programming (1992)

677 Citations

LAPACK: a portable linear algebra library for high-performance computers

E. Anderson;Z. Bai;J. Dongarra;A. Greenbaum.
conference on high performance computing (supercomputing) (1990)

660 Citations

Adifor 2.0: automatic differentiation of Fortran 77 programs

C. Bischof;P. Khademi;A. Mauer;A. Carle.
computational science and engineering (1996)

651 Citations

LAPACK Users' Guide, 3rd ed.

Ed Anderson;Zhaojun Bai;Christian Bischof;Susan Blackford.
Philadelphia: Society for Industrial and Applied Mathematics (1999)

638 Citations

The WY representation for products of householder matrices

Christian Bischof;Charles van Loan.
Siam Journal on Scientific and Statistical Computing (1987)

404 Citations

ADIC: an extensible automatic differentiation tool for ANSI-C

C. H. Bischof;L. Roh;A. J. Mauer-Oats.
Software - Practice and Experience (1997)

326 Citations

LAPACK Users' guide (third ed.)

E. Anderson;Z. Bai;C. Bischof;L. S. Blackford.
(1999)

279 Citations

Computing rank-revealing QR factorizations of dense matrices

Christian H. Bischof;G. Quintana-Ortí.
ACM Transactions on Mathematical Software (1998)

170 Citations

On updating signal subspaces

C.H. Bischof;G.M. Shroff.
IEEE Transactions on Signal Processing (1992)

143 Citations

Incremental condition estimation

Christian H. Bischof.
SIAM Journal on Matrix Analysis and Applications (1990)

139 Citations

Best Scientists Citing Christian Bischof

Jack Dongarra

Jack Dongarra

University of Tennessee at Knoxville

Publications: 102

Enrique S. Quintana-Ortí

Enrique S. Quintana-Ortí

Universitat Politècnica de València

Publications: 56

James Demmel

James Demmel

University of California, Berkeley

Publications: 50

Peter Benner

Peter Benner

Max Planck Institute for Dynamics of Complex Technical Systems

Publications: 38

Robert A. van de Geijn

Robert A. van de Geijn

The University of Texas at Austin

Publications: 35

Stanimire Tomov

Stanimire Tomov

University of Tennessee at Knoxville

Publications: 28

Piotr Luszczek

Piotr Luszczek

University of Tennessee at Knoxville

Publications: 21

Ahmed Sameh

Ahmed Sameh

Purdue University West Lafayette

Publications: 17

Linda R. Petzold

Linda R. Petzold

University of California, Santa Barbara

Publications: 16

Wolfgang Marquardt

Wolfgang Marquardt

Forschungszentrum Jülich

Publications: 15

Adrian Sandu

Adrian Sandu

Virginia Tech

Publications: 15

Andreas Griewank

Andreas Griewank

Humboldt-Universität zu Berlin

Publications: 14

Barak A. Pearlmutter

Barak A. Pearlmutter

National University of Ireland, Maynooth

Publications: 14

Fred G. Gustavson

Fred G. Gustavson

Umeå University

Publications: 14

Torsten Hoefler

Torsten Hoefler

ETH Zurich

Publications: 14

Nicholas J. Higham

Nicholas J. Higham

University of Manchester

Publications: 12

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us
Something went wrong. Please try again later.