182 results on '"Ori Rottenstreich"'
Search Results
2. Understanding the Blockchain Interoperability Graph Based on Cryptocurrency Price Correlation.
3. Privacy Comparison for Bitcoin Light Client Implementations.
4. Probe-Based Study of Traffic Variability for the Design of Traffic Light Plans.
5. Survivable Payment Channel Networks.
6. An Empirical Study of Cross-Chain Arbitrage in Decentralized Exchanges.
7. Estimating Daily Start Times of Periodic Traffic Light Plans from Traffic Trajectories.
8. Quantitative Approach for Coordination, at Scale, of Signalized Intersection Pairs.
9. Invertible Bloom Lookup Tables with Listing Guarantees.
10. Braess Paradox in Layer-2 Blockchain Payment Networks.
11. Allowing Blockchain Loans with Low Collateral.
12. Coding for IBLTs with Listing Guarantees.
13. Survivability via Path Disjointness for HyperX.
14. Communication-aware Fairness in Blockchain Transaction Ordering.
15. Scaling Open vSwitch with a Computational Cache.
16. HybridTSS: A Recursive Scheme Combining Coarse- and Fine- Grained Tuples for Packet Classification.
17. Minimal Total Deviation in TCAM Load Balancing.
18. Coding Size of Traffic Partition in Switch Memories.
19. Nucleotide String Indexing using Range Matching.
20. Optimizing Merkle Proof Size for Blockchain Transactions.
21. Demand-aware Channel Topologies for Off-chain Payments.
22. Sketches for Blockchains.
23. MapEmbed: Perfect Hashing with High Load Factor and Fast Update.
24. Demand Matrix Optimization for Offchain Payments in Blockchain.
25. Effective Space Saving.
26. Distributed Sketching with Traffic-Aware Summaries.
27. Analyzing and Assessing Pollution Attacks on Bloom Filters: Some Filters are More Vulnerable than Others.
28. Clustreams: Data Plane Clustering.
29. How Much TCAM do we Need for Splitting Traffic?
30. Scalable Blockchain Anomaly Detection with Sketches.
31. Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms.
32. Reliable and Time-efficient Virtualized Function Placement.
33. Isolated Trees in Multi-Tenant Fat Tree Datacenters for In-Network Computing.
34. Optimal approximations for traffic distribution in bounded switch memories.
35. Scalable Block Execution via Parallel Validation.
36. State Sharding with Space-aware Representations.
37. Cooperative Rule Caching for SDN Switches.
38. Age-aware Fairness in Blockchain Transaction Ordering.
39. Pollution Attacks on Counting Bloom Filters for Black Box Adversaries.
40. Constructions and Applications for Accurate Counting of the Bloom Filter False Positive Free Zone.
41. A Computational Approach to Packet Classification.
42. Neural Networks for Computer Systems.
43. Fine-grained queue measurement in the data plane.
44. Enforcing Fairness in Blockchain Transaction Ordering.
45. Set Reconciliation with Cuckoo Filters.
46. Optimal Representations of a Traffic Distribution in Switch Memories.
47. The Consistent Cuckoo Filter.
48. Elmo: source routed multicast for public clouds.
49. A Fair Consensus Protocol for Transaction Ordering.
50. Efficient Measurement on Programmable Switches Using Probabilistic Recirculation.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.