Author image not provided
 Yefim Dinitz

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article3.62
Citation Count105
Publication count29
Publication years1992-2017
Available for download7
Average downloads per article305.57
Downloads (cumulative)2,139
Downloads (12 Months)67
Downloads (6 Weeks)5
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


29 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 29
Result page: 1 2

Sort by:

1
January 2017 Journal of Discrete Algorithms: Volume 42 Issue C, January 2017
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

We consider the single-source shortest paths problem in a digraph with negative edge costs allowed. A hybrid of the BellmanFord and Dijkstra algorithms is suggested, improving the running time bound of BellmanFord for graphs with a sparse distribution of negative cost edges. The algorithm iterates Dijkstra several times without re-initializing ...
Keywords: Graph, Algorithm, Negative edge, Shortest path

2
September 2012 WABI'12: Proceedings of the 12th international conference on Algorithms in Bioinformatics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We generalize some current approaches for RNA tree alignment, which are traditionally confined to ordered rooted mappings, to also consider unordered unrooted mappings. We define the Homeomorphic Subtree Alignment problem, and present a new algorithm which applies to several modes, including global or local, ordered or unordered, and rooted or ...

3
June 2010 Discrete & Computational Geometry: Volume 43 Issue 4, June 2010
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T)=O(kźn1/k)źw(MST(M)), and a spanning tree Tź with weight w(Tź)=O(k)źw(MST(M)) and unweighted diameter O(kźn1/k). These trees also achieve an optimal maximum degree. Furthermore, we demonstrate that ...
Keywords: Euclidean spanners, Computational geometry, Approximation algorithms, Hop-diameter, Low distortion embeddings

4
June 2010 Discrete & Computational Geometry: Volume 43 Issue 4, June 2010
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 4

We show that for every n -point metric space M and positive integer  k , there exists a spanning tree  T with unweighted diameter O ( k ) and weight w ( T )= O ( k ⋅ n 1/ k )⋅ w ( MST ( M )), and a ...
Keywords: Computational geometry, Hop-diameter, Low distortion embeddings, Euclidean spanners

5
October 2008 FOCS '08: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 8

We show that for every $n$-point metric space $M$ and positiveinteger $k$, there exists a spanning tree $T$ with unweighteddiameter $O(k)$ and weight $w(T) = O(k \cdot n^{1/k}) \cdotw(MST(M))$, and a spanning tree $T'$ with weight $w(T') = O(k) \cdotw(MST(M))$ and unweighted diameter $O(k \cdot n^{1/k})$. Moreover,there is a designated ...
Keywords: Computational Geometry, Euclidean Spanners, Low-Distortion Embeddings, Spanners

6 published by ACM
July 2008 ACM Transactions on Algorithms (TALG): Volume 4 Issue 3, June 2008
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 0,   Downloads (12 Months): 11,   Downloads (Overall): 543

Full text available: PDFPDF
We study the Bottleneck Tower of Hanoi puzzle posed by D. Wood in 1981. There, a relaxed placement rule allows a larger disk to be placed higher than a smaller one if their size difference is less than a pregiven value k . A shortest sequence of moves (optimal algorithm) ...
Keywords: Optimality proofs, Tower of Hanoi

7 published by ACM
February 2008 Journal of the ACM (JACM): Volume 55 Issue 1, February 2008
Publisher: ACM
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 495

Full text available: PDFPDF
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed but have distinct identities, taken from {0, 1,… , M − 1}. We investigate the communication costs of three well studied tasks: Consensus, ...
Keywords: Distributed computing, bit complexity, consensus, processor ring, symmetric synchronous execution, tight bound, communication complexity, communication cost, leader election, lower bounds, message complexity, processor chain

8
October 2007 Theoretical Computer Science: Volume 384 Issue 2-3, October, 2007
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 1

The concept of distributed communication bit complexity was introduced by Dinitz, Rajsbaum, and Moran. They studied the bit complexity of Consensus and Leader Election, arriving at more or less exact bounds. This paper answers two questions on Leader Election, which remained there open. The first is to close the gap ...
Keywords: Leader election, Absolute bound, Bit complexity, Distributed computing

9
January 2007 SOFSEM '07: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed <em>higher than</em>a smaller one if their size difference is less than <em>k</em>. In 1992, D. Poole suggested a natural disk-moving strategy for this ...

10
December 2006 ISAAC'06: Proceedings of the 17th international conference on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

We study generalizations of the Tower of Hanoi (ToH) puzzle with relaxed placement rules. In 1981, D. Wood suggested a variant, where a bigger disk may be placed higher than a smaller one if their size difference is less than k . In 1992, D. Poole suggested a natural disk-moving ...

11
January 2006 Theoretical Computer Science: essays in Memory of Shimon Even
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 10

This paper is devoted to the max-flow algorithm of the author: to its original version, which turned out to be unknown to non-Russian readers, and to its modification created by Shimon Even and Alon Itai; the latter became known worldwide as “Dinic's algorithm”. It also presents the origins of the ...

12
May 2005 SIROCCO'05: Proceedings of the 12th international conference on Structural Information and Communication Complexity
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

The concept of distributed communication bit complexity was introduced by Dinitz, Rajsbaum, and Moran. They studied bit complexity of Consensus and Leader Election, arriving at more or less exact bounds. This paper answers two questions on Leader Election, which remained open. The first is to close the gap between the ...

13
April 2003 Journal of Discrete Algorithms: Volume 1 Issue 2, April 2003
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 4

We continue the study of communication costs of Consensus and Leader initiated in a previous paper. We deal with all scenarios with linear complexity in a tree topology, and prove exact (as opposed to asymptotic) tight bounds for the bit and message complexities. A particular scenario depends on whether the ...
Keywords: message complexity, bit complexity, consensus, distributed computing, communication complexity, leader election

14
June 2001 WG '01: Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

The 2-level cactus introduced by Dinitz and Nutov in [5] is a data structure that represents the minimum and minimum+1 edgecuts of an undirected connected multi-graph G in a compact way. In this paper, we study planarity of the 2-level cactus, which can be used, e.g., in graph drawing. We ...

15
September 2000 Theoretical Computer Science: Volume 247 Issue 1-2, Aug. 28 2000
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 1

Keywords: connection network, edge-disjoint paths, totalk-distance, communication network, flow in networks, totalk-diameter

16
July 2000 SWAT '00: Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Two vertices of an undirected graph are called k -edge-connected if there exist k edge-disjoint paths between them. The equivalence classes of this relation are called k -edge-connected classes, or k -classes for short. This paper shows how to check whether two vertices belong to the same 5-class of an ...

17
May 2000 SIAM Journal on Computing: Volume 30 Issue 3, 2000
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0

Let G =( V , E ) be an undirected graph, S be a subset of its vertices, ${\frak C}_S$ be the set of minimum edge-cuts partitioning S , and $\lambda_S$ be the cardinality of such a cut. We suggest a graph structure, called the connectivity carcass of S , ...
Keywords: dynamic algorithms, graph structures, minimum cuts, incremental maintenance, edge-connectivity

18
July 1999 Journal of Algorithms: Volume 32 Issue 1, July 1999
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 2

The problem of finding a minimum weight k-vertex connected spanning subgraph in a graph G=(V,E) is considered. For k�2, this problem is known to be NP-hard. Based on the paper of Auletta, Dinitz, Nutov, and Parente in this issue, we derive a 3-approximation algorithm for k�{4,5}. This improves the best ...

19
July 1999 Journal of Algorithms: Volume 32 Issue 1, July 1999
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 5

The problem of finding a minimum weight k-vertex connected spanning subgraph in a graph G=(V,E) is considered. For k�2, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs and of k-out-connected graphs (i.e., graphs which contain a vertex from which there exist k internally vertex-disjoint ...

20 published by ACM
June 1999 SPAA '99: Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 3,   Downloads (12 Months): 6,   Downloads (Overall): 233

Full text available: PdfPdf



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us