Upfal, Eli, 1954-....
Upfal, Eli
Eli Upfal
VIAF ID: 103771675 (Personal)
Permalink: http://viaf.org/viaf/103771675
Preferred Forms
- 100 0 _ ‡a Eli Upfal
- 200 _ | ‡a Upfal ‡b Eli ‡f 1954-....
-
- 100 1 _ ‡a Upfal, Eli
-
-
- 100 1 _ ‡a Upfal, Eli
- 100 1 _ ‡a Upfal, Eli
-
-
- 100 1 _ ‡a Upfal, Eli ‡d 1954-
-
- 100 1 _ ‡a Upfal, Eli, ‡d 1954-
-
-
-
- 100 1 _ ‡a Upfal, Eli, ‡d 1954-....
4xx's: Alternate Name Forms (7)
5xx's: Related Names (1)
Works
Title | Sources |
---|---|
ABRA | |
ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages | |
Accurate computation of survival statistics in genome-wide studies | |
Algorithms on evolving graphs | |
Apprentissage de motifs en grande dimension appliqué aux séries temporelles. | |
Building low-diameter peer-to-peer networks | |
Discovery of mutated subnetworks associated with clinical data in cancer. | |
Dynamic packet routing on arrays with bounded buffers | |
Efficient communication in an ad-hoc network | |
Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees | |
Efficient methods for computing investment strategies for multi-market commodity trading | |
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets | |
Existence and Construction of Edge-Disjoint Paths on Expander Graphs | |
Fast distributed PageRank computation | |
Finding driver pathways in cancer: models and algorithms | |
Finding near neighbors through cluster pruning | |
High dimensional pattern learning applied to symbolic time-series | |
How Inclusive Are Wikipedia's Hyperlinks in Articles Covering Polarizing Topics? | |
How to share memory ... 1984 | |
Kakuritsu to keisan : Rantaku arugorizumu to kakuritsuteki kaiseki. | |
A learned comparative expression measure for affymetrix genechip DNA microarrays. | |
Learning-based Query Performance Modeling and Prediction | |
Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input | |
Machine Learning in High Energy Physics Community White Paper | |
MADMX: a strategy for maximal dense motif extraction. | |
MapReduce and streaming algorithms for diversity maximization in metric spaces of bounded doubling dimension | |
Metody probabilistyczne i obliczenia : algorytmy randomizowane i analiza probabilistyczna | |
Mining top-K frequent itemsets through progressive sampling | |
Near-perfect token distribution | |
On the Sample Complexity of Cancer Pathways Identification. | |
Optimal reconstruction of a sequence from its probes. | |
PARMA | |
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs | |
Probability and computing, 2005: | |
Reducing polarization and increasing diverse navigability in graphs by inserting edges and swapping edge weights | |
A simple and deterministic competitive algorithm for online facility location | |
Sort Me If You Can: How to Sort Dynamic Data | |
Sorting and selection on dynamic data | |
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation | |
Space-round tradeoffs for MapReduce computations | |
Stability and efficiency of a random local load balancing protocol | |
Steady state analysis of balanced-allocation routing | |
A theory of wormhole routing in parallel computers | |
TRIÈST | |
VC-Dimension and Rademacher Averages | |
The VC-Dimension of SQL Queries and Selectivity Estimation through Sampling | |
Wiggins | |
Wikipedia Polarization and Its Effects on Navigation Paths | |
The worst-case running time of the random simplex algorithm is exponential in the height | |
確率と計算 : 乱択アルゴリズムと確率的解析 |