Carla D. Savage

According to our database, Carla D. Savage authored at least 58 papers between 1980 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2018

Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations.

Megan A. Martinez, Carla D. Savage

J. Integer Seq., 2018

Lecture Hall Partitions and the Affine Hyperoctahedral Group.

Christopher R. H. Hanusa, Carla D. Savage

Electron. J. Comb., 2018

2016

Generating Functions and Triangulations for Lecture Hall Cones.

Matthias Beck, Benjamin Braun, Matthias Köppe, Carla D. Savage, Zafeirakis Zafeirakopoulos

SIAM J. Discret. Math., 2016

The mathematics of lecture hall partitions.

Carla D. Savage

J. Comb. Theory, Ser. A, 2016

Patterns in Inversion Sequences I.

Sylvie Corteel, Megan A. Martinez, Carla D. Savage, Michael Weselcouch

Discret. Math. Theor. Comput. Sci., 2016

2015

Anti-lecture hall compositions and Andrews' generalization of the Watson-Whipple transformation.

Sylvie Corteel, Jeremy Lovejoy, Carla D. Savage

J. Comb. Theory, Ser. A, 2015

2012

Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences.

Carla D. Savage, Michael J. Schuster

J. Comb. Theory, Ser. A, 2012

Mahonian pairs.

Bruce E. Sagan, Carla D. Savage

J. Comb. Theory, Ser. A, 2012

Lecture Hall Partitions and the Wreath Products Ck ≀ Sn.

Thomas W. Pensyl, Carla D. Savage

Integers, 2012

The (1/k)-Eulerian Polynomials.

Carla D. Savage, Gopal Viswanathan

Electron. J. Comb., 2012

2011

On an identity of Gessel and Stanton and the new little Göllnitz identities.

Carla D. Savage, Andrew V. Sills

Adv. Appl. Math., 2011

2010

Combinatorial Interpretations of Binomial Coefficient Analogues Related to Lucas Sequences.

Bruce E. Sagan, Carla D. Savage

Integers, 2010

Generalizing the Combinatorics of Binomial Coefficients Via l-Nomials.

Nicholas A. Loehr, Carla D. Savage

Integers, 2010

2009

An update on the middle levels problem.

Ian Shields, Brendan J. Shields, Carla D. Savage

Discret. Math., 2009

On the existence of symmetric chain decompositions in a quotient of the Boolean lattice.

Zongliang Jiang, Carla D. Savage

Discret. Math., 2009

2008

Euler's partition theorem and the combinatorics of <i>l</i>-sequences.

Carla D. Savage, Ae Ja Yee

J. Comb. Theory, Ser. A, 2008

2006

Pattern avoidance in compositions and multiset permutations.

Carla D. Savage, Herbert S. Wilf

Adv. Appl. Math., 2006

Complexity of Converter Placement Supporting Broadcast in WDM Networks.

Rudra Dutta, Prashant Iyer, Carla D. Savage

Proceedings of the 3rd International Conference on Broadband Communications, 2006

2005

Common intervals of trees.

Steffen Heber, Carla D. Savage

Inf. Process. Lett., 2005

2004

On the Multiplicity of Parts in a Random Composition of a Large Integer.

Pawel Hitczenko, Carla D. Savage

SIAM J. Discret. Math., 2004

Lecture hall theorems, <i>q</i>-series and truncated objects.

Sylvie Corteel, Carla D. Savage

J. Comb. Theory, Ser. A, 2004

Antipodal Gray codes.

Charles E. Killian, Carla D. Savage

Discret. Math., 2004

Half-Simple Symmetric Venn Diagrams.

Charles E. Killian, Frank Ruskey, Carla D. Savage, Mark Weston

Electron. J. Comb., 2004

Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice.

Jerrold R. Griggs, Charles E. Killian, Carla D. Savage

Electron. J. Comb., 2004

2003

On the existence of Hamiltonian paths in the cover graph of <i>M(n)</i>.

Carla D. Savage, Ian Shields, Douglas B. West

Discret. Math., 2003

Anti-Lecture Hall Compositions.

Sylvie Corteel, Carla D. Savage

Discret. Math., 2003

2002

A lattice path approach to counting partitions with minimum rank <i>t</i>.

Alexander Burstein, Sylvie Corteel, Alexander Postnikov, Carla D. Savage

Discret. Math., 2002

On the Number of Graphical Forest Partitions.

Deborah A. Frank, Carla D. Savage, James A. Sellers

Ars Comb., 2002

1999

On the multiplicity of parts in a random partition.

Sylvie Corteel, Boris G. Pittel, Carla D. Savage, Herbert S. Wilf

Random Struct. Algorithms, 1999

1998

A Pentagonal Number Sieve.

Sylvie Corteel, Carla D. Savage, Herbert S. Wilf, Doron Zeilberger

J. Comb. Theory, Ser. A, 1998

A Bijection for Partitions with All Ranks at Least t.

Sylvie Corteel, Carla D. Savage, Radhika Venkatraman

J. Comb. Theory, Ser. A, 1998

Graphical Basis Partitions.

Jennifer M. Nolan, Vijay Sivaraman, Carla D. Savage, Pranav K. Tiwari

Graphs Comb., 1998

The connectivity of acyclic orientation graphs.

Carla D. Savage, Cun-Quan Zhang

Discret. Math., 1998

Basis partitions.

Jennifer M. Nolan, Carla D. Savage, Herbert S. Wilf

Discret. Math., 1998

Durfee Polynomials.

E. Rodney Canfield, Sylvie Corteel, Carla D. Savage

Electron. J. Comb., 1998

1997

A Survey of Combinatorial Gray Codes.

Carla D. Savage

SIAM Rev., 1997

Efficient Generation of Graphical Partitions.

Tiffany M. Barnes, Carla D. Savage

Discret. Appl. Math., 1997

1996

A Gray Code for Necklaces of Fixed Density.

Terry Min Yih Wang, Carla D. Savage

SIAM J. Discret. Math., 1996

A Gray Code for Combinations of a Multiset.

Frank Ruskey, Carla D. Savage

Eur. J. Comb., 1996

Balanced Gray Codes.

Girish S. Bhat, Carla D. Savage

Electron. J. Comb., 1996

1995

Monotone Gray Codes and the Middle Levels Problem.

Carla D. Savage, Peter Winkler

J. Comb. Theory, Ser. A, 1995

Gray Code Enumeration of Families of Integer Partitions.

David J. Rasmussen, Carla D. Savage

J. Comb. Theory, Ser. A, 1995

A Recurrence for Counting Graphical Partitions.

Tiffany M. Barnes, Carla D. Savage

Electron. J. Comb., 1995

1994

Hamilto-connected derangement graphs on S n.

David J. Rasmussen, Carla D. Savage

Discret. Math., 1994

Gray codes for set partitions and restricted growth tails.

Frank Ruskey, Carla D. Savage

Australas. J Comb., 1994

1993

Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of <i>S_n</i>.

Frank Ruskey, Carla D. Savage

SIAM J. Discret. Math., 1993

1992

Generating Necklaces.

Frank Ruskey, Carla D. Savage, Terry Min Yih Wang

J. Algorithms, 1992

1990

Generating Permutations with <i>k</i>-Differences.

Carla D. Savage

SIAM J. Discret. Math., 1990

Solving Some Combinatorial Problems on Arrays with One-Way Dataflow.

Carla D. Savage, Matthias F. M. Stallmann, Jo Ellen Perry

Algorithmica, 1990

1989

Gray Code Sequences of Partitions.

Carla D. Savage

J. Algorithms, 1989

1988

Recognizing Majority on a One-Way Mesh.

Carla D. Savage

Inf. Process. Lett., 1988

1985

Systolic Arrays with Embedded Tree Structures for Connectivity Problems.

Sunil Ashtaputre, Carla D. Savage

IEEE Trans. Computers, 1985

1984

A Systolic Design for Connectivity Problems.

Carla D. Savage

IEEE Trans. Computers, 1984

1982

Content Adressable Read/Write Memories for Image Analysis.

Wesley E. Snyder, Carla D. Savage

IEEE Trans. Computers, 1982

Depth-First Search and the Vertex Cover Problem.

Carla D. Savage

Inf. Process. Lett., 1982

Short strings containing all k-element permutations.

Carla D. Savage

Discret. Math., 1982

1981

Fast, Efficient Parallel Algorithms for Some Graph Problems.

Carla D. Savage, Joseph F. JáJá

SIAM J. Comput., 1981

1980

Maximum Matchings and Trees.

Carla D. Savage

Inf. Process. Lett., 1980