2008 |
37 | EE | Carla D. Savage,
Ae Ja Yee:
Euler's partition theorem and the combinatorics of l-sequences.
J. Comb. Theory, Ser. A 115(6): 967-996 (2008) |
2006 |
36 | EE | Rudra Dutta,
Prashant Iyer,
Carla D. Savage:
Complexity of Converter Placement Supporting Broadcast in WDM Networks.
BROADNETS 2006 |
2005 |
35 | EE | Steffen Heber,
Carla D. Savage:
Common intervals of trees.
Inf. Process. Lett. 93(2): 69-74 (2005) |
2004 |
34 | EE | Charles E. Killian,
Carla D. Savage:
Antipodal Gray codes.
Discrete Mathematics 281(1-3): 221-236 (2004) |
33 | EE | Jerrold R. Griggs,
Charles E. Killian,
Carla D. Savage:
Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice.
Electr. J. Comb. 11(1): (2004) |
32 | EE | Sylvie Corteel,
Carla D. Savage:
Lecture hall theorems, q-series and truncated objects.
J. Comb. Theory, Ser. A 108(2): 217-245 (2004) |
31 | EE | Pawel Hitczenko,
Carla D. Savage:
On the Multiplicity of Parts in a Random Composition of a Large Integer.
SIAM J. Discrete Math. 18(2): 418-435 (2004) |
2003 |
30 | EE | Carla D. Savage,
Ian Shields,
Douglas B. West:
On the existence of Hamiltonian paths in the cover graph of M(n).
Discrete Mathematics 262(1-3): 241-252 (2003) |
29 | EE | Sylvie Corteel,
Carla D. Savage:
Anti-Lecture Hall Compositions.
Discrete Mathematics 263(1-3): 275-280 (2003) |
2002 |
28 | | Deborah A. Frank,
Carla D. Savage,
James A. Sellers:
On the Number of Graphical Forest Partitions.
Ars Comb. 65: (2002) |
27 | EE | Alexander Burstein,
Sylvie Corteel,
Alexander Postnikov,
Carla D. Savage:
A lattice path approach to counting partitions with minimum rank t.
Discrete Mathematics 249(1-3): 31-39 (2002) |
1999 |
26 | | Sylvie Corteel,
Boris Pittel,
Carla D. Savage,
Herbert S. Wilf:
On the multiplicity of parts in a random partition.
Random Struct. Algorithms 14(2): 185-197 (1999) |
1998 |
25 | EE | Jennifer M. Nolan,
Carla D. Savage,
Herbert S. Wilf:
Basis partitions.
Discrete Mathematics 179(1-3): 277-283 (1998) |
24 | EE | Carla D. Savage,
Cun-Quan Zhang:
The connectivity of acyclic orientation graphs.
Discrete Mathematics 184(1-3): 281-287 (1998) |
23 | EE | E. Rodney Canfield,
Sylvie Corteel,
Carla D. Savage:
Durfee Polynomials.
Electr. J. Comb. 5: (1998) |
22 | EE | Sylvie Corteel,
Carla D. Savage,
Herbert S. Wilf,
Doron Zeilberger:
A Pentagonal Number Sieve.
J. Comb. Theory, Ser. A 82(2): 186-192 (1998) |
21 | EE | Sylvie Corteel,
Carla D. Savage,
Radhika Venkatraman:
A Bijection for Partitions with All Ranks at Least t.
J. Comb. Theory, Ser. A 83(2): 202-220 (1998) |
1997 |
20 | EE | Tiffany M. Barnes,
Carla D. Savage:
Efficient Generation of Graphical Partitions.
Discrete Applied Mathematics 78(1-3): 17-26 (1997) |
1996 |
19 | EE | Girish S. Bhat,
Carla D. Savage:
Balanced Gray Codes.
Electr. J. Comb. 3(1): (1996) |
18 | EE | Frank Ruskey,
Carla D. Savage:
A Gray Code for Combinations of a Multiset.
Eur. J. Comb. 17(5): 493-500 (1996) |
17 | EE | Terry Min Yih Wang,
Carla D. Savage:
A Gray Code for Necklaces of Fixed Density.
SIAM J. Discrete Math. 9(4): 654-673 (1996) |
1995 |
16 | EE | Tiffany M. Barnes,
Carla D. Savage:
A Recurrence for Counting Graphical Partitions.
Electr. J. Comb. 2: (1995) |
15 | | David J. Rasmussen,
Carla D. Savage:
Gray Code Enumeration of Families of Integer Partitions.
J. Comb. Theory, Ser. A 70(2): 201-229 (1995) |
14 | | Carla D. Savage,
Peter Winkler:
Monotone Gray Codes and the Middle Levels Problem.
J. Comb. Theory, Ser. A 70(2): 230-248 (1995) |
1994 |
13 | EE | David J. Rasmussen,
Carla D. Savage:
Hamilto-connected derangement graphs on S n.
Discrete Mathematics 133(1-3): 217-223 (1994) |
1993 |
12 | | Frank Ruskey,
Carla D. Savage:
Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn.
SIAM J. Discrete Math. 6(1): 152-166 (1993) |
1992 |
11 | | Frank Ruskey,
Carla D. Savage,
Terry Min Yih Wang:
Generating Necklaces.
J. Algorithms 13(3): 414-430 (1992) |
1990 |
10 | | Carla D. Savage,
Matthias F. M. Stallmann,
Jo Ellen Perry:
Solving Some Combinatorial Problems on Arrays with One-Way Dataflow.
Algorithmica 5(2): 179-199 (1990) |
9 | | Carla D. Savage:
Generating Permutations with k-Differences.
SIAM J. Discrete Math. 3(4): 561-573 (1990) |
1989 |
8 | | Carla D. Savage:
Gray Code Sequences of Partitions.
J. Algorithms 10(4): 577-595 (1989) |
1988 |
7 | EE | Carla D. Savage:
Recognizing Majority on a One-Way Mesh.
Inf. Process. Lett. 27(5): 221-225 (1988) |
1985 |
6 | | Sunil Ashtaputre,
Carla D. Savage:
Systolic Arrays with Embedded Tree Structures for Connectivity Problems.
IEEE Trans. Computers 34(5): 483-484 (1985) |
1984 |
5 | | Carla D. Savage:
A Systolic Design for Connectivity Problems.
IEEE Trans. Computers 33(1): 99-104 (1984) |
1982 |
4 | | Wesley E. Snyder,
Carla D. Savage:
Content Adressable Read/Write Memories for Image Analysis.
IEEE Trans. Computers 31(10): 963-968 (1982) |
3 | | Carla D. Savage:
Depth-First Search and the Vertex Cover Problem.
Inf. Process. Lett. 14(5): 233-237 (1982) |
1981 |
2 | | Carla D. Savage,
Joseph JáJá:
Fast, Efficient Parallel Algorithms for Some Graph Problems.
SIAM J. Comput. 10(4): 682-691 (1981) |
1980 |
1 | | Carla D. Savage:
Maximum Matchings and Trees.
Inf. Process. Lett. 10(4/5): 202-205 (1980) |