The following pages link to (Q2833177):
Displayed 50 items.
- On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors (Q1717538) (← links)
- The complexity of leader election in diameter-two networks (Q1988528) (← links)
- Quantum algorithm for the multicollision problem (Q2006780) (← links)
- Cellular string generators (Q2038015) (← links)
- Estimating multi-index models with response-conditional least squares (Q2044313) (← links)
- Quantifying the generalization error in deep learning in terms of data distribution and neural network smoothness (Q2057701) (← links)
- Approximate minimum selection with unreliable comparisons (Q2072098) (← links)
- Shotgun assembly of Erdős-Rényi random graphs (Q2078122) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- Percolation centrality via Rademacher Complexity (Q2091801) (← links)
- Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418) (← links)
- Noisy beeping networks (Q2105415) (← links)
- Efficient and competitive broadcast in multi-channel radio networks (Q2105449) (← links)
- Polymer dynamics via cliques: new conditions for approximations (Q2110377) (← links)
- Approximate NFA universality motivated by information theory (Q2112188) (← links)
- Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture (Q2121801) (← links)
- Local boxicity (Q2122684) (← links)
- Expected size of random Tukey layers and convex layers (Q2123288) (← links)
- How to meet ternary LWE keys (Q2128581) (← links)
- The probabilistic travelling salesman problem with crowdsourcing (Q2146980) (← links)
- Higher criticism to compare two large frequency tables, with sensitivity to possible rare and weak differences (Q2148983) (← links)
- Fast spectral analysis for approximate nearest neighbor search (Q2163259) (← links)
- An FPTAS for the hardcore model on random regular bipartite graphs (Q2166750) (← links)
- Edge-ordered Ramsey numbers (Q2178669) (← links)
- A quantified approach of predicting suitability of using the unscented Kalman filter in a non-linear application (Q2208560) (← links)
- Using error decay prediction to overcome practical issues of deep active learning for named entity recognition (Q2217437) (← links)
- Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
- Exceptional graphs for the random walk (Q2227475) (← links)
- Behavioural isomorphism, cognitive economy and recursive thought in non-transitive game strategy (Q2307360) (← links)
- Nonparametric intensity estimation from noisy observations of a Poisson process under unknown error distribution (Q2338100) (← links)
- Sliding-window probabilistic threshold aggregate queries on uncertain data streams (Q2660986) (← links)
- On binomial and Poisson sums arising from the displacement of randomly placed sensors (Q2663372) (← links)
- Parallel load balancing on constrained client-server topologies (Q2664933) (← links)
- Splits with forbidden subgraphs (Q2666586) (← links)
- Concentration of maximum degree in random planar graphs (Q2673490) (← links)
- Near-linear convergence of the random Osborne algorithm for matrix balancing (Q2687049) (← links)
- BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
- Bankrupting Sybil despite churn (Q2698290) (← links)
- A random growth model with any real or theoretical degree distribution (Q2699948) (← links)
- (Q3304151) (← links)
- Scale-free percolation in continuous space: quenched degree and clustering coefficient (Q4964783) (← links)
- (Q5075777) (← links)
- Fairness in Influence Maximization through Randomization (Q5076357) (← links)
- (Q5091175) (← links)
- (Q5092423) (← links)
- Sharper Probabilistic Backward Error Analysis for Basic Linear Algebra Kernels with Random Data (Q5132023) (← links)
- A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs (Q5132024) (← links)
- Stimulated Raman adiabatic passage-like protocols for amplitude transfer generalize to many bipartite graphs (Q5140960) (← links)
- Optimal bounds for single-source Kolmogorov extractors (Q5217889) (← links)
- The Complexity of Counting Surjective Homomorphisms and Compactions (Q5232140) (← links)