What is he best known for?
The fields of study he is best known for:
- Algebra
- Combinatorics
- Discrete mathematics
Andreas Blass focuses on Discrete mathematics, Combinatorics, Ultrafilter, Pure mathematics and Function.
Discrete mathematics is a component of his Partially ordered set, Intermediate logic, Many-valued logic, Predicate logic and Dynamic logic studies.
His work on Indifference graph, Chordal graph and Cardinality of the continuum as part of general Combinatorics research is frequently linked to T1 space and Sequential space, thereby connecting diverse disciplines of science.
His Ultrafilter study incorporates themes from Ultraproduct, Algebra over a field and Elementary equivalence.
His Pure mathematics research integrates issues from Forcing, Continuum hypothesis and Hasse diagram.
His Function study integrates concerns from other disciplines, such as Simple, Image, Bounding overwatch, Consistency and Calculus.
His most cited work include:
- Combinatorial Cardinal Characteristics of the Continuum (268 citations)
- Abstract state machines capture parallel algorithms (140 citations)
- On the unique satisfiability problem (133 citations)
What are the main themes of his work throughout his whole career to date?
Andreas Blass mainly investigates Discrete mathematics, Combinatorics, Algebra, Pure mathematics and Theoretical computer science.
Andreas Blass combines subjects such as Axiom of choice, Group and Calculus with his study of Discrete mathematics.
The study of Combinatorics is intertwined with the study of Continuum in a number of ways.
His research on Algebra often connects related areas such as Algebra over a field.
His work in Pure mathematics is not limited to one particular discipline; it also encompasses Topos theory.
The various areas that Andreas Blass examines in his Theoretical computer science study include Computation, Abstract state machines and Search algorithm.
He most often published in these fields:
- Discrete mathematics (43.62%)
- Combinatorics (35.11%)
- Algebra (18.09%)
What were the highlights of his more recent work (between 2009-2020)?
- Theoretical computer science (9.57%)
- Discrete mathematics (43.62%)
- Calculus (6.38%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Theoretical computer science, Discrete mathematics, Calculus, Algebra and Algorithm.
His biological study spans a wide range of topics, including Computation, Interval, Compression and Extension.
His Discrete mathematics research includes themes of Distribution, Connection and Analytic proof.
In the subject of general Algebra, his work in Unification and Categorical logic is often linked to Geometric Brownian motion and Flatness, thereby combining diverse domains of study.
His work on Abstract state machines as part of his general Algorithm study is frequently connected to Very-large-scale integration, Grid and Single chip, thereby bridging the divide between different branches of science.
His Function research also works with subjects such as
- Continuum that intertwine with fields like Ultrafilter,
- Independence that connect with fields like Combinatorics.
Between 2009 and 2020, his most popular works were:
- Combinatorial Cardinal Characteristics of the Continuum (268 citations)
- Content-dependent chunking for differential compression, the local maximum approach (45 citations)
- Fields of Logic and Computation (28 citations)
In his most recent research, the most cited papers focused on:
- Algebra
- Combinatorics
- Real number
His primary scientific interests are in Theoretical computer science, Pure mathematics, Algorithm, Abstract state machines and Calculus.
His Theoretical computer science research is multidisciplinary, relying on both Differential, Computation and Artificial intelligence.
His Pure mathematics research includes elements of Property, Mathematical proof, Construct and Forcing.
The Algorithm study which covers Representation theorem that intersects with Function.
His studies in Function integrate themes in fields like Natural number, Combinatorics, Independence, Set and Complement.
The Abstract state machines study combines topics in areas such as Sequential algorithm, State and Subroutine.
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.
