Publications

 
  • Valuations for Matroid Polytope Subdivisions
    Ardila F Fink A Rincón F
    Canadian Journal of Mathematics, Canadian Mathematical Society vol. 62 (6), 1228-1245.  
    14-12-2010
  • A Complexity Dichotomy For Hypergraph Partition Functions
    Dyer M Goldberg LA Jerrum M
    Comput Complex vol. 19 (4), 605-633.  
    01-12-2010
  • An LLT-type algorithm for computing higher-level canonical bases
    Fayers M
    J Pure Appl Algebra vol. 214 (12), 2186-2198.  
    01-12-2010
  • Incentive compatible regression learning
    Dekel O Fischer F Procaccia AD
    Journal of Computer and System Sciences, Elsevier vol. 76 (8), 759-777.  
    01-12-2010
  • OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS
    Jackson B Jordan T
    Int J Comput Geom Ap vol. 20 (6), 685-706.  
    01-12-2010
  • The Computational Complexity of Weak Saddles
    Brandt F Brill M Fischer F Hoffmann J
    Theory of Computing Systems, Springer Nature vol. 49 (1), 139-161.  
    10-11-2010
  • Partition models for the crystal of the basic U-q((sl)over-cap(n))-module
    Fayers M
    J Algebr Comb vol. 32 (3), 339-370.  
    01-11-2010
  • Butterflies II: Torsors for 2-group stacks
    Aldrovandi E
    Adv Math vol. 225 (2), 922-976.  
    01-10-2010
  • Mapping stacks of topological stacks
    Noohi B
    J Reine Angew Math vol. 646, 117-133.  
    01-09-2010
  • On the irreducible representations of the alternating group which remain irreducible in characteristic p p
    Fayers M
    Representation Theory of The American Mathematical Society, American Mathematical Society (Ams) vol. 14 (16), 601-626.  
    01-09-2010
  • POISSON APPROXIMATION OF THE NUMBER OF CLIQUES IN RANDOM INTERSECTION GRAPHS
    Rybarczyk K Stark D
    J Appl Probab, Applied Probability Trust vol. 47 (3), 826-840.  
    01-09-2010
  • Poisson Approximation of the Number of Cliques in Random Intersection Graphs
    Rybarczyk K Stark D
    Journal of Applied Probability, Cambridge University Press (Cup) vol. 47 (3), 826-840.  
    01-09-2010
  • Technical Perspective Constraint Satisfaction Problems and Computational Complexity
    Jerrum M
    Commun Acm vol. 53 (9), 98-98.  
    01-09-2010
  • Bijections between noncrossing and nonnesting partitions for classical reflection groups
    Fink A Giraldo BI
    Portugaliae Mathematica, European Mathematical Society - Ems - Publishing House vol. 67 (3), 369-401.  
    20-08-2010
  • Prime density results for Hecke eigenvalues of a Siegel cusp form
    Saha A
     
    27-07-2010
  • On the Complexity of Iterated Weak Dominance in Constant-Sum Games
    Brandt F Brill M Fischer F Harrenstein P
    Theory of Computing Systems, Springer Nature vol. 49 (1), 162-181.  
    24-07-2010
  • Maxmaxflow and Counting Subgraphs
    Jackson B Sokal AD
    Electron J Comb vol. 17 (1) 
    10-07-2010
  • The Mixing Time of Glauber Dynamics for Coloring Regular Trees
    Goldberg LA Jerrum M
    Random Struct Algor vol. 36 (4), 464-476.  
    01-07-2010
  • Mix and match
    Proceedings of the 11th ACM conference on Electronic commerce., 305-314.  
    07-06-2010
  • An approximation trichotomy for Boolean #CSP
    Dyer M Goldberg LA Jerrum M
    J Comput Syst Sci vol. 76 (3-4), 267-277.  
    01-05-2010
  • Random Majority Percolation
    Balister P Bollobas B Johnson JR Walters M
    Random Struct Algor vol. 36 (3), 315-340.  
    01-05-2010
  • Vertex Turan problems in the hypercube
    Johnson JR Talbot J
    J Comb Theory A, Elsevier/Science Direct vol. 117 (4), 454-465.  
    01-05-2010
  • Local edge-connectivity augmentation in hypergraphs is NP-complete
    Kiraly Z Cosh B Jackson B
    Discrete Appl Math vol. 158 (6), 723-727.  
    28-03-2010
  • On the irreducible Specht modules for Iwahori-Hecke algebras of type A with q =-1
    Fayers M
    J Algebra vol. 323 (6), 1839-1844.  
    15-03-2010
  • Average relational distance in linear extensions of posets
    Brightwell G Patel V
    Discrete Mathematics, Elsevier vol. 310 (5), 1016-1021.  
    01-03-2010
  • SENTRY SELECTION IN WIRELESS NETWORKS
    Balister P Bollobas B Sarkar A Walters M
    Adv Appl Probab vol. 42 (1), 1-25.  
    01-03-2010
  • Sentry Selection in Wireless Networks
    Balister P Bollobás B Sarkar A Walters M
    Advances in Applied Probability, Cambridge University Press (Cup) vol. 42 (01), 1-25.  
    01-03-2010
  • Random preorders and alignments
    Cameron P Kang M Stark D
    DISCRETE MATHEMATICS. vol. 310 (3), 591-603.  
    06-02-2010
  • Analytic continuation of overconvergent Hilbert eigenforms in the totally split case
    Sasaki S
    Compositio Mathematica, Wiley vol. 146 (3), 541-560.  
    02-02-2010
  • The generic rank of body-bar-and-hinge frameworks
    Jackson B Jordan T
    Eur J Combin vol. 31 (2), 574-588.  
    01-02-2010
  • Asymptotic enumeration of 2-covers and line graphs
    Cameron P Stark D
    DISCRETE MATHEMATICS. vol. 310 (2), 230-240.  
    28-01-2010
  • Brick partitions of graphs
    Jackson B Jordan T
    Discrete Mathematics vol. 310 (2), 270-275.  
    28-01-2010
  • A COMPLEXITY DICHOTOMY FOR PARTITION FUNCTIONS WITH MIXED SIGNS
    Goldberg LA Grohe M
    Siam J Comput vol. 39 (7), 3336-3402.  
    01-01-2010
  • AN INEQUALITY FOR TUTTE POLYNOMIALS
    Jackson B
    Combinatorica vol. 30 (1), 69-81.  
    01-01-2010
  • Approximating the Partition Function of the Ferromagnetic Potts Model
    Goldberg LA Jerrum M Abramsky S Gavoille C Kirchner C MeyerAufDerHeide F Spirakis PG
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I. vol. 6198, 396-407.  
    01-01-2010
  • Approximating the Partition Function of the Ferromagnetic Potts Model.
    Goldberg LA Abramsky S Gavoille C Kirchner C Heide FMAD Spirakis PG
    ICALP (1). vol. 6198, 396-407.  
    01-01-2010
  • Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus
    Patel V
    Lecture Notes in Computer Science. vol. 6346, 561-572.  
    01-01-2010
  • Globally rigid circuits of the direction-length rigidity matroid
    Jackson B Jordan T
    J Comb Theory B vol. 100 (1), 1-22.  
    01-01-2010
  • Minimal retentive sets in tournaments
    Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems Aamas. vol. 1, 47-54.  
    01-01-2010
  • Obtaining Online Ecological Colourings by Generalizing First-Fit
    Johnson M Patel V Paulusma D Trunck T
    Lecture Notes in Computer Science. vol. 6072, 240-251.  
    01-01-2010
  • On Iterated Dominance, Matrix Elimination, and Matched Paths
    Brandt F Fischer F Holzer M
    proc27thstacs., 107-118.  
    01-01-2010
  • On the Rate of Convergence of Fictitious Play
    Lecture Notes in Computer Science. vol. 6386, 102-113.  
    01-01-2010
  • The Complexity of Computing Minimal Unidirectional Covering Sets
    Lecture Notes in Computer Science. vol. 6078, 299-310.  
    01-01-2010
  • The minimal density of triangles in tripartite graphs
    Baber R Johnson JR Talbot J
    Lms J Comput Math, Cambridge Journals Online vol. 13, 388-413.  
    01-01-2010
  • Valuative invariants for polymatroids
    FINK A
    Adv. Math. vol. 225 (4), 1840-1892.  
    01-01-2010