Demo Data from VLDB 2026 / reviewers in the wild / expert
Jürgen Weiss
dblp:21/5994
· DBLP profile ↗
4ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 2 first-authorSystems, architecture and hardware · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Mathematical optimization · 47% Computational complexity · 41% Algorithms and data structures · 12% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
circuit complexity |
0.0 | 1 | 1983 | An n^3/2 Lower Bound on the Monotone Network Complexity of the Boolean Convolution · Inf. Control. 1983 |
Mathematical optimization › iterative methods
descent algorithm |
0.0 | 1 | 1979 | A Fast-Converging Algorithm for Nonlinear Mapping of High-Dimensional Data to a Plane · IEEE Trans. Computers 1979 |
Mathematical optimization
gradient descent |
0.0 | 1 | 1979 | A Fast-Converging Algorithm for Nonlinear Mapping of High-Dimensional Data to a Plane · IEEE Trans. Computers 1979 |
Algorithms and data structures
convolution |
0.0 | 1 | 1983 | An n^3/2 Lower Bound on the Monotone Network Complexity of the Boolean Convolution · Inf. Control. 1983 |
Methods — techniques the papers use, named apart from their topics
complexity lower bounds · 0.0iterative descent · 0.0coordinate descent · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | Homogeneous Bivariate Decompositions
Joachim von zur Gathen, Jürgen Weiss |
J. Symb. Comput. | 2 |
| 1992 | Homogeneous Decomposition of PolynomialsabstractWe present an algorithm for the homogeneous decomposition of univariate polynomials: given a polynomial f with coefficients in a field K of characteristic O, construct a decomposition of the form ~= g(hl, hz) with homogeneous polynomial g c K[3, y] and polynomials hl, hz 6 K[z].Furthermore we examine the relationship between the homogeneous decomposition of I and the decomposition of rational functions F = f/g, which are generated as quotients of ~and an arbitrary polynomial 9. Jürgen Weiss |
ISSAC | 1 |
| 1983 | An n^3/2 Lower Bound on the Monotone Network Complexity of the Boolean Convolution
Jürgen Weiss |
Inf. Control. | 1 |
| 1979 | A Fast-Converging Algorithm for Nonlinear Mapping of High-Dimensional Data to a PlaneabstractAn iterative algorithm for nonlinear mapping of high-dimensional data is developed. The step size of the descent algorithm is chosen to assure convergence. Steepest descent and Coordinate descent are treated. The algorithm is applied to artificial and real data to demonstrate its excellent convergence properties. Heinrich Niemann, Jürgen Weiss |
IEEE Trans. Computers | 2 |