Search

Your search keyword '"Analytic combinatorics"' showing total 521 results

Search Constraints

Start Over You searched for: Descriptor "Analytic combinatorics" Remove constraint Descriptor: "Analytic combinatorics"
521 results on '"Analytic combinatorics"'

Search Results

1. A criterion for sharpness in tree enumeration and the asymptotic number of triangulations in Kuperberg's \(G_2\) spider

2. Regular Expressions Avoiding Absorbing Patterns and the Significance of Uniform Distribution.

3. Fuzzy logics – quantitatively.

4. A logical limit law for 231-avoiding permutations.

5. Khinchin Families, Set Constructions, Partitions and Exponentials.

6. Sequence positivity through numeric analytic continuation: uniqueness of the Canham model for biomembranes

9. Symbolic dynamical scales: modes, orbitals, and transversals.

12. Stationary Points at Infinity for Analytic Combinatorics.

13. Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers.

14. Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs

15. Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics

16. Compaction for two models of logarithmic‐depth trees: Analysis and experiments.

17. On the strange kinetic aesthetic of rectangular shape partitions.

18. Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences.

21. Spectral density functions of bivariable stable polynomials.

22. Simplifications of Uniform Expressions Specified by Systems.

24. Connectivity and related properties for graph classes

25. Random Regular Expression Over Huge Alphabets.

26. The effects of semantic simplifications on random BST-like expression-trees.

27. Equilibrium distributions of simple biochemical reaction systems for time-scale separation in stochastic reaction networks

28. Multiple Target Tracking With Unresolved Measurements.

30. Calibrating Seed-Based Heuristics to Map Short Reads With Sesame

31. Calibrating Seed-Based Heuristics to Map Short Reads With Sesame.

32. Further results on random cubic planar graphs.

33. The Trade-Off Between Privacy and Fidelity via Ehrhart Theory.

34. Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness

35. On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection

36. Random cubic planar maps

37. The distributions under two species-tree models of the total number of ancestral configurations for matching gene trees and species trees.

38. Partial Derivative Automaton for Regular Expressions with Shuffle

39. Survey on Counting Special Types of Polynomials

41. Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem

42. HIGHER DIMENSIONAL LATTICE WALKS: CONNECTING COMBINATORIAL AND ANALYTIC BEHAVIOR.

43. On Average Behaviour of Regular Expressions in Strong Star Normal Form.

44. Analytic combinatorics of connected graphs.

45. A bijection of plane increasing trees with relaxed binary trees of right height at most one.

47. Phase Transition of Random Non-uniform Hypergraphs

48. Fully Analyzing an Algebraic Pólya Urn Model

49. Dynamic Programming for Graphs on Surfaces

50. Limit Theorems for Random MAX-2-XORSAT

Catalog

Books, media, physical & digital resources