Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Limor Lahiani

dblp:89/1548 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Computer networks · 2Security and privacy · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Distributed computing theory · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Computer networks
1 paper
Wireless networking · 100%
Network and information security
1 paper
Cryptographic protocols and secure computation · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed computing theory
distributed algorithms
0.122005
Brief announcement: virtual stationary automata for mobile networks · PODC 2005
Brief announcement: polygonal broadcast, secret maturity and the firing sensors · PODC 2004
Wireless networking
mobile ad hoc networks
0.112005
Brief announcement: virtual stationary automata for mobile networks · PODC 2005
Distributed systems
dynamic network
0.112005
Brief announcement: virtual stationary automata for mobile networks · PODC 2005
Distributed systems
fault tolerance
0.112005
Brief announcement: virtual stationary automata for mobile networks · PODC 2005
Distributed computing theory
broadcast
0.012004
Brief announcement: polygonal broadcast, secret maturity and the firing sensors · PODC 2004
Cryptographic protocols and secure computation
secret sharing
0.012004
Brief announcement: polygonal broadcast, secret maturity and the firing sensors · PODC 2004

Methods — techniques the papers use, named apart from their topics

virtual automata · 0.2emulation · 0.2distributed algorithm design · 0.1
YearPublicationVenuePosition
2013 Unique permutation hashing
Shlomi Dolev, Limor Lahiani, Yinnon A. Haviv
Theor. Comput. Sci.2
2012 Secret swarm unit: Reactive k-secret sharing
Shlomi Dolev, Limor Lahiani, Moti Yung
Ad Hoc Networks2
2009 Brief Announcement: Unique Permutation Hashing
Shlomi Dolev, Limor Lahiani, Yinnon A. Haviv
SSS2
2006 Polygonal broadcast, secret maturity, and the firing sensors
Shlomi Dolev, Ted Herman, Limor Lahiani
Ad Hoc Networks3
2005 Timed Virtual Stationary Automata for Mobile Networks
Shlomi Dolev, Seth Gilbert, Limor Lahiani, Nancy A. Lynch, Tina Nolte
OPODIS3
2005 Brief announcement: virtual stationary automata for mobile networks
abstract
The task of designing algorithms for constantly changing networks is difficult. We focus on mobile ad-hoc networks, where mobile processors attempt to coordinate despite minimal infrastructure support. We develop new techniques to cope with this dynamic, heterogeneous, and chaotic environment. We mask the unpredictable behavior of mobile networks by defining and emulating a virtual infrastructure, consisting of timing-aware and location-aware machines at fixed locations, that mobile nodes can interact with. The static virtual infrastructure allows appplication developers to use simpler algorithms — including many previously developed for fixed networks. Virtual Stationary Automata programming layer. Our programming abstraction consists of a static infrastructure of fixed, timed virtual machines with an explicit notion of real time, called Virtual Stationary Automata (VSAs), distributed at known locations over the plane, and emulated by the real mobile nodes in the system. Each VSA represents a predetermined geographic area and has broadcast capabilities similar to those of the mobile nodes, allowing nearby VSAs and mobile nodes to communicate with one another. This programming layer provides mobile nodes with a virtual infrastructure with which to coordinate their actions. Many practical algorithms depend significantly on timing, and it is reasonable to assume that many mobile nodes have access to reasonably synchronized clocks. In the VSA programming layer, the virtual automata also have access to virtual clocks, guaranteed to not drift too far from real time. Our virtual infrastructure differs in key ways from others that have previously been proposed for mobile ad-hoc networks. The GeoQuorums algorithm [2] was the first to use virtual nodes; the virtual nodes in that work are atomic objects at fixed geographical locations. More general virtual mobile automata were suggested in [1]; our automata are more powerful than those in [1] in that ours include timing capabilities, which are important for many applications. Also, our automata are stationary, and are arranged in a connected pattern that is similar to a traditional wired ne-
Shlomi Dolev, Limor Lahiani, Seth Gilbert, Nancy A. Lynch, Tina Nolte
PODC2
2004 Brief announcement: polygonal broadcast, secret maturity and the firing sensors
abstract
No abstract available.
Shlomi Dolev, Ted Herman, Limor Lahiani
PODC3