No. Title Author Year
1 Back-To-Front Online Lyndon Forest Construction Badkobeh, Golnaz et al. 2022
2 Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series Bostan, Alin et al. 2020
3 An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting Goaoc, Xavier et al. 2019
4 Uniform Random Expressions Lack Expressivity Koechlin, Florent et al. 2019
5 On the Worst-Case Complexity of TimSort Auger, Nicolas et al. 2018
6 Gapped Pattern Statistics Duchon, Philippe et al. 2017
7 Estimating Statistics on Words Using Ambiguous Descriptions Nicaud, Cyril 2016
8 Fast Synchronization of Random Automata Nicaud, Cyril 2016
9 Good Predictions Are Worth a Few Comparisons Auger, Nicolas et al. 2016
10 Distribution of the number of accessible states in a random deterministic automaton Carayol, Arnaud et al. 2012
11 Average Analysis of Glushkov Automata under a BST-Like Model Nicaud, Cyril et al. 2010
12 On the Average Complexity of Moore's State Minimization Algorithm Bassino, Frederique et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 12

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI