activity
20122024
most citedOverapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification

2 citations · 6 across the 6 of their papers we have counts for

collaborators

8 papers

cs.LO2024★ 2 cited

Overapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification

Petra Hozzová, Jaroslav Bendík, Alexander Nutz +1

The need to solve non-linear arithmetic constraints presents a major obstacle to the automatic verification of smart contracts. In this case study we focus on the two overapproxima…

cs.GT2018

Multi-Round Cooperative Search Games with Multiple Players

Amos Korman, Yoav Rodeh

Assume that a treasure is placed in one of boxes according to a known distribution and that searchers are searching for it in parallel during rounds. We study the quest…

cs.DC2017

Parallel Search with no Coordination

Amos Korman, Yoav Rodeh

We consider a parallel version of a classical Bayesian search problem. agents are looking for a treasure that is placed in one of the boxes indexed by according…

cs.AI2017★ 1 cited

The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback

Amos Korman, Yoav Rodeh

We introduce the dependent doors problem as an abstraction for situations in which one must perform a sequence of possibly dependent decisions, without receiving feedback informati…

cs.DS2016★ 2 cited

Searching Trees with Permanently Noisy Advice: Walking and Query Algorithms

Lucas Boczkowski, Uriel Feige, Amos Korman +1

We consider a search problem on trees in which the goal is to find an adversarially placed treasure, while relying on local, partial information. Specifically, each node in the tre…

cs.DC2016

Parallel Linear Search with no Coordination for a Randomly Placed Treasure

Amos Korman, Yoav Rodeh

In STOC'16, Fraigniaud et al. consider the problem of finding a treasure hidden in one of many boxes that are ordered by importance. That is, if a treasure is in a more important b…

cs.DC2015★ 1 cited

Parallel Exhaustive Search without Coordination

Pierre Fraigniaud, Amos Korman, Yoav Rodeh

We analyze parallel algorithms in the context of exhaustive search over totally ordered sets. Imagine an infinite list of "boxes", with a "treasure" hidden in one of them, where th…

cs.DC2012

Fast Rendezvous on a Cycle by Agents with Different Speeds

Ofer Feinerman, Amos Korman, Shay Kutten +1

The difference between the speed of the actions of different processes is typically considered as an obstacle that makes the achievement of cooperative goals more difficult. In thi…