Jump to content

Draft:Shakhar Smorodinsky

From Wikipedia, the free encyclopedia
  • Comment: No significant coverage. Sources consists of profiles, minor mentions, and unreliable sources. Suggest refer WP:42 and WP:NPROF. Mme Maigret (talk) 11:14, 2 August 2026 (UTC)

Shakhar Smorodinsky (born September 1, 1970) is an Israeli computer scientist and mathematician, and a professor at Ben-Gurion University of the Negev. His research is in computational geometry, combinatorics, discrete mathematics, and theoretical computer science, including geometric hypergraphs, ε-nets, VC dimension, and conflict-free coloring. He has served as Chair of the Institute for the Theory of Computing at Ben-Gurion University of the Negev.[1][2][3]

Education

[edit]

Smorodinsky studied at Tel Aviv University, where he earned a B.Sc. in Mathematics and Computer Science in 1992 and an M.Sc. in Computer Science in 1998. He received a Ph.D. in Computer Science from Tel Aviv University in 2003, under the supervision of Micha Sharir, with a dissertation on combinatorial problems in computational geometry.[2]

Academic career

[edit]

After his doctoral studies, Smorodinsky held postdoctoral and research positions at institutions including ETH Zurich, the Courant Institute of Mathematical Sciences at New York University, and the Hebrew University of Jerusalem. He was awarded an NSF Mathematical Sciences Postdoctoral Research Fellowship for 2004–2006.[1][2]

He joined Ben-Gurion University of the Negev in 2007, first in the Department of Mathematics and later in the Faculty of Computer Science. Since 2025, he has served as Chair of the Institute for the Theory of Computing in the Faculty of Computer Science at Ben-Gurion University of the Negev.[1][2]

Research

[edit]

Smorodinsky's research is at the intersection of computational geometry, combinatorics, and theoretical computer science. His publications include work on geometric hypergraphs, range spaces, ε-nets, VC-dimension, incidence and intersection problems, and combinatorial geometry.[3][4]

A major theme in his work is conflict-free coloring. In a 2003 paper with Guy Even, Zvi Lotker, and Dana Ron, he studied conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks.[5][6] Later surveys and follow-up papers describe conflict-free coloring as a notion arising in frequency assignment, sensor networks, RFID protocols, and related algorithmic and combinatorial settings.[7][8] This line of work helped establish conflict-free coloring as a research area in computational geometry, graph theory, algorithms, and discrete mathematics.

Smorodinsky was one of the co-authors of a solution to Ringel's circle problem, together with James Davies, Chaya Keller, Linda Kleist, and Bartosz Walczak.[9] The result was discussed by Gil Kalai on his blog Combinatorics and More, which described it as a solution to Ringel's circle problem.[10]

In joint work with Noga Alon, Smorodinsky introduced and studied an extended VC-dimension framework and proved Radon- and Tverberg-type theorems for unions of convex sets.[11][12] The work settled a problem posed by Gil Kalai concerning Radon-type theorems for unions of convex sets. Kalai discussed the development in a 2025 blog post.[13][14]

Awards and honors

[edit]

Smorodinsky received the NSF Mathematical Sciences Postdoctoral Research Fellowship for 2004–2006 and the Deutsch Prize for outstanding graduate research at Tel Aviv University in 2003. He also received the Raindrop Geomagic Award at the Symposium on Computational Geometry in 2000.[1][2]

He has received several research grants, including grants from the Israel Science Foundation and a joint BSF–NSF research grant.[2]

Selected publications

[edit]
  • Even, G.; Lotker, Z.; Ron, D.; Smorodinsky, S. "Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks." SIAM Journal on Computing 33(1): 94–136, 2003/2004.[5]
  • Smorodinsky, S. "Conflict-Free Coloring and its Applications." In Geometry: Intuitive, Discrete, and Convex, 2013/2014.[8]
  • Davies, J.; Keller, C.; Kleist, L.; Smorodinsky, S.; Walczak, B. "A Solution to Ringel's Circle Problem."[9]
  • Alon, N.; Smorodinsky, S. "Extended VC-dimension, and Radon and Tverberg Type Theorems for Unions of Convex Sets."[11]

References

[edit]
  1. 1 2 3 4 "Shakhar Smorodinsky". Ben-Gurion University of the Negev. Retrieved 24 June 2026.
  2. 1 2 3 4 5 6 "Shakhar Smorodinsky". Ben-Gurion University Research Portal. Retrieved 24 June 2026.
  3. 1 2 "Shakhar Smorodinsky". DBLP Computer Science Bibliography. Retrieved 24 June 2026.
  4. ↑ "Shakhar Smorodinsky - Google Scholar". Google Scholar. Retrieved 24 June 2026.
  5. 1 2 "Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks". SIAM Journal on Computing. Retrieved 24 June 2026.
  6. ↑ "Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks". Tel Aviv University Research Portal. Retrieved 24 June 2026.
  7. ↑ "Conflict-Free Coloring and its Applications". arXiv. Retrieved 24 June 2026.
  8. 1 2 "Conflict-Free Coloring and its Applications". Springer. Retrieved 24 June 2026.
  9. 1 2 "A Solution to Ringel's Circle Problem". arXiv. Retrieved 24 June 2026.
  10. ↑ Gil Kalai. "Ringel Circle Problem Solved". Combinatorics and More. Retrieved 24 June 2026.
  11. 1 2 "Extended VC-dimension, and Radon and Tverberg Type Theorems for Unions of Convex Sets". arXiv. Retrieved 24 June 2026.
  12. ↑ "Extended VC-dimension, and Radon and Tverberg Type Theorems for Unions of Convex Sets". Ben-Gurion University Research Portal. Retrieved 24 June 2026.
  13. ↑ Gil Kalai. "Shakhar Smorodinsky's Solution to a Radon-Type Problem". Combinatorics and More. Retrieved 24 June 2026.
  14. ↑ "Combinatorics Seminar - Shakhar Smorodinsky". Tel Aviv University. Retrieved 24 June 2026.
[edit]

Category:1970 births Category:Living people Category:Israeli computer scientists Category:Israeli mathematicians Category:Ben-Gurion University of the Negev Category:Tel Aviv University alumni

Retrieved from "https://en.wikipedia.org/w/index.php?title=Draft:Shakhar_Smorodinsky&oldid=1367324279"