Jonathan Tidor

Orcid: 0000-0001-6371-0657

According to our database1, Jonathan Tidor authored at least 11 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Spherical Two-Distance Sets and Eigenvalues of Signed Graphs.
Comb., April, 2023

Cubic Goldreich-Levin.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Testing Linear-Invariant Properties.
SIAM J. Comput., 2022

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
A counterexample to the Bollobás-Riordan conjectures on sparse graph limits.
Comb. Probab. Comput., 2021

2020
Algorithms and Lower Bounds for the Worker-Task Assignment Problem.
CoRR, 2020

2019
Induced arithmetic removal: complexity 1 patterns over finite fields.
CoRR, 2019

2018
Spectral methods for testing cluster structure of graphs.
CoRR, 2018

2017
Dense binary PG(t - 1, 2)-free matroids have critical number t - 1 or t.
J. Comb. Theory B, 2017

2014
Convex geometric (k+2)-quasiplanar representations of semi-bar k-visibility graphs.
Discret. Math., 2014

Bounding Sequence Extremal Functions with Formations.
Electron. J. Comb., 2014


  Loading...