Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Christoph Berkholz
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Tight Upper and Lower Bounds on the Path Length of Binary Trees
SIAM Journal on Computing
Mathematics
Computer Science
Some Lower Bounds for the Complexity of Continuation Methods
Journal of Complexity
Control
Numerical Analysis
Statistics
Probability
Algebra
Applied Mathematics
Number Theory
Optimization
Mathematics
Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm
Information Processing Letters
Signal Processing
Computer Science Applications
Information Systems
Theoretical Computer Science
Tight RMR Lower Bounds for Mutual Exclusion and Other Problems
Lower and Upper Bounds for Cohen-Macaulay Dimension
Bulletin of the Australian Mathematical Society
Mathematics
Upper and Lower Bounds for Ranks of the Matrix ExpressionX-XAX
Abstract and Applied Analysis
Applied Mathematics
Analysis
Robust Randomness Amplifiers: Upper and Lower Bounds
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Lower Bounds for the Linear Complexity of Sequences Over Residue Rings
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Lower and Upper Bounds for the Time Constant of First-Passage Percolation
Combinatorics Probability and Computing
Statistics
Probability
Applied Mathematics
Mathematics
Computational Theory
Theoretical Computer Science
