Carla D. Savage - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 56 from 56

2018

Lecture Hall Partitions and the Affine Hyperoctahedral GroupChristopher R. H. Hanusa, Carla D. Savage. combinatorics, 25(1):1, 2018. [doi]

Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of RelationsMegan A. Martinez, Carla D. Savage. jintseq, 21(2), 2018. [doi]

2016

Generating Functions and Triangulations for Lecture Hall ConesMatthias Beck, Benjamin Braun, Matthias Köppe, Carla D. Savage, Zafeirakis Zafeirakopoulos. siamdm, 30(3):1470-1479, 2016. [doi]

Patterns in Inversion Sequences ISylvie Corteel, Megan A. Martinez, Carla D. Savage, Michael Weselcouch. dmtcs, 18(2), 2016. [doi]

The mathematics of lecture hall partitionsCarla D. Savage. JCT, 144:443-475, 2016. [doi]

2015

Anti-lecture hall compositions and Andrews' generalization of the Watson-Whipple transformationSylvie Corteel, Jeremy Lovejoy, Carla D. Savage. JCT, 134:188-195, 2015. [doi]

2012

Lecture Hall Partitions and the Wreath Products Ck ≀ SnThomas W. Pensyl, Carla D. Savage. int, 12B, 2012. [doi]

Mahonian pairsBruce E. Sagan, Carla D. Savage. JCT, 119(3):526-545, 2012. [doi]

The {1/k}-Eulerian PolynomialsCarla D. Savage, Gopal Viswanathan. combinatorics, 19(1):9, 2012. [doi]

Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequencesCarla D. Savage, Michael J. Schuster. JCT, 119(4):850-870, 2012. [doi]

2011

On an identity of Gessel and Stanton and the new little Göllnitz identitiesCarla D. Savage, Andrew V. Sills. aam, 46(1-4):563-575, 2011. [doi]

2010

Generalizing the Combinatorics of Binomial Coefficients Via l-NomialsNicholas A. Loehr, Carla D. Savage. int, 10, 2010. [doi]

Combinatorial Interpretations of Binomial Coefficient Analogues Related to Lucas SequencesBruce E. Sagan, Carla D. Savage. int, 10, 2010. [doi]

2009

On the existence of symmetric chain decompositions in a quotient of the Boolean latticeZongliang Jiang, Carla D. Savage. DM, 309(17):5278-5283, 2009. [doi]

An update on the middle levels problemIan Shields, Brendan J. Shields, Carla D. Savage. DM, 309(17):5271-5277, 2009. [doi]

2008

Euler s partition theorem and the combinatorics of ::::l::::-sequencesCarla D. Savage, Ae Ja Yee. JCT, 115(6):967-996, 2008. [doi]

2006

Complexity of Converter Placement Supporting Broadcast in WDM NetworksRudra Dutta, Prashant Iyer, Carla D. Savage. broadnets 2006: [doi]

Pattern avoidance in compositions and multiset permutationsCarla D. Savage, Herbert S. Wilf. aam, 36(2):194-201, 2006. [doi]

2005

Common intervals of treesSteffen Heber, Carla D. Savage. ipl, 93(2):69-74, 2005. [doi]

2004

Lecture hall theorems, ::::q::::-series and truncated objectsSylvie Corteel, Carla D. Savage. JCT, 108(2):217-245, 2004. [doi]

Venn Diagrams and Symmetric Chain Decompositions in the Boolean LatticeJerrold R. Griggs, Charles E. Killian, Carla D. Savage. combinatorics, 11(1), 2004. [doi]

On the Multiplicity of Parts in a Random Composition of a Large IntegerPawel Hitczenko, Carla D. Savage. siamdm, 18(2):418-435, 2004. [doi]

Antipodal Gray codesCharles E. Killian, Carla D. Savage. DM, 281(1-3):221-236, 2004. [doi]

Half-Simple Symmetric Venn DiagramsCharles E. Killian, Frank Ruskey, Carla D. Savage, Mark Weston. combinatorics, 11(1), 2004. [doi]

2003

Anti-Lecture Hall CompositionsSylvie Corteel, Carla D. Savage. DM, 263(1-3):275-280, 2003. [doi]

On the existence of Hamiltonian paths in the cover graph of ::::M(n)::::Carla D. Savage, Ian Shields, Douglas B. West. DM, 262(1-3):241-252, 2003. [doi]

2002

A lattice path approach to counting partitions with minimum rank ::::t::::Alexander Burstein, Sylvie Corteel, Alexander Postnikov, Carla D. Savage. DM, 249(1-3):31-39, 2002. [doi]

On the Number of Graphical Forest PartitionsDeborah A. Frank, Carla D. Savage, James A. Sellers. arscom, 65, 2002.

1999

On the multiplicity of parts in a random partitionSylvie Corteel, Boris Pittel, Carla D. Savage, Herbert S. Wilf. rsa, 14(2):185-197, 1999.

1998

Durfee PolynomialsE. Rodney Canfield, Sylvie Corteel, Carla D. Savage. combinatorics, 5, 1998. [doi]

A Bijection for Partitions with All Ranks at Least tSylvie Corteel, Carla D. Savage, Radhika Venkatraman. JCT, 83(2):202-220, 1998. [doi]

A Pentagonal Number SieveSylvie Corteel, Carla D. Savage, Herbert S. Wilf, Doron Zeilberger. JCT, 82(2):186-192, 1998. [doi]

Basis partitionsJennifer M. Nolan, Carla D. Savage, Herbert S. Wilf. DM, 179(1-3):277-283, 1998. [doi]

Graphical Basis PartitionsJennifer M. Nolan, Vijay Sivaraman, Carla D. Savage, Pranav K. Tiwari. gc, 14(3):241-261, 1998. [doi]

The connectivity of acyclic orientation graphsCarla D. Savage, Cun-Quan Zhang. DM, 184(1-3):281-287, 1998. [doi]

1997

Efficient Generation of Graphical PartitionsTiffany M. Barnes, Carla D. Savage. DAM, 78(1-3):17-26, 1997. [doi]

1996

Balanced Gray CodesGirish S. Bhat, Carla D. Savage. combinatorics, 3(1), 1996. [doi]

A Gray Code for Combinations of a MultisetFrank Ruskey, Carla D. Savage. ejc, 17(5):493-500, 1996. [doi]

A Gray Code for Necklaces of Fixed DensityTerry Min Yih Wang, Carla D. Savage. siamdm, 9(4):654-673, 1996. [doi]

1995

A Recurrence for Counting Graphical PartitionsTiffany M. Barnes, Carla D. Savage. combinatorics, 2, 1995. [doi]

Gray Code Enumeration of Families of Integer PartitionsDavid J. Rasmussen, Carla D. Savage. JCT, 70(2):201-229, 1995.

Monotone Gray Codes and the Middle Levels ProblemCarla D. Savage, Peter Winkler. JCT, 70(2):230-248, 1995.

1994

Hamilto-connected derangement graphs on S nDavid J. Rasmussen, Carla D. Savage. DM, 133(1-3):217-223, 1994. [doi]

Gray codes for set partitions and restricted growth tailsFrank Ruskey, Carla D. Savage. ajc, 10:85-96, 1994. [doi]

1993

Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of ::::S::n::::::Frank Ruskey, Carla D. Savage. siamdm, 6(1):152-166, 1993.

1992

Generating NecklacesFrank Ruskey, Carla D. Savage, Terry Min Yih Wang. jal, 13(3):414-430, 1992.

1990

Generating Permutations with ::::k::::-DifferencesCarla D. Savage. siamdm, 3(4):561-573, 1990.

Solving Some Combinatorial Problems on Arrays with One-Way DataflowCarla D. Savage, Matthias F. M. Stallmann, Jo Ellen Perry. algorithmica, 5(2):179-199, 1990.

1989

Gray Code Sequences of PartitionsCarla D. Savage. jal, 10(4):577-595, 1989.

1988

Recognizing Majority on a One-Way MeshCarla D. Savage. ipl, 27(5):221-225, 1988. [doi]

1985

Systolic Arrays with Embedded Tree Structures for Connectivity ProblemsSunil Ashtaputre, Carla D. Savage. TC, 34(5):483-484, 1985.

1984

A Systolic Design for Connectivity ProblemsCarla D. Savage. TC, 33(1):99-104, 1984.

1982

Depth-First Search and the Vertex Cover ProblemCarla D. Savage. ipl, 14(5):233-237, 1982.

Content Adressable Read/Write Memories for Image AnalysisWesley E. Snyder, Carla D. Savage. TC, 31(10):963-968, 1982.

1981

Fast, Efficient Parallel Algorithms for Some Graph ProblemsCarla D. Savage, Joseph JáJá. SICOMP, 10(4):682-691, 1981.

1980

Maximum Matchings and TreesCarla D. Savage. ipl, 10(4/5):202-205, 1980.

Sign in or sign up to see more results.

runs on WebDSL