| 2009 |
|---|
| 13 | EE | Jennie C. Hansen,
Jerzy Jaworski:
A random mapping with preferential attachment.
Random Struct. Algorithms 34(1): 87-111 (2009) |
| 2008 |
|---|
| 12 | EE | Jennie C. Hansen,
Jerzy Jaworski:
Random mappings with exchangeable in-degrees.
Random Struct. Algorithms 33(1): 105-126 (2008) |
| 2007 |
|---|
| 11 | EE | Jennie C. Hansen,
Jerzy Jaworski:
A cutting process for random mappings.
Random Struct. Algorithms 30(1-2): 287-306 (2007) |
| 2006 |
|---|
| 10 | EE | Jennie C. Hansen,
Eric Schmutz,
Li Sheng:
The Expected Size of the Rule k Dominating Set.
Algorithmica 46(3-4): 409-418 (2006) |
| 2005 |
|---|
| 9 | EE | Jennie C. Hansen,
Eric Schmutz:
Comparison of Two CDS Algorithms on Random Unit Ball Graphs.
ALENEX/ANALCO 2005: 206-211 |
| 2004 |
|---|
| 8 | EE | Jennie C. Hansen,
Marek Kubale,
Lukasz Kuszner,
Adam Nadolski:
Distributed Largest-First Algorithm for Graph Coloring.
Euro-Par 2004: 804-811 |
| 7 | EE | Jennie C. Hansen,
Eric Schmutz:
The Expected Size of the Rule k Dominating Set
CoRR cs.DM/0408067: (2004) |
| 6 | EE | Jennie C. Hansen,
Eric Schmutz,
Li Sheng:
Probabilistic Analysis of Rule 2
CoRR cs.DM/0408068: (2004) |
| 2001 |
|---|
| 5 | EE | Jennie C. Hansen,
Eric Schmutz:
Near-Optimal Bounded-Degree Spanning Trees.
Algorithmica 29(1): 148-180 (2001) |
| 2000 |
|---|
| 4 | | Jennie C. Hansen,
Jerzy Jaworski:
Large components of bipartite random mappings.
Random Struct. Algorithms 17(3-4): 317-342 (2000) |
| 1997 |
|---|
| 3 | | Jennie C. Hansen:
Limit Laws for the Optimal Directed Tree with Random Costs.
Combinatorics, Probability & Computing 6(3): 315-335 (1997) |
| 1994 |
|---|
| 2 | | Jennie C. Hansen:
Order Statistics for Decomposable Combinatorial Structures.
Random Struct. Algorithms 5(4): 517-534 (1994) |
| 1993 |
|---|
| 1 | | Jennie C. Hansen:
Factorization in Fq(x) and Brownian Motion.
Combinatorics, Probability & Computing 2: 285-299 (1993) |
