An adaptive algorithm for selecting profitable keywords for search-based advertising services
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Formal verification of concurrent software: two case studies
Proceedings of the 2006 workshop on Parallel and distributed systems: testing and debugging
Beyond bloom filters: from approximate membership checks to approximate state machines
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A Mechanism for Communication-Efficient Broadcast Encryption over Wireless Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Communicating via fireflies: geographic routing on duty-cycled sensors
Proceedings of the 6th international conference on Information processing in sensor networks
Path coupling without contraction
Journal of Discrete Algorithms
Randomized algorithm for the sum selection problem
Theoretical Computer Science
Performance modeling of network coding in epidemic routing
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Less hashing, same performance: building a better bloom filter
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An improved construction for counting bloom filters
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Answering aggregation queries in a secure system model
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Link analysis for Web spam detection
ACM Transactions on the Web (TWEB)
Improved random graph isomorphism
Journal of Discrete Algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Network reliability importance measures: combinatorics and Monte Carlo based computations
ACS'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Computer Science - Volume 7
Biologically-inspired adaptive learning control strategies: A rough set approach
International Journal of Hybrid Intelligent Systems
Simple summaries for hashing with choices
IEEE/ACM Transactions on Networking (TON)
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
Uplink SDMA with limited feedback: throughput scaling
EURASIP Journal on Advances in Signal Processing
Event queries on correlated probabilistic streams
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Finding strongly connected components in parallel using O(log2n) reachability queries
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Limited view CT reconstruction and segmentation via constrained metric labeling
Computer Vision and Image Understanding
Toward Approximate Adaptive Learning
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Computing Approximate Nash Equilibria in Network Congestion Games
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
More Robust Hashing: Cuckoo Hashing with a Stash
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
The Journal of Machine Learning Research
A skip-list approach for efficiently processing forecasting queries
Proceedings of the VLDB Endowment
Nanowire addressing with randomized-contact decoders
Theoretical Computer Science
Network reliability importance measures: combinatorics and Monte Carlo based computations
WSEAS Transactions on Computers
BRICK: a novel exact active statistics counter architecture
Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Approximate shared-memory counting despite a strong adversary
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Randomized generation of acyclic orientations upon anonymous distributed systems
Journal of Parallel and Distributed Computing
Shape Matching by Random Sampling
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Brief paper: Probabilistic sorting and stabilization of switched systems
Automatica (Journal of IFAC)
The average-case complexity of counting distinct elements
Proceedings of the 12th International Conference on Database Theory
Data Mining and Knowledge Discovery
Theoretical Computer Science
An efficient rigorous approach for identifying statistically significant frequent itemsets
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient Frequent Itemsets Mining by Sampling
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Proceedings of the 28th ACM symposium on Principles of distributed computing
Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Theoretical Computer Science
Frequent subgraph pattern mining on uncertain graph data
Proceedings of the 18th ACM conference on Information and knowledge management
Distributed field estimation with randomly deployed, noisy, binary sensors
IEEE Transactions on Signal Processing
Key establishment schemes against storage-bounded adversaries in wireless sensor networks
IEEE Transactions on Wireless Communications
Long term study of peer behavior in the KAD DHT
IEEE/ACM Transactions on Networking (TON)
Effectively indexing uncertain moving objects for predictive queries
Proceedings of the VLDB Endowment
Complexity issues in color-preserving graph embeddings
Theoretical Computer Science
Fault-Containment in Weakly-Stabilizing Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
PUF-Based Authentication Protocols --- Revisited
Information Security Applications
Delay-throughput tradeoff for overlaid wireless networks of different priorities
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On the delay of network coding over line networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Approximate shared-memory counting despite a strong adversary
ACM Transactions on Algorithms (TALG)
Journal of Combinatorial Theory Series A
An improved analysis of the lossy difference aggregator
ACM SIGCOMM Computer Communication Review
Comparing variants of MMAS ACO algorithms on pseudo-boolean functions
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Secure and robust virtual coordinate system in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Manipulation-resistant reputations using hitting time
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Tradeoffs and average-case equilibria in selfish routing
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Sensor network gossiping or how to break the broadcast lower bound
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Derandomizing graph tests for homomorphism
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Randomized rendez-vous with limited memory
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Asymptotic rate limits for randomized broadcasting with network coding
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Codes against online adversaries
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Understanding cardinality estimation using entropy maximization
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Coloring spatial point processes with applications to peer discovery in large wireless networks
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Software-based remote code attestation in wireless sensor network
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Can quantum search accelerate evolutionary algorithms?
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Bernoulli sampling based (ε, δ)-approximate aggregation in large-scale sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Routing for energy minimization in the speed scaling model
INFOCOM'10 Proceedings of the 29th conference on Information communications
Stochastic nanoscale addressing for logic
Proceedings of the 2010 IEEE/ACM International Symposium on Nanoscale Architectures
Efficient algorithms for large-scale local triangle counting
ACM Transactions on Knowledge Discovery from Data (TKDD)
Mining top-K frequent itemsets through progressive sampling
Data Mining and Knowledge Discovery
Carousel: scalable logging for intrusion prevention systems
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Flowcode: multi-site data exchange over wireless ad-hoc networks using network coding
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Security-capacity trade-off in large wireless networks using keyless secrecy
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
On optimal feedback allocation in multichannel wireless downlinks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Tradeoffs and Average-Case Equilibria in Selfish Routing
ACM Transactions on Computation Theory (TOCT)
On Euclidean norm approximations
Pattern Recognition
Pricing randomized allocations
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Identifying frequent items in a network using gossip
Journal of Parallel and Distributed Computing
Optimizing monotone functions can be difficult
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Propagation connectivity of random hypergraphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On the probability distribution of typological frequencies
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Contention resolution in multiple-access channels: k-selection in radio networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Fast randomized test-and-set and renaming
DISC'10 Proceedings of the 24th international conference on Distributed computing
Low communication self-stabilization through randomization
DISC'10 Proceedings of the 24th international conference on Distributed computing
Superselectors: efficient constructions and applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Designing floating codes for expected performance
IEEE Transactions on Information Theory
A*-tree: a structure for storage and modeling of uncertain multidimensional arrays
Proceedings of the VLDB Endowment
Resisting structural re-identification in anonymized social networks
The VLDB Journal — The International Journal on Very Large Data Bases
Theoretical Computer Science
Practical universal random sampling
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
On the phase transitions of random k-constraint satisfaction problems
Artificial Intelligence
An overview of the transmission capacity of wireless networks
IEEE Transactions on Communications
An efficient decentralized algorithm for the distributed trigger counting problem
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
A course on probability theory for computer scientists
Proceedings of the 42nd ACM technical symposium on Computer science education
More Robust Hashing: Cuckoo Hashing with a Stash
SIAM Journal on Computing
Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges
SIAM Journal on Discrete Mathematics
Scaling laws for overlaid wireless networks: a cognitive radio network versus a primary network
IEEE/ACM Transactions on Networking (TON)
The power of one move: hashing schemes for hardware
IEEE/ACM Transactions on Networking (TON)
Mathematics of Operations Research
An objective evaluation method for image restoration
Journal of Electrical and Computer Engineering
Non-uniform mutation rates for problems with unknown solution lengths
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
On the number of binary-minded individuals required to compute 12
Theoretical Computer Science
Modeling reciprocity in social interactions with probabilistic latent space models
Natural Language Engineering
Randomized rendezvous with limited memory
ACM Transactions on Algorithms (TALG)
Efficient and generic evaluation of ranked queries
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Optimal-time adaptive strong renaming, with applications to counting
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Radio network distributed algorithms in the unknown neighborhood model
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Set covering with ordered replacement: additive and multiplicative gaps
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Two hardness results on feedback vertex sets
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Secure and self-stabilizing clock synchronization in sensor networks
Theoretical Computer Science
A constraint satisfaction cryptanalysis of bloom filters in private record linkage
PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
On cardinality estimation protocols for wireless sensor networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
A note on treewidth in random graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Streaming algorithms for 2-coloring uniform hypergraphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
ESA'11 Proceedings of the 19th European conference on Algorithms
Coloring spatial point processes with applications to peer discovery in large wireless networks
IEEE/ACM Transactions on Networking (TON)
BRICK: a novel exact active statistics counter architecture
IEEE/ACM Transactions on Networking (TON)
Integrated circuit digital rights management techniques using physical level characterization
Proceedings of the 11th annual ACM workshop on Digital rights management
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
Journal of the ACM (JACM)
Sub-logarithmic test-and-set against aweak adversary
DISC'11 Proceedings of the 25th international conference on Distributed computing
Unbounded contention resolution in multiple-access channels
DISC'11 Proceedings of the 25th international conference on Distributed computing
Randomized consensus in expected O(n2) total work using single-writer registers
DISC'11 Proceedings of the 25th international conference on Distributed computing
Randomized Self-Assembly for Exact Shapes
SIAM Journal on Computing
Subgraphs of Weakly Quasi-Random Oriented Graphs
SIAM Journal on Discrete Mathematics
SIAM Journal on Scientific Computing
Privacy-preserving group data access via stateless oblivious RAM simulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The entropy rounding method in approximation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Sublinear time, measurement-optimal, sparse recovery for all
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Ultra-fast rumor spreading in social networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Understanding cardinality estimation using entropy maximization
ACM Transactions on Database Systems (TODS)
A distributed resource management model for Virtual Private Networks: Tit-for-Tat strategies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Overcoming browser cookie churn with clustering
Proceedings of the fifth ACM international conference on Web search and data mining
Geometric minimum spanning trees with GEOFILTERKRUSKAL*
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Robust passive hardware metering
Proceedings of the International Conference on Computer-Aided Design
On the randomness requirements of rumor spreading
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Scaling probabilistic timing verification of hardware using abstractions in design source code
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Revisiting randomized parallel load balancing algorithms
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Loosely-Stabilizing leader election in population protocol model
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Stable sets of threshold-based cascades on the erdős-rényi random graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
On generating templates for hypothesis in inductive logic programming
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Privacy preserving picture sharing: enforcing usage control in distributed on-line social networks
Proceedings of the Fifth Workshop on Social Network Systems
Routing for power minimization in the speed scaling model
IEEE/ACM Transactions on Networking (TON)
Leveraging trust and distrust for sybil-tolerant voting in online social media
Proceedings of the 1st Workshop on Privacy and Security in Online Social Media
Maximizing network lifetime on the line with adjustable sensing ranges
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The use of tail inequalities on the probable computational time of randomized search heuristics
Theoretical Computer Science
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets
Journal of the ACM (JACM)
Aiding the detection of fake accounts in large scale social online services
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Early prediction of NBTI effects using RTL source code analysis
Proceedings of the 49th Annual Design Automation Conference
How to schedule a cascade in an arbitrary graph
Proceedings of the 13th ACM Conference on Electronic Commerce
Shape matching by random sampling
Theoretical Computer Science
PLR: a benchmark for probabilistic data stream management systems
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part III
BALLAST: a ball-based algorithm for structural motifs
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
Revisiting randomized parallel load balancing algorithms
Theoretical Computer Science
Loosely-stabilizing leader election in a population protocol model
Theoretical Computer Science
Random half-integral polytopes
Operations Research Letters
A dynamic programming approach to efficient sampling from Boltzmann distributions
Operations Research Letters
Space-round tradeoffs for MapReduce computations
Proceedings of the 26th ACM international conference on Supercomputing
Efficient subgraph similarity search on large probabilistic graph databases
Proceedings of the VLDB Endowment
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Constructing and sampling graphs with a prescribed joint degree distribution
Journal of Experimental Algorithmics (JEA)
Fixed budget computations: a different perspective on run time analysis
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Towards tight bounds for local broadcasting
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
A random sampling approach to worst-case design of structures
Structural and Multidisciplinary Optimization
Dynamic contention resolution in multiple-access channels
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
Foundations and Trends in Databases
A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model
Theoretical Computer Science
Monitoring churn in wireless networks
Theoretical Computer Science
Energy efficient alert in single-hop networks of extremely weak devices
Theoretical Computer Science
Whom to ask?: jury selection for decision making tasks on micro-blog services
Proceedings of the VLDB Endowment
Mining frequent itemsets over uncertain databases
Proceedings of the VLDB Endowment
Quantum strategies are better than classical in almost any XOR game
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Mixed-Strategy game based trust management for clustered wireless sensor networks
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Quick detection of nodes with large degrees
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
Competitive analysis of maintaining frequent items of a stream
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Exploring the throughput boundaries of randomized schedulers in wireless networks
IEEE/ACM Transactions on Networking (TON)
Journal of the ACM (JACM)
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Pattern matching in protein-protein interaction graphs
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce
Proceedings of the 21st ACM international conference on Information and knowledge management
A general model and thresholds for random constraint satisfaction problems
Artificial Intelligence
An adaptive tit-for-tat strategy for IEEE 802.11 CSMA/CA protocol
International Journal of Security and Networks
Bounding part scores for rapid detection with deformable part models
ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part III
Xtream: a system for continuous querying over uncertain data streams
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
Theoretical Computer Science
A novel hybrid IP traceback scheme with packet counters
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
ACM Computing Surveys (CSUR)
Journal of the ACM (JACM)
Steiner Tree Approximation via Iterative Randomized Rounding
Journal of the ACM (JACM)
Cache-Oblivious dictionaries and multimaps with negligible failure probability
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
On-the-Fly exact computation of bisimilarity distances
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Meme ranking to maximize posts virality in microblogging platforms
Journal of Intelligent Information Systems
A simpler proof for O(congestion+dilation) packet routing
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Mutation rate matters even when optimizing monotonic functions
Evolutionary Computation
Randomized loose renaming in o(log log n) time
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Connectivity and aggregation in multihop wireless networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Coalescing-branching random walks on graphs
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
The loss of serving in the dark
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Predicting response times for the Spotify backend
Proceedings of the 8th International Conference on Network and Service Management
Optimal content placement for peer-to-peer video-on-demand systems
IEEE/ACM Transactions on Networking (TON)
All-pairs shortest paths in O(n2) time with high probability
Journal of the ACM (JACM)
Multiverse: efficiently supporting distributed high-level speculation
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Analysis of the impact of data granularity on privacy for the smart grid
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Efficient and robust data aggregation using untrusted infrastructure
Proceedings of the 6th International Conference on Security of Information and Networks
Deterministic polynomial approach in the plane
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Cubicity, degeneracy, and crossing number
European Journal of Combinatorics
Reachability probabilities of quantum markov chains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Faster reaction mapping through improved naming techniques
Journal of Experimental Algorithmics (JEA)
Fast approximation of betweenness centrality through sampling
Proceedings of the 7th ACM international conference on Web search and data mining
A query scrambler for search privacy on the internet
Information Retrieval
Checkpointing algorithms and fault prediction
Journal of Parallel and Distributed Computing
Efficient estimation for high similarities using odd sketches
Proceedings of the 23rd international conference on World wide web
Approaching throughput optimality with limited feedback in multichannel wireless downlink networks
IEEE/ACM Transactions on Networking (TON)
FASA: accelerated S-ALOHA using access history for event-driven M2M communications
IEEE/ACM Transactions on Networking (TON)
The dropout learning algorithm
Artificial Intelligence
| Hi-index | 0.08 |