Shay Solomon

From MaRDI portal
Person:427886

Available identifiers

zbMath Open solomon.shayMaRDI QIDQ427886

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61262292024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q61263412024-04-09Paper
Can't See the Forest for the Trees2024-03-26Paper
https://portal.mardi4nfdi.de/entity/Q60834022023-12-08Paper
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time2023-10-31Paper
https://portal.mardi4nfdi.de/entity/Q60758912023-09-20Paper
https://portal.mardi4nfdi.de/entity/Q58745392023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q50911652022-07-21Paper
Truly Optimal Euclidean Spanners2022-04-20Paper
https://portal.mardi4nfdi.de/entity/Q50096422021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50027032021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q50027742021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q49933222021-06-15Paper
Fully Dynamic MIS in Uniformly Sparse Graphs2021-05-03Paper
Improved Dynamic Graph Coloring2021-05-03Paper
The Greedy Spanner Is Existentially Optimal2020-04-16Paper
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time2019-10-15Paper
On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem2019-09-17Paper
Fully dynamic maximal independent set with sublinear update time2019-08-22Paper
Fast Constructions of Light-Weight Spanners for General Graphs2019-05-15Paper
Fast Constructions of Lightweight Spanners for General Graphs2018-11-05Paper
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem2018-11-05Paper
On an infinite family of solvable Hanoi graphs2018-11-05Paper
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching2018-10-30Paper
Optimal Euclidean Spanners2018-08-02Paper
Local-on-Average Distributed Tasks2018-07-16Paper
Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach2018-07-16Paper
Light spanners for Snowflake Metrics2018-04-23Paper
Euclidean Steiner Shallow-Light Trees2018-04-23Paper
The Greedy Spanner is Existentially Optimal2017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53650842017-09-29Paper
Euclidean Steiner shallow-light trees2017-03-30Paper
New Doubling Spanners: Better and Simpler2017-01-13Paper
Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones2015-08-18Paper
Light Spanners2015-07-31Paper
From hierarchical partitions to hierarchical covers2015-06-26Paper
Balancing Degree, Diameter, and Weight in Euclidean Spanners2014-12-22Paper
Sparse Euclidean Spanners with Tiny Diameter2014-12-05Paper
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching2014-08-07Paper
Optimal euclidean spanners2014-08-07Paper
Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones2014-07-30Paper
Light Spanners2014-07-01Paper
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds2014-07-01Paper
New Doubling Spanners: Better and Simpler2013-08-06Paper
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light2012-08-22Paper
The tower of Hanoi problem on Path\(_h\) graphs2012-06-18Paper
Narrow-Shallow-Low-Light Trees with and without Steiner Points2011-10-27Paper
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light2011-08-12Paper
Balancing Degree, Diameter, and Weight in Euclidean Spanners2010-09-06Paper
Low-light trees, and tight lower bounds for Euclidean spanners2010-05-21Paper
Narrow-Shallow-Low-Light Trees with and without Steiner Points2009-10-29Paper
https://portal.mardi4nfdi.de/entity/Q35367642008-11-21Paper
Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules2008-04-24Paper
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem2008-03-07Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Shay Solomon