Követés
Paolo Codenotti
Paolo Codenotti
E-mail megerősítve itt: google.com
Cím
Hivatkozott rá
Hivatkozott rá
Év
Code equivalence and group isomorphism
L Babai, P Codenotti, JA Grochow, Y Qiao
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
662011
Isomorhism of hypergraphs of low rank in moderately exponential time
L Babai, P Codenotti
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 667-676, 2008
432008
Polynomial-time isomorphism test for groups with no abelian normal subgroups
L Babai, P Codenotti, Y Qiao
Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012
372012
Conflict analysis and branching heuristics in the search for graph automorphisms
P Codenotti, H Katebi, KA Sakallah, IL Markov
2013 IEEE 25th International Conference on Tools with Artificial …, 2013
332013
Resource minimization job scheduling
J Chuzhoy, P Codenotti
International Workshop on Approximation Algorithms for Combinatorial …, 2009
292009
On the minimum order of k-cop-win graphs
W Baird, A Beveridge, A Bonato, P Codenotti, A Maurer, J McCauley, ...
arXiv preprint arXiv:1308.2841, 2013
24*2013
Testing isomorphism of combinatorial and algebraic structures
P Codenotti
The University of Chicago, 2011
172011
Graph isomorphism and the lasserre hierarchy
A Snook, G Schoenebeck, P Codenotti
arXiv preprint arXiv:1401.0758, 2014
112014
Anti-jamming schedules for wireless data broadcast systems
P Codenotti, A Sprintson, J Bruck
2006 IEEE International Symposium on Information Theory, 1856-1860, 2006
11*2006
Erratum: Resource minimization job scheduling
J Chuzhoy, P Codenotti
International Workshop on Approximation Algorithms for Combinatorial …, 2009
42009
Graph isomorphism and the Lasserre hierarchy
P Codenotti, G Schoenebeck, A Snook
arXiv preprint arXiv:1401.0758, 2014
32014
Distinguishing vertices of inhomogeneous random graphs
P Codenotti
University of Minnesota. Institute for Mathematics and Its Applications, 2013
32013
Careers and Opportunities in Industry for Mathematical Scientists
R Almgren, B Altundas, O Boratav, M Brockway, W Browning, ...
2014
Master’s Paper: 2 Dimensional Min-Filters with Polygons
P Codenotti
2007
Repeated Min-Cut The Problem We are considering the problem of partitioning a graph into partitions of a given size, such that the interconnect between partitions be minimal …
P Codenotti
Jacob Abernethy Dimitris Achlioptas Nir Ailon Adi Akavia
S Albers, D Aldous, N Alon, J Alwen, R Andersen, E Anshelevich, ...
email: paoloc@ cs. uchicago. edu
P Codenotti
Large-scale Nano-PLA Meshes with Efficient Logic Mapping
K Jeev, P Codenotti, V Rajkumar, A Kharebov
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–18