Jan Vybíral

Orcid: 0000-0002-8188-6717

Affiliations:
  • Czech Technical University in Prague, Czech Republic
  • Charles University, Prague, Czech Republic (former)


According to our database1, Jan Vybíral authored at least 29 papers between 2007 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Stefan Heinrich is the Winner of the 2024 Best Paper Award of the Journal of Complexity.
J. Complex., 2025

2024
Robust network formation with biological applications.
Networks Heterog. Media, 2024

A tight lower bound on the minimal dispersion.
Eur. J. Comb., 2024

Entropy numbers of finite-dimensional Lorentz space embeddings.
CoRR, 2024

2023
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 23351).
Dagstuhl Reports, 2023

A multivariate Riesz basis of ReLU neural networks.
CoRR, 2023

New lower bounds for the integration of periodic functions.
CoRR, 2023

2022
Lower bounds for integration and recovery in <i>L</i><sub>2</sub>.
J. Complex., 2022

Deterministic Constructions of High-Dimensional Sets with Small Dispersion.
Algorithmica, 2022

2021
Lower bounds for the error of quadrature formulas for Hilbert spaces.
J. Complex., 2021

Lower bounds for integration and recovery in L<sub>2</sub>.
CoRR, 2021

2020
On the volume of unit balls of finite-dimensional Lorentz spaces.
J. Approx. Theory, 2020

2019
The minimal k-dispersion of point sets in high dimensions.
J. Complex., 2019

A variant of Schur's product theorem and its applications.
CoRR, 2019

2018
An upper bound on the minimal dispersion.
J. Complex., 2018

Identification of Shallow Neural Networks by Fewest Samples.
CoRR, 2018

2017
Non-Asymptotic Analysis of ℓ<sub>1</sub>-Norm Support Vector Machines.
IEEE Trans. Inf. Theory, 2017

Sparse Proteomics Analysis - a compressed sensing-based approach for feature selection and classification of high-dimensional proteomics mass spectrometry data.
BMC Bioinform., 2017

2015
On some aspects of approximation of ridge functions.
J. Approx. Theory, 2015

2014
Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions.
J. Complex., 2014

2012
Learning Functions of Few Arbitrary Linear Parameters in High Dimensions.
Found. Comput. Math., 2012

2011
Johnson-Lindenstrauss lemma for circulant matrices.
Random Struct. Algorithms, 2011

Particle Systems and Kinetic Equations Modeling Interacting Agents in High Dimension.
Multiscale Model. Simul., 2011

On positive positive-definite functions and Bochner's Theorem.
J. Complex., 2011

Compressed learning of high-dimensional sparse functions.
Proceedings of the IEEE International Conference on Acoustics, 2011

2009
Corrigendum to the paper: "On approximation numbers of Sobolev embeddings of weighted function spaces" [J. Approx. Theory 136 (2005) 91-107].
J. Approx. Theory, 2009

2008
Widths of embeddings in function spaces.
J. Complex., 2008

Linear information versus function evaluations for L<sub>2</sub>-approximation.
J. Approx. Theory, 2008

2007
Sampling numbers and function spaces.
J. Complex., 2007


  Loading...