Aims and Scope It is the aim of this journal to meet two main objectives: to cover the latest research on discrete random structures, and to present applications of such research to problems in combinatorics and computer science. The goal is to provide a natural home for a significant body ...
random combinatorial structures random walks/Markov chains expander graphs and randomness extractors probabilistic proof systems random projections and embeddings error-correcting codes average-case analysis smoothed analysis property testing sublinear-time and local algorithms ...
Structure-informed materials informatics is a rapidly evolving discipline of materials science relying on the featurization of atomic structures or configurations to construct vector, voxel, graph, graphlet, and other representations useful for machine learning prediction of properties, fingerprinting, and ...
2024, Annals of Applied Probability Natural quasirandomness properties 2023, Random Structures and Algorithms☆ P.D. was supported in part by NSF grant DMS-08-04324, S.N.E. was supported in part by NSF grant DMS-09-07630, R.G. was supported in part by NSF grant DUE-10-20548. ...
As with “transformation” or “mapping”, we see the terms “linear”, “affine” or “multiplicative” when describing these hash algorithms. 2.1 Linear Hash Functions This is another example of using a single iteration of an LCG, this time to generate a hash. Didn’t investigate what kind...
gm. Geometry algorithms and structures hb. Pseudo hierarchical binary (hb) data file format num. Fundamental numerical methods such as root solvers, non-linear solvers, numerical derivatives, and quadrature ode. Solvers for ordinary differential equations ...
Generate random walks for the nodes in the graph, and keep them updated all the time. Use these random walks to efficiently compute acyclic Monte Carlo Pageranks (personalized and global). This project implements the algorithms described in this paper Structure /cmd/crawler.go: the main function...
A physical unclonable function (PUF) is a foundation of anti-counterfeiting processes due to its inherent uniqueness. However, the self-limitation of conventional graphical/spectral PUFs in materials often makes it difficult to have both high code flexib
D. Zuckerman Randomness-optimal oblivious sampling Random Structures Algorithms, 11 (1997), pp. 345-367 Google Scholar Cited by (264) Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses 2002, SIAM Journal on Computing Pseudorandomness 2011, Foundations and ...
Random Structures Algorithms, 2 (1991), pp. 1-10 CrossrefView in ScopusGoogle Scholar [ST(a)] J. Spencer and P. Tetali, Quasi-random graphs with tolerance ε, preprint. Google Scholar [Th87(a)] A. Thomason Random graphs, strongly regular graphs, and pseudo-random graphs Survey in Comb...