default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarla D. Savage
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j57]Christopher R. H. Hanusa
, Carla D. Savage:
Lecture Hall Partitions and the Affine Hyperoctahedral Group. Electron. J. Comb. 25(1): 1 (2018)- [j56]Megan A. Martinez, Carla D. Savage:
Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations. J. Integer Seq. 21(2): 18.2.2 (2018) - 2016
- [j55]Sylvie Corteel, Megan A. Martinez, Carla D. Savage, Michael Weselcouch:
Patterns in Inversion Sequences I. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [j54]Carla D. Savage:
The mathematics of lecture hall partitions. J. Comb. Theory A 144: 443-475 (2016) - [j53]Matthias Beck, Benjamin Braun, Matthias Köppe, Carla D. Savage, Zafeirakis Zafeirakopoulos:
Generating Functions and Triangulations for Lecture Hall Cones. SIAM J. Discret. Math. 30(3): 1470-1479 (2016) - 2015
- [j52]Sylvie Corteel, Jeremy Lovejoy, Carla D. Savage:
Anti-lecture hall compositions and Andrews' generalization of the Watson-Whipple transformation. J. Comb. Theory A 134: 188-195 (2015) - 2012
- [j51]Carla D. Savage, Gopal Viswanathan:
The (1/k)-Eulerian Polynomials. Electron. J. Comb. 19(1): 9 (2012) - [j50]Thomas W. Pensyl, Carla D. Savage:
Lecture Hall Partitions and the Wreath Products Ck ≀ Sn. Integers 12B: A10 (2012) - [j49]Bruce E. Sagan, Carla D. Savage:
Mahonian pairs. J. Comb. Theory A 119(3): 526-545 (2012) - [j48]Carla D. Savage, Michael J. Schuster:
Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences. J. Comb. Theory A 119(4): 850-870 (2012) - 2011
- [j47]Carla D. Savage, Andrew V. Sills:
On an identity of Gessel and Stanton and the new little Göllnitz identities. Adv. Appl. Math. 46(1-4): 563-575 (2011) - 2010
- [j46]Nicholas A. Loehr, Carla D. Savage:
Generalizing the Combinatorics of Binomial Coefficients Via l-Nomials. Integers 10: A45 (2010) - [j45]Bruce E. Sagan, Carla D. Savage:
Combinatorial Interpretations of Binomial Coefficient Analogues Related to Lucas Sequences. Integers 10: A52 (2010)
2000 – 2009
- 2009
- [j44]Ian Shields, Brendan J. Shields, Carla D. Savage:
An update on the middle levels problem. Discret. Math. 309(17): 5271-5277 (2009) - [j43]Zongliang Jiang, Carla D. Savage:
On the existence of symmetric chain decompositions in a quotient of the Boolean lattice. Discret. Math. 309(17): 5278-5283 (2009) - 2008
- [j42]Carla D. Savage, Ae Ja Yee:
Euler's partition theorem and the combinatorics of l-sequences. J. Comb. Theory A 115(6): 967-996 (2008) - 2006
- [j41]Carla D. Savage, Herbert S. Wilf:
Pattern avoidance in compositions and multiset permutations. Adv. Appl. Math. 36(2): 194-201 (2006) - [c1]Rudra Dutta, Prashant Iyer, Carla D. Savage:
Complexity of Converter Placement Supporting Broadcast in WDM Networks. BROADNETS 2006 - 2005
- [j40]Steffen Heber, Carla D. Savage:
Common intervals of trees. Inf. Process. Lett. 93(2): 69-74 (2005) - 2004
- [j39]Jerrold R. Griggs, Charles E. Killian, Carla D. Savage:
Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice. Electron. J. Comb. 11(1) (2004) - [j38]Charles E. Killian, Frank Ruskey, Carla D. Savage, Mark Weston:
Half-Simple Symmetric Venn Diagrams. Electron. J. Comb. 11(1) (2004) - [j37]Charles E. Killian, Carla D. Savage:
Antipodal Gray codes. Discret. Math. 281(1-3): 221-236 (2004) - [j36]Sylvie Corteel, Carla D. Savage:
Lecture hall theorems, q-series and truncated objects. J. Comb. Theory A 108(2): 217-245 (2004) - [j35]Pawel Hitczenko, Carla D. Savage:
On the Multiplicity of Parts in a Random Composition of a Large Integer. SIAM J. Discret. Math. 18(2): 418-435 (2004) - 2003
- [j34]Carla D. Savage, Ian Shields, Douglas B. West:
On the existence of Hamiltonian paths in the cover graph of M(n). Discret. Math. 262(1-3): 241-252 (2003) - [j33]Sylvie Corteel, Carla D. Savage:
Anti-Lecture Hall Compositions. Discret. Math. 263(1-3): 275-280 (2003) - 2002
- [j32]Deborah A. Frank, Carla D. Savage, James A. Sellers:
On the Number of Graphical Forest Partitions. Ars Comb. 65 (2002) - [j31]Alexander Burstein, Sylvie Corteel, Alexander Postnikov, Carla D. Savage:
A lattice path approach to counting partitions with minimum rank t. Discret. Math. 249(1-3): 31-39 (2002)
1990 – 1999
- 1999
- [j30]Sylvie Corteel, Boris G. 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
- [j29]E. Rodney Canfield, Sylvie Corteel, Carla D. Savage:
Durfee Polynomials. Electron. J. Comb. 5 (1998) - [j28]Jennifer M. Nolan, Carla D. Savage, Herbert S. Wilf:
Basis partitions. Discret. Math. 179(1-3): 277-283 (1998) - [j27]Carla D. Savage, Cun-Quan Zhang:
The connectivity of acyclic orientation graphs. Discret. Math. 184(1-3): 281-287 (1998) - [j26]Jennifer M. Nolan, Vijay Sivaraman, Carla D. Savage, Pranav K. Tiwari:
Graphical Basis Partitions. Graphs Comb. 14(3): 241-261 (1998) - [j25]Sylvie Corteel, Carla D. Savage, Herbert S. Wilf, Doron Zeilberger:
A Pentagonal Number Sieve. J. Comb. Theory A 82(2): 186-192 (1998) - [j24]Sylvie Corteel, Carla D. Savage, Radhika Venkatraman:
A Bijection for Partitions with All Ranks at Least t. J. Comb. Theory A 83(2): 202-220 (1998) - 1997
- [j23]Tiffany M. Barnes, Carla D. Savage:
Efficient Generation of Graphical Partitions. Discret. Appl. Math. 78(1-3): 17-26 (1997) - [j22]Carla D. Savage:
A Survey of Combinatorial Gray Codes. SIAM Rev. 39(4): 605-629 (1997) - 1996
- [j21]Girish S. Bhat, Carla D. Savage:
Balanced Gray Codes. Electron. J. Comb. 3(1) (1996) - [j20]Frank Ruskey, Carla D. Savage:
A Gray Code for Combinations of a Multiset. Eur. J. Comb. 17(5): 493-500 (1996) - [j19]Terry Min Yih Wang, Carla D. Savage:
A Gray Code for Necklaces of Fixed Density. SIAM J. Discret. Math. 9(4): 654-673 (1996) - 1995
- [j18]Tiffany M. Barnes, Carla D. Savage:
A Recurrence for Counting Graphical Partitions. Electron. J. Comb. 2 (1995) - [j17]David J. Rasmussen, Carla D. Savage:
Gray Code Enumeration of Families of Integer Partitions. J. Comb. Theory A 70(2): 201-229 (1995) - [j16]Carla D. Savage, Peter Winkler:
Monotone Gray Codes and the Middle Levels Problem. J. Comb. Theory A 70(2): 230-248 (1995) - 1994
- [j15]Frank Ruskey, Carla D. Savage:
Gray codes for set partitions and restricted growth tails. Australas. J Comb. 10: 85-96 (1994) - [j14]David J. Rasmussen, Carla D. Savage:
Hamilto-connected derangement graphs on S n. Discret. Math. 133(1-3): 217-223 (1994) - 1993
- [j13]Frank Ruskey, Carla D. Savage:
Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn. SIAM J. Discret. Math. 6(1): 152-166 (1993) - 1992
- [j12]Frank Ruskey, Carla D. Savage, Terry Min Yih Wang:
Generating Necklaces. J. Algorithms 13(3): 414-430 (1992) - 1990
- [j11]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) - [j10]Carla D. Savage:
Generating Permutations with k-Differences. SIAM J. Discret. Math. 3(4): 561-573 (1990)
1980 – 1989
- 1989
- [j9]Carla D. Savage:
Gray Code Sequences of Partitions. J. Algorithms 10(4): 577-595 (1989) - 1988
- [j8]Carla D. Savage:
Recognizing Majority on a One-Way Mesh. Inf. Process. Lett. 27(5): 221-225 (1988) - 1985
- [j7]Sunil Ashtaputre, Carla D. Savage:
Systolic Arrays with Embedded Tree Structures for Connectivity Problems. IEEE Trans. Computers 34(5): 483-484 (1985) - 1984
- [j6]Carla D. Savage:
A Systolic Design for Connectivity Problems. IEEE Trans. Computers 33(1): 99-104 (1984) - 1982
- [j5]Carla D. Savage:
Short strings containing all k-element permutations. Discret. Math. 42(2-3): 281-285 (1982) - [j4]Carla D. Savage:
Depth-First Search and the Vertex Cover Problem. Inf. Process. Lett. 14(5): 233-237 (1982) - [j3]Wesley E. Snyder, Carla D. Savage:
Content Adressable Read/Write Memories for Image Analysis. IEEE Trans. Computers 31(10): 963-968 (1982) - 1981
- [j2]Carla D. Savage, Joseph F. JáJá:
Fast, Efficient Parallel Algorithms for Some Graph Problems. SIAM J. Comput. 10(4): 682-691 (1981) - 1980
- [j1]Carla D. Savage:
Maximum Matchings and Trees. Inf. Process. Lett. 10(4/5): 202-205 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
