Papa A. Sissokho, Ph.D.
Affiliations: | 2003 | Emory University, Atlanta, GA |
Area:
Mathematics, Computer ScienceGoogle:
"Papa Sissokho"Parents
Sign in to add mentorVojtech Rodl | grad student | 2003 | Emory | |
(Light spanners and sparse pseudo -random graphs.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Akman F, Sissokho PA. (2020) Subspace partitions of Fqn containing direct sums II: General case Linear Algebra and Its Applications. 598: 1-28 |
Năstase EL, Sissokho PA. (2018) The complete characterization of the minimum size supertail in a subspace partition Linear Algebra and Its Applications. 559: 172-180 |
Akman F, Sissokho PA. (2018) Subspace partitions of Fqn containing direct sums Discrete Mathematics. 341: 1850-1863 |
Năstase EL, Sissokho PA. (2017) The maximum size of a partial spread in a finite projective space Journal of Combinatorial Theory, Series A. 152: 353-362 |
Nstase E, Sissokho P. (2017) The maximum size of a partial spread II Discrete Mathematics. 340: 1481-1487 |
NăźStase E, Sissokho P. (2017) The structure of the minimum size supertail of a subspace partition Designs, Codes and Cryptography. 83: 549-563 |
Akman F, Sissokho PA. (2015) Counting the restricted gaussian partitions of a finite vector space Journal of Integer Sequences. 18 |
Heden O, Lehmann J, Nǎstase E, et al. (2014) On the type(s) of minimum size subspace partitions Discrete Mathematics. 332: 1-9 |
Heden O, Lehmann J, Năstase E, et al. (2013) The supertail of a subspace partition Designs, Codes and Cryptography. 69: 305-316 |
Peng Y, Sissokho PA. (2013) The Feasible Matching Problem Graphs and Combinatorics. 29: 695-704 |