#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1990

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Alan M. Frieze, Stephen Suen
- J. Algorithms
- 1996

We consider the performance of two algorithms, GUC and SC studied by Chao and Franco [2], [3], and Chvatal and Reed [4], when applied to a random instance u of a boolean formula in conjunctive normalâ€¦ (More)

- Chamara Gunaratne, Kenneth J. Christensen, Bruce Nordman, Stephen Suen
- IEEE Transactions on Computers
- 2008

The rapidly increasing energy consumption by computing and communications equipment is a significant economic and environmental problem that needs to be addressed. Ethernet network interfaceâ€¦ (More)

- W. Edwin Clark, Stephen Suen
- Electr. J. Comb.
- 2000

Let Î³(G) denote the domination number of a graph G and let G H denote the Cartesian product of graphs G and H. We prove that Î³(G)Î³(H) â‰¤ 2Î³(G H) for all simple graphs G and H. 2000 Mathematics Subjectâ€¦ (More)

- Chamara Gunaratne, Kenneth J. Christensen, Stephen Suen
- IEEE Globecom 2006
- 2006

Rapidly increasing energy use by computing and communications equipment is a significant problem that needs to be addressed. Ethernet network interface controllers (NICs) consume hundreds of millionsâ€¦ (More)

- Paul ErdÃ¶s, Stephen Suen, Peter Winkler
- Random Struct. Algorithms
- 1995

- Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen
- Random Struct. Algorithms
- 1995

Abstra t We onsider the following randomized algorithm for nding a mat hingM in an arbitrary graph G = (V;E). Repeatedly, hoose a random vertex u, then a random neighbour v of u. Add edge fu; vg to Mâ€¦ (More)

- Stephen Suen
- Random Struct. Algorithms
- 1990

We consider non-overlapping subgraphs of fixed order in the random graph K n , p ( n ) . Fix a strictly strongly balanced graph G. A subgraph of Kn,p(n) isomorphic to G is called a G-subgraph. Let Xâ€¦ (More)

- Alan M. Frieze, Stephen Suen
- Random Struct. Algorithms
- 1994

We show that as n â€”> oo, the independence number c*(G), for almost all 3-regular graphs G on n vertices, is at least (61og(3/2) â€” 2 â€” e)n, for any constant e > 0. We prove this by analyzing a greedyâ€¦ (More)

- Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
- SODA
- 1994

Given a graph G = (V, E) with n vertices, and m edges, and a set of K. pairs of vertices in V, we are interested in finding for each pair (ei,bi), a path connecting a; to bi, such that the set of Kâ€¦ (More)

- Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
- SODA
- 1996

Given a graph G = (V, E) and a set of pairs of vertices in V, we are interested in finding for each pair (ui, b;) a path connecting ai to bi, such that the set of paths so found is vertex-disjoint,â€¦ (More)