Gabriel Nivasch

Orcid: 0000-0001-5960-4253

Affiliations:
  • Ariel University, Israel


According to our database1, Gabriel Nivasch authored at least 27 papers between 2004 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Generalized fusible numbers and their ordinals.
Ann. Pure Appl. Log., January, 2024

2023
Ordinals and recursive algorithms.
CoRR, 2023

2022
Learning Convex Polyhedra With Margin.
IEEE Trans. Inf. Theory, 2022

Fusible numbers and Peano Arithmetic.
Log. Methods Comput. Sci., 2022

2021
Some <i>i</i>-Mark games.
Theor. Comput. Sci., 2021

Homotopic curve shortening and the affine curve-shortening flow.
J. Comput. Geom., 2021

Upper bounds for stabbing simplices by a line.
Discret. Appl. Math., 2021

Nested Barycentric Coordinate System as an Explicit Feature Map.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Grid Peeling and the Affine Curve-Shortening Flow.
Exp. Math., 2020

Some i-Mark games.
CoRR, 2020

2018
Learning convex polytopes with margin.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Classifying unavoidable Tverberg partitions.
J. Comput. Geom., 2017

2016
One-sided epsilon-approximants.
CoRR, 2016

2015
Rainbow matchings and algebras of sets.
Electron. Notes Discret. Math., 2015

On the zone of a circle in an arrangement of lines.
Electron. Notes Discret. Math., 2015

A Variant of the Hadwiger-Debrunner (p, q)-Problem in the Plane.
Discret. Comput. Geom., 2015

2014
The visible perimeter of an arrangement of disks.
Comput. Geom., 2014

2013
The number of distinct distances from a vertex of a convex polygon.
J. Comput. Geom., 2013

2012
Upper bounds for centerlines.
J. Comput. Geom., 2012

2010
Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations.
J. ACM, 2010

Stabbing Simplices by Points and Flats.
Discret. Comput. Geom., 2010

2009
Weak epsilon-nets, Davenport-Schinzel sequences, and related problems
PhD thesis, 2009

Eppstein's bound on intersecting triangles revisited.
J. Comb. Theory, Ser. A, 2009

Lower bounds for weak epsilon-nets and stair-convexity.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Weak ε-nets and interval chains.
J. ACM, 2008

2006
The Sprague-Grundy function of the game Euclid.
Discret. Math., 2006

2004
Cycle detection using a stack.
Inf. Process. Lett., 2004


  Loading...