Browse Title Index


 
Issue Title
 
21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) A further correspondence between (bc,b)-parking functions and (bc,b)-forests Abstract   GZIP Compressed PostScript   PostScript   PDF
Heesung Shin, Jiang Zeng
 
2005 International Conference on Analysis of Algorithms A hooray for Poisson approximation Abstract   GZIP Compressed PostScript   PostScript   PDF   original HTML abstract page
Rudolf Grübel
 
25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013) A Hopf-power Markov chain on compositions Abstract   PostScript   PDF
C.Y. Amy Pang
 
Fifth Colloquium on Mathematics and Computer Science A Markov Chain Algorithm for determining Crossing Times through nested Graphs Abstract   GZIP Compressed PostScript   PostScript   PDF
Uta Freiberg, Christoph Thäle
 
21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) A max-flow algorithm for positivity of Littlewood-Richardson coefficients Abstract   GZIP Compressed PostScript   PostScript   PDF
Peter Bürgisser, Christian Ikenmeyer
 
24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) A new edge selection heuristic for computing the Tutte polynomial of an undirected graph Abstract   PostScript   PDF
Michael Monagan
 
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) A Note on Invariant Random Variables Abstract   PostScript   PDF
Jacek Cichoń, Marek Klonowski
 
Discrete Random Walks, DRW'03 A phase transition in the random transposition random walk Abstract   GZIP Compressed PostScript   PostScript   PDF   original HTML abstract page
Nathanaël Berestycki, Rick Durrett
 
21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) A preorder-free construction of the Kazhdan-Lusztig representations of Sn, with connections to the Clausen representations Abstract   GZIP Compressed PostScript   PostScript   PDF
Charles Buehrle, Mark Skandera
 
Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities A probabilistic analysis of a leader election algorithm Abstract   PDF
Hanène Mohamed
 
26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014) A product formula for the TASEP on a ring Abstract   PostScript   PDF
Erik Aas, Jonas Sjöstrand
 
20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008) A Quantization of a theorem of Goulden and Jackson Abstract   GZIP Compressed PostScript   PostScript   PDF
Matjaž Konvalinka, Mark Skandera
 
24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) A simple formula for the series of bipartite and quasi-bipartite maps with boundaries Abstract   PostScript   PDF
Gwendal Collet, Éric Fusy
 
24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) A simple model of trees for unicellular maps Abstract   PostScript   PDF
Guillaume Chapuy, Valentin Féray, Éric Fusy
 
26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014) A simple recurrence formula for the number of rooted maps on surfaces by edges and genus Abstract   PostScript   PDF
Sean Carrell, Guillaume Chapuy
 
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) A sufficient condition for bicolorable hypergraphs Abstract   GZIP Compressed PostScript   PostScript   PDF   original HTML abstract page
David Défossez
 
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) A symbolic method to compute the probability distribution of the number of pattern occurences in random texts generated by stochastic 0L-systems Abstract   PostScript   PDF
Cédric Loi, Paul-Henry Cournède, Jean Françon
 
23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) A tight colored Tverberg theorem for maps to manifolds (extended abstract) Abstract   PostScript   PDF
Pavle V. M. Blagojević, Benjamin Matschke, Günter M. Ziegler
 
24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) A Topological Representation Theorem for Tropical Oriented Matroids Abstract   PostScript   PDF
Silke Horn
 
22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) A unification of permutation patterns related to Schubert varieties Abstract   PostScript   PDF
Henning A. Úlfarsson
 
22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) A unified bijective method for maps: application to two classes with boundaries Abstract   PostScript   PDF
Olivier Bernardi, Éric Fusy
 
25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013) A uniform model for Kirillov-Reshetikhin crystals Abstract   PostScript   PDF
C. Lenart, S. Naito, D. Sagaki, A. Schilling, M. Shimozono
 
20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008) A variation on the tableau switching and a Pak-Vallejo's conjecture Abstract   GZIP Compressed PostScript   PostScript   PDF
Olga Azenhas
 
Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers Abstract   PDF
Frédérique Bassino, Cyril Nicaud
 
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) Acyclic Coloring of Graphs of Maximum Degree Δ Abstract   GZIP Compressed PostScript   PostScript   PDF   original HTML abstract page
Guillaume Fertin, André Raspaud
 
23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12) Adaptive compression against a countable alphabet Abstract   PostScript   PDF
Dominique Bontemps, Stéphane Boucheron, Elisabeth Gassiat
 
25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013) Adinkras for Mathematicians Abstract   PostScript   PDF
Y. X. Zhang
 
20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008) Algebraic shifting and strongly edge decomposable complexes Abstract   GZIP Compressed PostScript   PostScript   PDF
Satoshi Murai
 
Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001 An n-Dimensional Generalization of the Rhombus Tiling Abstract   GZIP Compressed PostScript   PostScript   PDF   original HTML abstract page
Joakim Linde, Cristopher Moore, Mats G. Nordahl
 
22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) An algorithm which generates linear extensions for a generalized Young diagram with uniform probability Abstract   PostScript   PDF
Kento Nakada, Shuji Okamura
 
24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability Abstract   PostScript   PDF
Kento Nakada
 
24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) An explicit formula for ndinv, a new statistic for two-shuffle parking functions Abstract   PostScript   PDF
Angela Hicks, Yeonkyung Kim
 
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) An extremal problem on trees and database theory Abstract   GZIP Compressed PostScript   PostScript   PDF   original HTML abstract page
Gyula O. H. Katona, Krisztián Tichler
 
24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) An injection from standard fillings to parking functions Abstract   PostScript   PDF
Elizabeth Niese
 
Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities An invariance principle for random planar maps Abstract   PDF
Grágory Miermont
 
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) An optimal cardinality estimation algorithm based on order statistics and its full analysis Abstract   PostScript   PDF
Jérémie Lumbroso
 
Fifth Colloquium on Mathematics and Computer Science Analysis of an algorithm catching elephants on the Internet Abstract   GZIP Compressed PostScript   PostScript   PDF
Yousra Chabchoub, Christine Fricker, Frédéric Meunier, Danielle Tibi
 
2005 International Conference on Analysis of Algorithms Analysis of tree algorithm for collision resolution Abstract   GZIP Compressed PostScript   PostScript   PDF   original HTML abstract page
László Györfi, Sándor Győri
 
2005 International Conference on Analysis of Algorithms And/or tree probabilities of Boolean functions Abstract   GZIP Compressed PostScript   PostScript   PDF   original HTML abstract page
Danièle Gardy, Alan Woods
 
21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) Another bijection between 2-triangulations and pairs of non-crossing Dyck paths Abstract   GZIP Compressed PostScript   PostScript   PDF
Carlos M. Nicolás
 
641 - 680 of 975 Items << < 12 13 14 15 16 17 18 19 20 21 > >> 


Valid XHTML 1.0 Transitional