default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Schmutz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j17]Hüseyin Acan, Charles F. Burnette
, Sean Eberhard, Eric Schmutz, James Thomas:
Permutations with equal orders. Comb. Probab. Comput. 30(5): 800-810 (2021)- 2020
- [j16]Rodrigo S. V. Martins, Daniel Panario, Claudio M. Qureshi, Eric Schmutz:
Periods of Iterations of Functions with Restricted Preimage Sizes. ACM Trans. Algorithms 16(3): 30:1-30:28 (2020)
2010 – 2019
- 2018
- [c3]Rodrigo S. V. Martins, Daniel Panario, Claudio M. Qureshi, Eric Schmutz:
Periods of Iterations of Mappings over Finite Fields with Restricted Preimage Sizes. AofA 2018: 30:1-30:11 - 2011
- [j15]Eric Schmutz:
Period Lengths for Iterated Functions. Comb. Probab. Comput. 20(2): 289-298 (2011)
2000 – 2009
- 2008
- [j14]Eric Schmutz:
Splitting fields for characteristic polynomials of matrices with entries in a finite field. Finite Fields Their Appl. 14(1): 250-257 (2008) - [c2]Eric Schmutz:
Symmetric range assignment with disjoint MST constraints. DIALM-POMC 2008: 65-70 - 2006
- [j13]Jennie C. Hansen, Eric Schmutz, Li Sheng:
The Expected Size of the Rule k Dominating Set. Algorithmica 46(3-4): 409-418 (2006) - 2005
- [c1]Jennie C. Hansen, Eric Schmutz:
Comparison of Two CDS Algorithms on Random Unit Ball Graphs. ALENEX/ANALCO 2005: 206-211 - 2004
- [i2]Jennie C. Hansen, Eric Schmutz:
The Expected Size of the Rule k Dominating Set. CoRR cs.DM/0408067 (2004) - [i1]Jennie C. Hansen, Eric Schmutz, Li Sheng:
Probabilistic Analysis of Rule 2. CoRR cs.DM/0408068 (2004) - 2002
- [j12]Avinash Dalal, Eric Schmutz:
Compositions of Random Functions on a Finite Set. Electron. J. Comb. 9(1) (2002) - [j11]Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz:
Inexpensive d-dimensional matchings. Random Struct. Algorithms 20(1): 50-58 (2002) - 2001
- [j10]Jennie C. Hansen, Eric Schmutz:
Near-Optimal Bounded-Degree Spanning Trees. Algorithmica 29(1): 148-180 (2001)
1990 – 1999
- 1995
- [j9]William M. Y. Goh, Eric Schmutz:
The Number of Distinct Part Sizes in a Random Integer Partition. J. Comb. Theory A 69(1): 149-158 (1995) - 1994
- [j8]Robin Carr, William M. Y. Goh, Eric Schmutz:
The Maximum Degree in a Random Tree and Related Problems. Random Struct. Algorithms 5(1): 13-24 (1994) - [j7]Eric Schmutz:
Matchings in Superpositions of (n, n)-Bipartite Trees. Random Struct. Algorithms 5(1): 235-242 (1994) - [j6]William M. Y. Goh, Eric Schmutz:
Unlabeled Trees: Distribution of the Maximum Degree. Random Struct. Algorithms 5(3): 411-440 (1994) - [j5]William M. Y. Goh, Eric Schmutz:
Random Set Partitions. SIAM J. Discret. Math. 7(3): 419-436 (1994) - 1993
- [j4]William M. Y. Goh, Eric Schmutz:
Random Matrices and Brownian Motion. Comb. Probab. Comput. 2: 157-180 (1993) - 1992
- [j3]William M. Y. Goh, Eric Schmutz:
Gap-Free Set Partitions. Random Struct. Algorithms 3(1): 9-18 (1992) - 1991
- [j2]William M. Y. Goh, Eric Schmutz:
A Central Limit Theorem on GLn /Fq). Random Struct. Algorithms 2(1): 47-54 (1991) - 1990
- [j1]Eric Schmutz:
Partitions whose parts are pairwise relatively prime. Discret. Math. 81(1): 87-89 (1990)
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 2024-10-07 22:23 CEST 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:
