Eric Schmutz

According to our database1, Eric Schmutz authored at least 22 papers between 1990 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Permutations with equal orders.
Comb. Probab. Comput., 2021

2020
Periods of Iterations of Functions with Restricted Preimage Sizes.
ACM Trans. Algorithms, 2020

2018
Periods of Iterations of Mappings over Finite Fields with Restricted Preimage Sizes.
Proceedings of the 29th International Conference on Probabilistic, 2018

2011
Period Lengths for Iterated Functions.
Comb. Probab. Comput., 2011

2008
Splitting fields for characteristic polynomials of matrices with entries in a finite field.
Finite Fields Their Appl., 2008

Symmetric range assignment with disjoint MST constraints.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2008

2006
The Expected Size of the Rule k Dominating Set.
Algorithmica, 2006

2005
Comparison of Two CDS Algorithms on Random Unit Ball Graphs.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
Probabilistic Analysis of Rule 2
CoRR, 2004

The Expected Size of the Rule k Dominating Set
CoRR, 2004

2002
Inexpensive d-dimensional matchings.
Random Struct. Algorithms, 2002

Compositions of Random Functions on a Finite Set.
Electron. J. Comb., 2002

2001
Near-Optimal Bounded-Degree Spanning Trees.
Algorithmica, 2001

1995
The Number of Distinct Part Sizes in a Random Integer Partition.
J. Comb. Theory A, 1995

1994
Random Set Partitions.
SIAM J. Discret. Math., 1994

Matchings in Superpositions of (n, n)-Bipartite Trees.
Random Struct. Algorithms, 1994

Unlabeled Trees: Distribution of the Maximum Degree.
Random Struct. Algorithms, 1994

The Maximum Degree in a Random Tree and Related Problems.
Random Struct. Algorithms, 1994

1993
Random Matrices and Brownian Motion.
Comb. Probab. Comput., 1993

1992
Gap-Free Set Partitions.
Random Struct. Algorithms, 1992

1991
A Central Limit Theorem on GL<sub>n</sub> /F<sub>q</sub>).
Random Struct. Algorithms, 1991

1990
Partitions whose parts are pairwise relatively prime.
Discret. Math., 1990


  Loading...