A generating functionology approach to a problem of Wilf
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Random Sampling from Boltzmann Principles
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Trade-Offs between Density and Robustness in Random Interconnection Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Forbidden subgraphs in connected graphs
Theoretical Computer Science
Simply generated trees, B-series and Wigner processes
Random Structures & Algorithms
Journal of the ACM (JACM)
Another proof of Wright's inequalities
Information Processing Letters
Enumeration and limit laws for series-parallel graphs
European Journal of Combinatorics
Generating unlabeled connected cubic planar graphs uniformly at random
Random Structures & Algorithms
On properties of random dissections and triangulations
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The distribution of patterns in random trees
Combinatorics, Probability and Computing
The critical phase for random graphs with a given degree sequence
Combinatorics, Probability and Computing
On the number of fuzzy subgroups of finite abelian groups
Fuzzy Sets and Systems
ISPRA'08 Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation
Anonymity and k-Choice Identities
Information Security and Cryptology
Algebraic and Slide Attacks on KeeLoq
Fast Software Encryption
Complexity and Limiting Ratio of Boolean Functions over Implication
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
The Average State Complexity of the Star of a Finite Set of Words Is Linear
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On complexity functions of infinite words associated with generalized Dyck languages
Theoretical Computer Science
Finding efficient recursions for risk aggregation by computer algebra
Journal of Computational and Applied Mathematics
Electronic Notes in Theoretical Computer Science (ENTCS)
(Un)expected behavior of digital search tree profile
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Maximal biconnected subgraphs of random planar graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
On the parity of the Wiener index
European Journal of Combinatorics
Using singularity analysis to approximate transient characteristics in queueing systems
Probability in the Engineering and Informational Sciences
Data Deletion with Provable Security
Information Security Applications
Regularity of the Euclid Algorithm; application to the analysis of fast GCD Algorithms
Journal of Symbolic Computation
On the Average Size of Glushkov's Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Average-Case Analysis of Perfect Sorting by Reversals
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Uniform Random Generation of Huge Metamodel Instances
ECMDA-FA '09 Proceedings of the 5th European Conference on Model Driven Architecture - Foundations and Applications
The Number of Symbol Comparisons in QuickSort and QuickSelect
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Fast and sound random generation for automated testing and benchmarking in objective Caml
Proceedings of the 2009 ACM SIGPLAN workshop on ML
Proceedings of the 4th International Conference on Queueing Theory and Network Applications
The degree sequence of random graphs from subcritical classes†
Combinatorics, Probability and Computing
ACM Transactions on Algorithms (TALG)
Maximum likelihood analysis of algorithms and data structures
Theoretical Computer Science
Opportunistic routing in wireless ad hoc networks: upper bounds for the packet propagation speed
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
RNA pseudoknot structures with arc-length ≥3 and stack-length ≥σ
Discrete Applied Mathematics
Uniform random sampling of planar graphs in linear time
Random Structures & Algorithms
Families of prudent self-avoiding walks
Journal of Combinatorial Theory Series A
Bijections for a class of labeled plane trees
European Journal of Combinatorics
Maximal biconnected subgraphs of random planar graphs
ACM Transactions on Algorithms (TALG)
Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games
Random sampling of plane partitions
Combinatorics, Probability and Computing
Mixed succession rules: The commutative case
Journal of Combinatorial Theory Series A
Growth constants of minor-closed classes of graphs
Journal of Combinatorial Theory Series B
Fast NML computation for Naive Bayes models
DS'07 Proceedings of the 10th international conference on Discovery science
Intuitionistic vs. classical tautologies, quantitative comparison
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Random 2-XORSAT at the satisfiability threshold
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2
European Journal of Combinatorics
Minimal permutations with d descents
European Journal of Combinatorics
Pattern avoidance in binary trees
Journal of Combinatorial Theory Series A
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms
Design and analysis of synchronizable error-resilient arithmetic codes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Localization of an inhomogeneous discrete-time quantum walk on the line
Quantum Information Processing
A combinatorial approach to the analysis of bucket recursive trees
Theoretical Computer Science
NumGfun: a package for numerical and analytic computation with D-finite functions
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
When can we detect that a P-finite sequence is positive?
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Effective bounds for P-recursive sequences
Journal of Symbolic Computation
Enumeration results for alternating tree families
European Journal of Combinatorics
Controlled non-uniform random generation of decomposable structures
Theoretical Computer Science
Area limit laws for symmetry classes of staircase polygons
Combinatorics, Probability and Computing
The shape of unlabeled rooted random trees
European Journal of Combinatorics
On the density of the set of known Hadamard orders
Cryptography and Communications
Birth and growth of multicyclic components in random hypergraphs
Theoretical Computer Science
Information propagation speed in mobile and delay tolerant networks
IEEE Transactions on Information Theory
Vertices of degree k in random maps
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Generalized Stirling permutations, families of increasing trees and urn models
Journal of Combinatorial Theory Series A
Dynamic programming for graphs on surfaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the average number of states of partial derivative automata
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Average case analysis of algorithms
Algorithms and theory of computation handbook
Application of logic to integer sequences: a survey
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Equivalence classes of Boolean functions for first-order correlation
IEEE Transactions on Information Theory
Rare event asymptotics for a random walk in the quarter plane
Queueing Systems: Theory and Applications
ACM Transactions on Algorithms (TALG)
From key predistribution to key redistribution
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Asymptotic enumeration and limit laws for graphs of fixed genus
Journal of Combinatorial Theory Series A
The structure of alternative tableaux
Journal of Combinatorial Theory Series A
Period lengths for iterated functions
Combinatorics, Probability and Computing
3-connected cores in random planar graphs
Combinatorics, Probability and Computing
A novel method for improving fairness over multiaccess channels
EURASIP Journal on Wireless Communications and Networking
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
Theoretical Computer Science
Definability of combinatorial functions and their linear recurrence relations
Fields of logic and computation
Degree distribution in random planar graphs
Journal of Combinatorial Theory Series A
The expected profile of digital search trees
Journal of Combinatorial Theory Series A
Counting colored planar maps: Algebraicity results
Journal of Combinatorial Theory Series B
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Rules of thumb for information acquisition from large and redundant data
ECIR'11 Proceedings of the 33rd European conference on Advances in information retrieval
Sharp bounds by probability-generating functions and variable drift
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Towards bounding sequential patterns
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Hidden variables simulating quantum contextuality increasingly violate the Holevo bound
UC'11 Proceedings of the 10th international conference on Unconventional computation
A random testing approach using pushdown automata
TAP'11 Proceedings of the 5th international conference on Tests and proofs
The enumeration of prudent polygons by area and its unusual asymptotics
Journal of Combinatorial Theory Series A
Weakly directed self-avoiding walks
Journal of Combinatorial Theory Series A
European Journal of Combinatorics
On graphs with few disjoint t-star minors
European Journal of Combinatorics
The average transition complexity of Glushkov and partial derivative automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Tail asymptotics for a generalized two-demand queueing model--a kernel method
Queueing Systems: Theory and Applications
A bijection for triangulations, quadrangulations, pentagulations, etc.
Journal of Combinatorial Theory Series A
Faster parameterized algorithms for minor containment
Theoretical Computer Science
Analysis of the Free Energy in a Stochastic RNA Secondary Structure Model
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Bilabelled increasing trees and hook-length formulae
European Journal of Combinatorics
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Boltzmann Samplers, Pólya Theory, and Cycle Pointing
SIAM Journal on Computing
Initialization for ad hoc radio networks with carrier sensing and collision detection
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
The MAX-CUT of sparse random graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The maximum degree of random planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Partial match queries in random quadtrees
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Enumerating simplicial decompositions of surfaces with boundaries
European Journal of Combinatorics
Record statistics in a random composition
Discrete Applied Mathematics
Intervals of balanced binary trees in the Tamari lattice
Theoretical Computer Science
Average complexity of Moore's and Hopcroft's algorithms
Theoretical Computer Science
New software for computing asymptotics of multivariate generating functions
ACM Communications in Computer Algebra
Phase transitions of iterated Higman-style well-partial-orderings
Archive for Mathematical Logic
Two remarks on the adjoint polynomial
European Journal of Combinatorics
Creation and growth of components in a random hypergraph process
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Limit theorems for random MAX-2-XORSAT
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On Buffon machines and numbers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A master theorem for discrete divide and conquer recurrences
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the degree distribution of random planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Random graphs with few disjoint cycles
Combinatorics, Probability and Computing
Analysis of statistics for generalized stirling permutations
Combinatorics, Probability and Computing
Outerplanar obstructions for a feedback vertex set
European Journal of Combinatorics
A precise analysis of Cuckoo hashing
ACM Transactions on Algorithms (TALG)
Faster parameterized algorithms for minor containment
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Bounds on threshold of regular random k-SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Scratch, click & vote: e2e voting over the internet
Towards Trustworthy Elections
Improving data availability in chord p2p system
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Random permutation statistics and an improved slide-determine attack on keeloq
Cryptography and Security
Unified bijections for maps with prescribed degrees and girth
Journal of Combinatorial Theory Series A
Catching the k-NAESAT threshold
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The degree profile of random Pólya trees
Journal of Combinatorial Theory Series A
Counting occurrences for a finite set of words: Combinatorial methods
ACM Transactions on Algorithms (TALG)
Hiring above the m-th best candidate: a generalization of records in permutations
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Fully analyzing an algebraic pólya urn model
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The fraction of large random trees representing a given Boolean function in implicational logic
Random Structures & Algorithms
Mathematical and Computer Modelling: An International Journal
Generating series for irreducible polynomials over finite fields
Finite Fields and Their Applications
Phase transitions for random walk asymptotics on free products of groups
Random Structures & Algorithms
Algorithms for combinatorial structures: Well-founded systems and Newton iterations
Journal of Combinatorial Theory Series A
Asymptotic Study of Subcritical Graph Classes
SIAM Journal on Discrete Mathematics
The distribution of height and diameter in random non-plane binary trees
Random Structures & Algorithms
From key predistribution to key redistribution
Theoretical Computer Science
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Generating functions of timed languages
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Enumeration and asymptotics of restricted compositions having the same number of parts
Discrete Applied Mathematics
Boltzmann samplers for first-order differential specifications
Discrete Applied Mathematics
Some generalizations of the MacMahon Master Theorem
Journal of Combinatorial Theory Series A
The genus of a random chord diagram is asymptotically normal
Journal of Combinatorial Theory Series A
Some New Self-avoiding Walk and Polygon Models
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Boys-and-girls Birthdays and Hadamard Products
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Visits to Level r by Dyck Paths
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Dyck Paths with Parity Restrictions for the Final Runs to the Origin: a Study of the Height
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Classical and intuitionistic logic are asymptotically identical
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Catalan lattice paths with rook, bishop and spider steps
Journal of Combinatorial Theory Series A
Random mappings with restricted preimages
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Greek letters in random staircase tableaux
Random Structures & Algorithms
Limit measures of inhomogeneous discrete-time quantum walks in one dimension
Quantum Information Processing
Notes on higher-dimensional partitions
Journal of Combinatorial Theory Series A
Random generation of combinatorial structures: Boltzmann samplers and beyond
Proceedings of the Winter Simulation Conference
PRINCE: a low-latency block cipher for pervasive computing applications
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
On counting untyped lambda terms
Theoretical Computer Science
On the connectivity of random graphs from addable classes
Journal of Combinatorial Theory Series B
Twisting q-holonomic sequences by complex roots of unity
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Mahler measures, short walks and log-sine integrals
Theoretical Computer Science
Multiple GCDs. probabilistic analysis of the plain algorithm
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Gröbner bases of ideals invariant under a commutative group: the non-modular case
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Asymptotic analysis and random sampling of digitally convex polyominoes
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
A Master Theorem for Discrete Divide and Conquer Recurrences
Journal of the ACM (JACM)
Is the five-flow conjecture almost false?
Journal of Combinatorial Theory Series B
Passage time from four to two blocks of opinions in the voter model and walks in the quarter plane
Queueing Systems: Theory and Applications
Wireless three-hop networks with stealing II: exact solutions through boundary value problems
Queueing Systems: Theory and Applications
The growth rate of high-dimensional tree polycubes
European Journal of Combinatorics
Asymptotics and random sampling for BCI and BCK lambda terms
Theoretical Computer Science
Boltzmann samplers for v-balanced cycles
Theoretical Computer Science
On the average size of glushkov and equation automata for KAT expressions
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Restricted non-separable planar maps and some pattern avoiding permutations
Discrete Applied Mathematics
On the connected components of a random permutation graph with a given number of edges
Journal of Combinatorial Theory Series A
Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel
Quantum Information & Computation
Non-D-finite excursions in the quarter plane
Journal of Combinatorial Theory Series A
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
European Journal of Combinatorics
2D Meets 4G: G-Quadruplexes in RNA Secondary Structure Prediction
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Exploration-exploitation Trade-off in a Treasure Hunting Game
Electronic Notes in Theoretical Computer Science (ENTCS)
Counting trees using symmetries
Journal of Combinatorial Theory Series A
Parameterized Domination in Circle Graphs
Theory of Computing Systems
On Flooding in the Presence of Random Faults
Fundamenta Informaticae
Hi-index | 0.14 |
Analytic Combinatorics is a self-contained treatment of the mathematics underlying the analysis of discrete structures, which has emerged over the past several decades as an essential tool in the understanding of properties of computer programs and scientific models with applications in physics, biology and chemistry. Thorough treatment of a large number of classical applications is an essential aspect of the presentation. Written by the leaders in the field of analytic combinatorics, this text is certain to become the definitive reference on the topic. The text is complemented with exercises, examples, appendices and notes to aid understanding therefore, it can be used as the basis for an advanced undergraduate or a graduate course on the subject, or for self-study.