The DOI matches its Crossref record; 39 of the 42 references it cites were found in a registry or an index.
Random Mapping Statistics
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“For y $ ←Y , the probability of y to be a j-node, denoted by q (a N ) : Z ≥0 → [0, 1], is q (a N ) ( j) ≈ 1 e a • a j j! . (5 ) For x $ ←X , the probability of f (x) to be a j-node, denoted by r (a N ) : N → [0, 1], is r (a N ) ( j) ≈ j • q (a N ) ( j). (6 )”
From Time–space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (2018) · cites this paper as [29]
Citations
Cites
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,863
Asymptotics and Special Functions
Olver, F. W. J. (1997) · A K Peters/CRC Press eBooks · doi:10.1201/9781439864548 · Cited by 3,368
Titchmarsh, E. C. (1932) · BURJC Digital (King Juan Carlos University) · Cited by 2,290
Stanley, R. P. (1986) · Springer eBooks · doi:10.1007/978-1-4615-9763-6 · Cited by 1,796
Asymptotic methods in analysis
de Bruijn, N. G. (1958) · International Linear Collider · Cited by 1,332
Pemantle, R., Wilson, M. C., & Melczer, S. (2024) · Cambridge University Press eBooks · doi:10.1017/9781108874144.003 · Cited by 939
Singularity Analysis of Generating Functions
Flajolet, P., & Odlyzko, A. M. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403019 · Cited by 786
Self-citationThe Art of Computer Programming, Volume 3, Sorting and Searching
Wilkes, M. (1974) · The Computer Journal · doi:10.1093/comjnl/17.4.324 · Cited by 731
A monte carlo method for factorization
Pollard, J. M. (1975) · BIT Numerical Mathematics · doi:10.1007/bf01933667 · Cited by 403
Research works printed but not linked: 9
- A. Z. Broder. Weighted random mappings; properties and applications. Technical Report STAN-CS-85-1054, Computer Science Dept., Stanford University, 1985. (Author’s PhD Thesis).
- B.W. Char, K.O. Geddes, G.H. Gonnet, M.B. Monagan, and S.M. Watt. MAPLE: Reference Manual. University of Waterloo, 1988. 5th edition.
- M. A. Evgrafov. Analytic Functions. Dover, New York, 1966.
- J. Jaworski. Random Mappings. PhD thesis, A. Mickiewicz University, 1985. (In Polish).
- V. F. Kolchin. Random Mappings. Optimization Software Inc., New York, 1986. Translated from Slučajnye Otobraženija, Nauka, Moscow, 1984.
- L. R. Mutafčiev. On some stochastic problems of discrete mathematics. In Mathematics and Education in Mathematics (Sunny Beach), pages 57–80, Bulgarian Academy of Sciences, Sophia, Bulgaria, 1984.
- A. I. Pavlov. On an equation in a symmetric semigroup. Proceedings of the Steklov Institute of Mathematics, 177(4):121–128, 1988. (Issue on Probabilistic Problems of Discrete Mathematics).
- Yu. L. Pavlov. On random mappings with constraints on the number of cycles. Proceedings of the Steklov Institute of Mathematics, 177(4):131–143, 1988. (Issue on Probabilistic Problems of Discrete Mathematics).
- M. Soria. Méthodes d’analyse pour les constructions combinatories et les algorithmes. Doctorat ès sciences, Université de Paris-Sud, Orsay, 1989.
Cited by
Sorted by citations
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Guide to Elliptic Curve Cryptography
Hankerson, D., Menezes, A., & Vanstone, S. A. (2004) · Springer eBooks · doi:10.1007/b97644 · Cited by 3,102
Combinatorial Stochastic Processes
Pitman, J., & Picard, J. (2006) · Springer eBooks · doi:10.1007/b11601500 · Cited by 988
Singularity Analysis of Generating Functions
Flajolet, P., & Odlyzko, A. M. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403019 · Cited by 786
Self-citationKey establishment in large dynamic groups using one-way function trees
Sherman, A. T., & McGrew, D. A. (2003) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2003.1199073 · Cited by 707
Parallel Collision Search with Cryptanalytic Applications
van Oorschot, P. C., & Wiener, M. J. (1999) · Journal of Cryptology · doi:10.1007/pl00003816 · Cited by 639
Asymptotic enumeration methods
Odlyzko, A. M. (1996) · The MIT Press eBooks · Cited by 303
Self-citationBoltzmann Samplers for the Random Generation of Combinatorial Structures
Duchon, P., Flajolet, P., Louchard, G., & Schaeffer, G. (2004) · Combinatorics Probability Computing · doi:10.1017/s0963548304006315 · Cited by 295
Self-citationA calculus for the random generation of labelled combinatorial structures
Flajolet, P., Zimmermann, P., & Cutsem, B. V. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90226-7 · Cited by 281
Self-citationDynamic Analysis of Digital Chaotic Maps via State-Mapping Networks
Li, C., Feng, B., Li, S., Kurths, J., & Chen, G. (2019) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2018.2888688 · Cited by 270
Moderately hard, memory-bound functions
Abadi, M., Burrows, M., Manasse, M., & Wobber, T. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1064340.1064341 · Cited by 218
Preimage Attacks on One-Block MD4, 63-Step MD5 and More
Aoki, K., & Sasaki, Y. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04159-4_7 · Cited by 182
Euler’s constant: Euler’s work and modern developments
Lagarias, J. C. (2013) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-2013-01423-x · Cited by 161
Parallel collision search with application to hash functions and discrete logarithms
van Oorschot, P. C., & Wiener, M. J. (1994) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/191177.191231 · Cited by 145
Generic Groups, Collision Resistance, and ECDSA
Brown, D. R. L. (2005) · Designs Codes and Cryptography · doi:10.1007/s10623-003-6154-z · Cited by 136
Linear Statistical Weakness of Alleged RC4 Keystream Generator
Golić, J. D. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_16 · Cited by 133
On the Analysis of Linear Probing Hashing
Flajolet, P., Poblete, P., & Viola, A. (1998) · Algorithmica · doi:10.1007/pl00009236 · Cited by 132
Self-citationAutomatic average-case analysis of algorithms
Flajolet, P., Salvy, B., & Zimmermann, P. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(91)90145-r · Cited by 108
Self-citationBlockcipher-Based Hashing Revisited
Stam, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03317-9_5 · Cited by 98
Independent Process Approximations for Random Combinatorial Structures
Arratia, R. A., & Tavaré, S. (1994) · Advances in Mathematics · doi:10.1006/aima.1994.1022 · Cited by 96
Moderately Hard, Memory-Bound Functions.
Abadi, M., Burrows, M. T., & Wobber, T. (2003) · Cited by 94
Speeding up the Discrete Log Computation on Curves with Automorphisms
Duursma, I., Gaudry, P., & Morain, F. (1999) · Lecture notes in computer science · doi:10.1007/978-3-540-48000-6_10 · Cited by 88
Kim, P., Han, D., & Jeong, K. C. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2107-3 · Cited by 80
“Useful statistics of random functions can be found in [29].”
BackgroundFlajolet, P., Grabner, P. J., Kirschenhofer, P., & Prodinger, H. (1995) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(93)e0258-n · Cited by 76
Self-citationLimit Theorems for Combinatorial Structures via Discrete Process Approximations
Arratia, R. A., & Tavaré, S. (1992) · Random Structures and Algorithms · doi:10.1002/rsa.3240030310 · Cited by 72
Block Ciphers: Analysis, Design and Applications
Knudsen, L. R. (1994) · DAIMI Report Series · doi:10.7146/dpb.v23i485.6978 · Cited by 71
Brownian bridge asymptotics for random mappings
Aldous, D., & Pitman, J. (1994) · Random Structures and Algorithms · doi:10.1002/rsa.3240050402 · Cited by 71
Pseudorandomness and Dynamics of Fermat Quotients
Ostafe, A., & Shparlinski, I. E. (2011) · SIAM Journal on Discrete Mathematics · doi:10.1137/100798466 · Cited by 66
Attacks on Fast Double Block Length Hash Functions
Knudsen, L. R., Lai, X., & Bart Preneel, A. (1998) · Journal of Cryptology · doi:10.1007/s001459900035 · Cited by 66
Secure and Efficient Broadcast Authentication in Wireless Sensor Networks
Kwon, T., & Hong, J. (2009) · IEEE Transactions on Computers · doi:10.1109/tc.2009.171 · Cited by 57
Current trends and open problems in arithmetic dynamics
Benedetto, R. L., Ingram, P., Jones, R., Manes, M. A., Silverman, J. H., & Tucker, T. J. (2019) · Bulletin of the American Mathematical Society · doi:10.1090/bull/1665 · Cited by 55
Hidden Shift Quantum Cryptanalysis and Implications
Bonnetain, X., & Naya‐Plasencia, M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03326-2_19 · Cited by 54
Scaling Laws of Associative Memory Retrieval
Romani, S., Pinkoviezky, I., Rubin, A., & Tsodyks, M. V. (2013) · Neural Computation · doi:10.1162/neco_a_00499 · Cited by 51
On the Implementation of Huge Random Objects
Goldreich, O., Goldwasser, S., & Nussboim, A. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238182 · Cited by 50
Towards a General RC4-Like Keystream Generator
Gong, G., Gupta, K. C., Hell, M., & Nawaz, Y. (2005) · Lecture notes in computer science · doi:10.1007/11599548_14 · Cited by 50
Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2
Dinur, I., Dunkelman, O., Keller, N., & Adi Shamir, Z. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42033-7_18 · Cited by 45
A Comparison of Cryptanalytic Tradeoff Algorithms
Hong, J., & Moon, S. (2012) · Journal of Cryptology · doi:10.1007/s00145-012-9128-3 · Cited by 45
Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
van Oorschot, P. C., & Wiener, M. J. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_18 · Cited by 43
Asymptotics of poisson approximation to random discrete distributions: an analytic approach
Hwang, H. (1999) · Advances in Applied Probability · doi:10.1017/s0001867800009198 · Cited by 43
Markov Chain Aggregation for Agent-Based Models
Banisch, S. (2015) · Understanding complex systems · doi:10.1007/978-3-319-24877-6 · Cited by 44
Largest component in random combinatorial structures
Gourdon, X. (1998) · Discrete Mathematics · doi:10.1016/s0012-365x(97)00115-5 · Cited by 42
Fundamental Law of Memory Recall
Naim, M., Katkov, M., Romani, S., & Tsodyks, M. V. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.018101 · Cited by 43
Kogan, D., Manohar, N., & Boneh, D. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3133989 · Cited by 40
Design and Analysis of Password-Based Key Derivation Functions
Yao, F., & Yin, Y. L. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30574-3_17 · Cited by 40
Random combinatorial structures and prime factorizations
Arratia, R. A., Barbour, A. D., & Tavaré, S. (1997) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-22223 · Cited by 40
A space efficient algorithm for group structure computation
Teske, E. (1998) · Mathematics of Computation · doi:10.1090/s0025-5718-98-00968-5 · Cited by 40
New Generic Attacks against Hash-Based MACs
Leurent, G., Peyrin, T., & Wang, L. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42045-0_1 · Cited by 39
Wreath Products and Proportions of Periodic Points
Juul, J., Kurlberg, P., Madhu, K., & Tucker, T. J. (2015) · International Mathematics Research Notices · doi:10.1093/imrn/rnv273 · Cited by 37
Jenkins, R. J. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60865-6_41 · Cited by 37
Revisiting LFSRs for Cryptographic Applications
Arnault, F., Berger, T. P., Minier, M., & Pousse, B. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2164234 · Cited by 36
Analytic analysis of algorithms
Flajolet, P. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55719-9_74 · Cited by 36
Self-citationDesign and Analysis of Password-Based Key Derivation Functions
Yao, F. F., & Yin, Y. L. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.853307 · Cited by 35
Dynamical Systems Generated by Rational Functions
Niederreiter, H., & Shparlinski, I. E. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44828-4_2 · Cited by 34
Short Proofs of Knowledge for Factoring
Poupard, G., & Stern, J. (2000) · Lecture notes in computer science · doi:10.1007/978-3-540-46588-1_11 · Cited by 34
Large deviations of combinatorial distributions. II. Local limit theorems
Hwang, H. (1998) · The Annals of Applied Probability · doi:10.1214/aoap/1027961038 · Cited by 32
Quantum Algorithms for the $$k$$-xor Problem
Grassi, L., Naya‐Plasencia, M., & Schrottenloher, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03326-2_18 · Cited by 32
TMD-Tradeoff and State Entropy Loss Considerations of Streamcipher MICKEY
Hong, J., & Kim, W.-H. (2005) · Lecture notes in computer science · doi:10.1007/11596219_14 · Cited by 31
Variation of Periods Modulo p in Arithmetic DynamicsPreprint
Silverman, J. H. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.1505 · Cited by 31
A precise analysis of Cuckoo hashing
Drmota, M., & Kutzelnigg, R. (2012) · ACM Transactions on Algorithms · doi:10.1145/2151171.2151174 · Cited by 30
Cyclic annealing as an iterated random map
Mungan, M., & Witten, T. A. (2019) · Physical review. E · doi:10.1103/physreve.99.052132 · Cited by 29
Smallest components in decomposable structures: Exp-log class
Panario, D., & Richmond, B. (2001) · Algorithmica · doi:10.1007/bf02679619 · Cited by 28
Analysis of a randomized rendezvous algorithm
Métivier, Y., Saheb-Djahromi, N., & Zemmari, A. (2003) · Information and Computation · doi:10.1016/s0890-5401(03)00054-3 · Cited by 28
Improved Generic Algorithms for 3-Collisions
Joux, A., & Lucks, S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10366-7_21 · Cited by 27
An iterative construction of irreducible polynomials reducible modulo every prime
Jones, R. (2012) · Journal of Algebra · doi:10.1016/j.jalgebra.2012.05.020 · Cited by 26
Images and Preimages in Random Mappings
Drmota, M., & Soria, M. (1997) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480194268421 · Cited by 26
Generic Universal Forgery Attack on Iterative Hash-Based MACs
Peyrin, T., & Wang, L. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-55220-5_9 · Cited by 25
Updates on Generic Attacks against HMAC and NMAC
Guo, J., Peyrin, T., Sasaki, Y., & Wang, L. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44371-2_8 · Cited by 24
On the length of critical orbits of stable quadratic polynomials
Ostafe, A., & Shparlinski, I. E. (2010) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-10-10404-3 · Cited by 23
Finding Many Collisions via Reusable Quantum Walks
Bonnetain, X., Chailloux, A., Schrottenloher, A., & Shen, Y. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30589-4_8 · Cited by 28
The cost of false alarms in Hellman and rainbow tradeoffs
Hong, J. (2010) · Designs Codes and Cryptography · doi:10.1007/s10623-010-9368-x · Cited by 22
On the influence of the interaction graph on a finite dynamical system
Gadouleau, M. (2019) · Natural Computing · doi:10.1007/s11047-019-09732-y · Cited by 22
Parallel random number generator for inexpensive configurable hardware cells
Ackermann, J., Tangen, U., Bödekker, B., Breyer, J., Stoll, E., & McCaskill, J. S. (2001) · Computer Physics Communications · doi:10.1016/s0010-4655(01)00242-9 · Cited by 21
A switching closure test to analyze cryptosystems
Morita, H., Ohta, K., & Miyaguchi, S. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_13 · Cited by 20
Mappings on Decomposable Combinatorial Structures: Analytic Approach
Manstavičius, E. (2002) · Combinatorics Probability Computing · doi:10.1017/s0963548301005016 · Cited by 20
Exact distribution of individual displacements in linear probing hashing
Viola, A. (2005) · ACM Transactions on Algorithms · doi:10.1145/1103963.1103965 · Cited by 20
Functional graphs of polynomials over finite fields
Konyagin, S. V., Luca, F., Mans, B., Mathieson, L., Sha, M., & Shparlinski, I. E. (2015) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2015.07.003 · Cited by 19
Efficient deterministic and non-deterministic pseudorandom number generation
Li, J., Zheng, J., & Whitlock, P. A. (2016) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2016.07.011 · Cited by 18
Latent Semantic Mapping: Principles and Applications
Bellegarda, J. R. (2008) · Cited by 18
A Comparison of Time-Memory Trade-Off Attacks on Stream Ciphers
van den Broek, F., & Poll, E. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38553-7_24 · Cited by 17
Key Recovery Attacks on Iterated Even–Mansour Encryption Schemes
Dinur, I., Dunkelman, O., Keller, N., & Adi Shamir, Z. (2015) · Journal of Cryptology · doi:10.1007/s00145-015-9207-3 · Cited by 17
Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions
Akshima, Cash, D., Drucker, A., & Wee, H. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56784-2_6 · Cited by 17
Distribution of the number of accessible states in a random deterministic automaton
Carayol, A., & Nicaud, C. (2012) · HAL · doi:10.4230/lipics.stacs.2012.194 · Cited by 16
Nicaud, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44522-8_2 · Cited by 16
Hash Function Vulnerability Index and Hash Chain Attacks
Lee, D. (2007) · IEEE Workshop on Secure Network Protocols (NPSec) · doi:10.1109/npsec.2007.4371616 · Cited by 16
On asymptotics of certain sums arising in coding theory
Wojciech Szpankowski, A. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.476341 · Cited by 16
Success probability of the Hellman trade-off
Ma, D., & Hong, J. (2008) · Information Processing Letters · doi:10.1016/j.ipl.2008.12.002 · Cited by 15
Mapping the discrete logarithm
Cloutier, D. R., & Holden, J. (2010) · Involve a Journal of Mathematics · doi:10.2140/involve.2010.3.197 · Cited by 15
Lugo, M. (2009) · The Electronic Journal of Combinatorics · doi:10.37236/188 · Cited by 15
Métivier, Y., Saheb-Djahromi, N., & Zemmari, A. (2000) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-8405-1_16 · Cited by 15
Quantum Time–Space Tradeoff for Finding Multiple Collision Pairs
Hamoudi, Y., & Magniez, F. (2023) · ACM Transactions on Computation Theory · doi:10.1145/3589986 · Cited by 37
Low-Gate Quantum Golden Collision Finding
Jaques, S., & Schrottenloher, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81652-0_13 · Cited by 15
T/Key: Second-Factor Authentication From Secure Hash ChainsPreprint
Kogan, D., Manohar, N., & Boneh, D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.08424 · Cited by 14
Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners
Bao, Z., Wang, L., Guo, J., & Gu, D. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63715-0_14 · Cited by 13
On random mappings and random permutations
Chambers, W. G. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60590-8_3 · Cited by 13
Accelerating Pollard’s Rho Algorithm on Finite Fields
Cheon, J. H., Hong, J., & Kim, M. (2010) · Journal of Cryptology · doi:10.1007/s00145-010-9093-7 · Cited by 13
Collision Spectrum, Entropy Loss, T-Sponges, and Cryptanalysis of GLUON-64
Perrin, L. P., & Khovratovich, D. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46706-0_5 · Cited by 12
A model for roundoff and collapse in computation of chaotic dynamical systems
Diamond, P., Kloeden, P. E., Kozyakin, V. S., & Pokrovskii, A. V. (1997) · Mathematics and Computers in Simulation · doi:10.1016/s0378-4754(97)00070-0 · Cited by 12
The Width of Galton-Watson Trees Conditioned by the Size
Drmota, M., & Gittenberger, B. (2004) · Discrete Mathematics & Theoretical Computer Science · doi:10.46298/dmtcs.323 · Cited by 12
On the Security of Double and 2-Key Triple Modes of Operation
Handschuh, H., & Bart Preneel, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48519-8_16 · Cited by 12
The application of hash chains and hash structures to cryptography
Page, T. (2009) · Royal Holloway Digital Repository (Royal Holloway University of London) · Cited by 12
Metadata
- Authors
- Flajolet, P., & Odlyzko, A. M.
- Affiliations
- Institut national de recherche en sciences et technologies du numérique (FR)
- AT&T (United States) (US)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-11-15
- Pages
- 329-354
- OpenAlex
- W2226303357
- Cited by
- 274
- References
- 42
- Citations by year
- 2026: 1 · 2025: 4 · 2024: 5 · 2023: 7 · 2022: 6 · 2021: 6 · 2020: 9 · 2019: 15 · 2018: 12 · 2017: 11 · 2016: 15 · 2015: 15 · 2014: 17 · 2013: 11 · 2012: 13
- FWCI
- 12.13
- Type
- conference paper
- Language
- en
- Open access
- green
- inria.hal.science
- Licence
- other-oa
- Locations
- Springer eBooks (publishedVersion)
- HAL (submittedVersion, other-oa)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Keywords
- random maps, finite sets, generating functions, singularity analysis, characteristic parameters, symbolic computation, random number generation, algorithm analysis
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
