Conference paper
Improving throughput via slowdowns
Maayan Goldstein, Onn Shehory, et al.
ICSE 2010
While graphs are normally defined in terms of the 2-place relation of adjacency, we take the 3-place relation of interception as the basic primitive of their definition. The paper views graphs as an economical scheme for encoding interception relations, and establishes an axiomatic characterization of relations that lend themselves to representation in terms of graph interception, thus providing a new characterization of graphs. © 1996 John Wiley & Sons, Inc.
Maayan Goldstein, Onn Shehory, et al.
ICSE 2010
Yarden Nir-Buchbinder, Shmuel Ur
ESEC/FSE 2007
Eitan Farchi, Yarden Nir, et al.
IPDPS 2003
Yaniv Eytani, Rachel Tzoref, et al.
ICSTW 2008