Tom'as Feder Nimrod Megiddo Serge A. Plotkin Parallel algorithms for various...  Home/Search
Context Related
| math.tau.ac.il/~megiddo/...soda94.ps.gz stanford.edu/plotkin/stabm.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tau.ac.il/~megiddo/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we consider networks made of gates of constant size. We focus of non-expansive networks (to be defined below). The problems of evaluating the gate to which a network converges, and of finding a stable configuration in a network, are quite simple in the context of sequential computation; they can all be solved in linear time in the scatter-free case (a special case, Mayr and Subramanian [5]), and in quadratic time in the general nonexpansive case (Feder [1]). An interesting question... (Update)
Context of citations to this paper: More
...the above iteration algorithm is quite straightforward. An algorithm to find a stable matching in O( parallel iterations was given in [17]; however that algorithm is more complicated and not efficient for realistic values of . We now address the second disadvantage of CCF,...
.... solving a stable marriage problem, and the best known parallel algorithm for the stable marriage problem, due to Feder, Megiddo, and Plotkin [6], has complexity O( # n log n) and uses n processors. Furthermore, this algorithm is extremely complicated: it is based on...
Cited by: More
Randomized Parallel Schedulers for Switch-Memory-Switch .. - Prakash, Aziz.. (2004) (Correct)
Parallel Algorithm for Output Queuing - Sadia (2002) (Correct)
Matching Output Queueing with a Combined Input Output.. - Chuang, Goel.. (1998) (Correct)
Similar documents (at the sentence level):
63.2%: A Sublinear Parallel Algorithm for Stable Matching - Tom'as Feder Nimrod (1994) (Correct)
Active bibliography (related documents): More All
0.2: The Computational Structure of Monotone Monadic SNP and.. - Feder, Vardi (1998) (Correct)
0.2: Sequential and Parallel Experimental Results with Bipartite.. - Setubal (1996) (Correct)
0.2: Matching Algorithms for Bipartite Graphs - Saip, Lucchesi (1993) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.2: Rj 5270 (54310) - Ma Research Nimrod (Correct)
0.1: The approximation of fixed points of compositions of.. - Bauschke (1994) (Correct)
0.1: The Existence and Uniqueness of the Minimum Norm Solution to.. - Ferreira (1996) (Correct)
Related documents from co-citation: More All
3: The Tiny Tera: a packet switch core - McKeown, Izzard et al. - 1997
2: Algorithms for providing bandwidth and delay guarantees in input-buffered crossb.. (context) - Charny, Krishna et al. - 1998
2: Performance of packet switches with input and output queueing (context) - Iliadis, Denzel - 1990
BibTeX entry: (Update)
T. Feder, N. Megiddo, and S. Plotkin. "A sublinear parallel algorithm for stable matching." Fifth ACM-SIAM Symposium on Discrete Algorithms, p. 632-637 (1994). http://citeseer.ist.psu.edu/article/feder94sublinear.html More
@article{ feder00sublinear,
author = "Tom{\'a}s Feder and Nimrod Megiddo and Serge A. Plotkin",
title = "A sublinear parallel algorithm for stable matching",
journal = "Theoretical Computer Science",
volume = "233",
number = "1--2",
pages = "297--308",
year = "2000",
url = "citeseer.ist.psu.edu/article/feder94sublinear.html" }
Citations (may not include all citations):140 Interior path following primal-dual algorithms, Part I: Line.. (context) - Monteiro, Adler - 1989
101 Pathways to the optimal set in linear programming (context) - Megiddo - 1988
73 A polynomial-- time algorithm for a class of linear compleme.. (context) - Kojima, Mizuno et al. - 1989
34 The Stable Marriage Problem: Structure and Algorithms (context) - Gusfield, Irving - 1989
12 The complexity of circuit value and network stability (context) - Mayr, Subramanian - 1992
12 A new approach to stable matching problems (context) - Subramanian - 1989
8 Stable Networks and Product Graphs (context) - Feder - 1991
5 Using interior-point methods for fast parallel algorithms fo.. - Goldberg, Plotkin et al. - 1992
Documents on the same site (http://www.math.tau.ac.il/~megiddo/pub.html): More
A General NP-Completeness Theorem - Megiddo (1993) (Correct)
On the Complexity of Some Geometric Problems in Unbounded Dimension - Megiddo (1990) (Correct)
A Unified Approach to Interior Point Algorithms for.. - Kojima, Megiddo.. (1991) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC