January 06, 2010
The Lynne and William Frankel Center presents the first seminar of 2010:Discrete and Computational Geometry.
The Frankel Center for Computer Science
Alon Building 37, Rm. 501 Ben-Gurion University
P.O 653 Ben-Gurion Blvd.
Be'er Sheva, 84105
Email: fradmin@cs.bgu.ac.il
Phone: (+972)8-642-8032
Fax: (+972)8-642-8021
Technical Reports 2013 2012, 2011, 2010, 2009, 2008
- Technical Report 13-04: June, 2013
Probabilistic Connectivity Threshold for Directional Antenna Widths
Hadassa Daltrophe, Shlomi Dolev and Zvi Lotker
- Technical Report 13-03: APRIL, 2013
WebGT: An Interactive Web-based System for Historical Document Ground Truth Generation
Ofer Biller, Abedelkadir Asi, Klara Kedem and Jihad El-Sana
- Technical Report 13-02: November, 2012
Semantical Cognitive Scheduling
Shlomi Dolev, Avi Mendelson and Igal Shilman - Technical Report 13-01: September, 2012
Data Interpolation: An Efficient Sampling Alternative for Big Data Aggregation
Hadassa Daltrophe, Shlomi Dolev and Zvi Lotker - Technical Report 12-05: May, 2012
Succinct Permanent is NEXP-hard with Many Hard Instances
Shlomi Dolev, Nova Fandina and Daniel Gutfreund - Technical Report 12-04: April, 2012
Optimal Euclidean spanners: really short, thin and lanky
Michael Elkin and Shay Solomon - Technical Report 11-10: August 14, 2011
Unique Permutation Hashing, Performance Analysis
Patricia A Suriana - Technical Report 11-04: March 23, 2011
Efficient Private Multi-Party Computations of Trust in the Presence of Curious and Malicious Users
Shlomi Dolev, Niv Gilboa, Marina Kopeetsky - Technical Report 11-06: June 5, 2011
Language-Independent Text Lines Extraction Using Seam Carving
Raid Saabni, Jihad El-Sana - Technical Report 11-04: March 23, 2011
Case Study in Hebrew Character Searching
Irina Rabaev, Ofer Biller, Jihad El-Sana, Klara Kedem, Itshak Dinstein - Technical Report 11-03: February 24, 2011
The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light
Shay Solomon - Technical Report 11-02: December 15, 2010
Steiner Shallow-Light Trees are Exponentially Better than Spanning Ones
Michael Elkin and Shay Solomon - Technical Report 10-08: August 24, 2010
Unique Permutation Hashing, Experiment Results
Patrick Gichuiri - Technical Report 10-06: August, 2010
Information Security for Sensors by Overwhelming Random Sequences and Permutation
Shlomi Dolev, Niv Gilboa, Marina Kopeetsky, G. Persiano, P.G. Spirakis - Technical Report 10-05: September, 2010
Rendezvous Tunnel for Anonymous Publishing
Ofer Hermony, Niv Gilboa, Eyal Felstaine,Yuval Elovici, Shlomi Dolev - Technical Report 10-04: 6 June, 2010
Hybrid Bellman-Ford-Dijkstra Algorithm
Yefim Dinitz and Rotem Itzhak - Technical Report 10-03: 29 April, 2010
An Optimal-Time Construction of Euclidean Sparse Spanners with Tiny Diameter
Shay Solomon - Technical Report 10-02: 29 November, 2009
Efficient Private Multi-Party Computations of Trust
Shlomi Dolev, Niv Gilboa, and Marina Koopetsky - Technical Report 10-01: 29 November, 2009
Semi-Myopic Measurement Selection for Optimization under Uncertainty
David Tolpin and Soloman Eyal Shimony - Technical Report 09-10: 11 October, 2009
A new library of surface patches - design and applications
Roi Gamliel, Klara Kedem, Rachel Kolodny & Chen Keasar - Technical Report 09-09: 19 August, 2009
Routing Betweenness Centrality
Shlomi Dolev, Yuval Elovici & Rami Puzis - Technical Report 09-08: 17 August, 2009
How to Overcome the Limits of Bounds
Olivier Pérès - Technical Report 09-07: 16 August, 2009
Trawling Traffic under Attack: Overcoming DDoS Attacks by Target-Controlled Traffic Filtering
Shlomi Dolev, Yuval Elovici, Alex Kesselman & Polina Zilberman - Technical Report 09-06: 13 August, 2009
Purifying Data by Machine Learning with Certainty Levels
Shlomi Dolev, Guy Leshem & Reuven Yagel - Technical Report 09-05: 13 August, 2009
Safe and Eventually Safe: Comparing Stabilizing and non-Stabilizing Algorithms on a Common Ground
Shlomi Dolev, Sylvie Delaët, and Olivier Pérès - Technical Report 09-04: 10 August, 2009
Anonymous Transactions in Computer Networks
Shlomi Dolev and Marina Kopeetsky - Technical Report 09-03: 19 May, 2009
Unique Permutation Hashing
Shlomi Dolev, Limor Lahiani & Yinnon Haviv - Technical Report 09-02: 23 July, 2009
Balancing Degree, Diameter and Weight in Euclidean Spanners
Shay Solomon and Michael Elkin - Technical Report 09-01: 14 July, 2009
Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
Yefim Dinitz, Michael Elkin & Shay Solomon - Technical Report 08-13: 24 Oct, 2008
Randomization Adaptive Self-Stabilization
Shlomi Dolev and Nir Tzachar - Technical Report 08-12: 5 Aug, 2008
Corruption Resilient Fountain Codes
Shlomi Dolev and Nir Tzachar - Technical Report 08-11: 11 May, 2008
Efficient Planning for Loosely-Coupled Multi-Agent Systems
Ronen Brafman and Carmel Domshlak - Technical Report 08-10: 03 April, 2008
SELF-* PROGRAMMING Run-Time Parallel Control Search for Reflection Box
Olga Brukman and Shlomi Dolev - Technical Report 08-09: 27 April, 2008
Electro-optical DSP of Tera Operations per Second and Beyond
Dan E. Tamir, Natan T. Shaked, Peter J. Wilson and Shlomi Dolev - Technical Report 08-08: February, 2008
SELF-* PROGRAMMING Run-Time Reflection&Set&Replication Box Control Synthesis
Olga Brukman and Shlomi Dolev - Technical Report 08-07: 28 January, 2008
An Improved Construction of Progrssion-Free Sets
Michael Elkin - Technical Report 08-06: 24 January, 2008
Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners
Yefim Dinitz, Michael Elkin and Shay Solomon - Technical Report 08-05: 13 January, 2008
Towards Hammering Processors
Shlomi Dolev and Sergey Frenkel - Technical Report 08-04: 10 December, 2007
Preference Handling: An Introductory Tutorial
Ronen Brafman and Carmel Domshlak - Technical Report 08-03: 02 December, 2007
Error Recovery Using Threads
Mayer Goldberg and Avi Shefi - Technical Report 08-02: 30 October, 2007
SPANDERS -- Distributed Spanning Expanders
Shlomi Dolev and Nir Tzachar - Technical Report 08-01: 17 October, 2007
Self-stabilization Preserving Compiler - Implementation and Examples
Shlomi Dolev, Yinnon Avraham Haviv, and Shmuel Sagiv
|
|
|
“We can only see a short distance ahead, but we can see plenty there that needs to be done.” -Alan Turing