Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"University of Illinois – Urbana-Champaign" +contributor:("Har-Peled, Sariel"). Showing records 1 – 10 of 10 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Raichel, Benjamin A. The Fr??chet distance revisited and extended.

Degree: MS, 0112, 2011, University of Illinois – Urbana-Champaign

 Given two simplicial complexes, and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such… (more)

Subjects/Keywords: Frechet Distance; Approximation Algorithms; Realistic Input Models

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Raichel, B. A. (2011). The Fr??chet distance revisited and extended. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/24109

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Raichel, Benjamin A. “The Fr??chet distance revisited and extended.” 2011. Thesis, University of Illinois – Urbana-Champaign. Accessed July 22, 2019. http://hdl.handle.net/2142/24109.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Raichel, Benjamin A. “The Fr??chet distance revisited and extended.” 2011. Web. 22 Jul 2019.

Vancouver:

Raichel BA. The Fr??chet distance revisited and extended. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2011. [cited 2019 Jul 22]. Available from: http://hdl.handle.net/2142/24109.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Raichel BA. The Fr??chet distance revisited and extended. [Thesis]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/24109

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

2. Raichel, Benjamin A. In pursuit of linear complexity in discrete and computational geometry.

Degree: PhD, Computer Science, 2015, University of Illinois – Urbana-Champaign

 Many computational problems arise naturally from geometric data. In this thesis, we consider three such problems: (i) distance optimization problems over point sets, (ii) computing… (more)

Subjects/Keywords: Computational Geometry; Discrete Geometry; Computational Topology; Geometric Optimization; Contour Trees; Voronoi Diagrams

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Raichel, B. A. (2015). In pursuit of linear complexity in discrete and computational geometry. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88048

Chicago Manual of Style (16th Edition):

Raichel, Benjamin A. “In pursuit of linear complexity in discrete and computational geometry.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 22, 2019. http://hdl.handle.net/2142/88048.

MLA Handbook (7th Edition):

Raichel, Benjamin A. “In pursuit of linear complexity in discrete and computational geometry.” 2015. Web. 22 Jul 2019.

Vancouver:

Raichel BA. In pursuit of linear complexity in discrete and computational geometry. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2019 Jul 22]. Available from: http://hdl.handle.net/2142/88048.

Council of Science Editors:

Raichel BA. In pursuit of linear complexity in discrete and computational geometry. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88048


University of Illinois – Urbana-Champaign

3. Kumar, Nirman. In search of better proximity.

Degree: PhD, 0112, 2014, University of Illinois – Urbana-Champaign

 Given a set of points in a metric space, a fundamental problem is to preprocess these points for answering nearest-neighbor queries on them. Proximity search… (more)

Subjects/Keywords: Computational Geometry; Algorithms; Data-Structures; Nearest-Neighbor Search; Approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kumar, N. (2014). In search of better proximity. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50535

Chicago Manual of Style (16th Edition):

Kumar, Nirman. “In search of better proximity.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 22, 2019. http://hdl.handle.net/2142/50535.

MLA Handbook (7th Edition):

Kumar, Nirman. “In search of better proximity.” 2014. Web. 22 Jul 2019.

Vancouver:

Kumar N. In search of better proximity. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2019 Jul 22]. Available from: http://hdl.handle.net/2142/50535.

Council of Science Editors:

Kumar N. In search of better proximity. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50535


University of Illinois – Urbana-Champaign

4. Korula, Nitish J. Approximation Algorithms for Network Design and Orienteering.

Degree: PhD, 0112, 2010, University of Illinois – Urbana-Champaign

 This thesis presents approximation algorithms for some NP-Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under… (more)

Subjects/Keywords: Algorithms; Approximation algorithms; Network design; Graph algorithms; Connectivity; Orienteering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Korula, N. J. (2010). Approximation Algorithms for Network Design and Orienteering. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/16731

Chicago Manual of Style (16th Edition):

Korula, Nitish J. “Approximation Algorithms for Network Design and Orienteering.” 2010. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 22, 2019. http://hdl.handle.net/2142/16731.

MLA Handbook (7th Edition):

Korula, Nitish J. “Approximation Algorithms for Network Design and Orienteering.” 2010. Web. 22 Jul 2019.

Vancouver:

Korula NJ. Approximation Algorithms for Network Design and Orienteering. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2010. [cited 2019 Jul 22]. Available from: http://hdl.handle.net/2142/16731.

Council of Science Editors:

Korula NJ. Approximation Algorithms for Network Design and Orienteering. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/16731


University of Illinois – Urbana-Champaign

5. Madan, Vivek. On approximability and LP formulations for multicut and feedback set problems.

Degree: PhD, Computer Science, 2018, University of Illinois – Urbana-Champaign

 Graph cut algorithms are an important tool for solving optimization problems in a variety of areas in computer science. Of particular importance is the min… (more)

Subjects/Keywords: Approximation; Multicut; Feedback set; Linear programming relaxation; Hardness of approximation; Linear cut; Multiway cut; Subset feedback set; Flow-cut gap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Madan, V. (2018). On approximability and LP formulations for multicut and feedback set problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102390

Chicago Manual of Style (16th Edition):

Madan, Vivek. “On approximability and LP formulations for multicut and feedback set problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 22, 2019. http://hdl.handle.net/2142/102390.

MLA Handbook (7th Edition):

Madan, Vivek. “On approximability and LP formulations for multicut and feedback set problems.” 2018. Web. 22 Jul 2019.

Vancouver:

Madan V. On approximability and LP formulations for multicut and feedback set problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Jul 22]. Available from: http://hdl.handle.net/2142/102390.

Council of Science Editors:

Madan V. On approximability and LP formulations for multicut and feedback set problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102390


University of Illinois – Urbana-Champaign

6. Gupta, Shalmoli. Approximation algorithms for clustering and facility location problems.

Degree: PhD, Computer Science, 2018, University of Illinois – Urbana-Champaign

 In this thesis we design and analyze algorithms for various facility location and clustering problems. The problems we study are NP-Hard and therefore, assuming P… (more)

Subjects/Keywords: Approximation Algorithm; Clustering; Facility Location; Submodular function

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gupta, S. (2018). Approximation algorithms for clustering and facility location problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102419

Chicago Manual of Style (16th Edition):

Gupta, Shalmoli. “Approximation algorithms for clustering and facility location problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 22, 2019. http://hdl.handle.net/2142/102419.

MLA Handbook (7th Edition):

Gupta, Shalmoli. “Approximation algorithms for clustering and facility location problems.” 2018. Web. 22 Jul 2019.

Vancouver:

Gupta S. Approximation algorithms for clustering and facility location problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Jul 22]. Available from: http://hdl.handle.net/2142/102419.

Council of Science Editors:

Gupta S. Approximation algorithms for clustering and facility location problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102419

7. Moseley, Benjamin. Online scheduling algorithms for broadcasting and general cost functions.

Degree: PhD, 0112, 2012, University of Illinois – Urbana-Champaign

 In this thesis we study scheduling problems that occur in the client server setting. In this setting there are a set of jobs that are… (more)

Subjects/Keywords: Scheduling; Online algorithms; Broadcasting; General cost functions; Flow time

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Moseley, B. (2012). Online scheduling algorithms for broadcasting and general cost functions. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/34207

Chicago Manual of Style (16th Edition):

Moseley, Benjamin. “Online scheduling algorithms for broadcasting and general cost functions.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 22, 2019. http://hdl.handle.net/2142/34207.

MLA Handbook (7th Edition):

Moseley, Benjamin. “Online scheduling algorithms for broadcasting and general cost functions.” 2012. Web. 22 Jul 2019.

Vancouver:

Moseley B. Online scheduling algorithms for broadcasting and general cost functions. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2019 Jul 22]. Available from: http://hdl.handle.net/2142/34207.

Council of Science Editors:

Moseley B. Online scheduling algorithms for broadcasting and general cost functions. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/34207

8. Ene, Alina. Approximation algorithms for submodular optimization and graph problems.

Degree: PhD, 0112, 2014, University of Illinois – Urbana-Champaign

 In this thesis, we consider combinatorial optimization problems involving submodular functions and graphs. The problems we study are NP-hard and therefore, assuming that P =/=… (more)

Subjects/Keywords: Approximation algorithms; Submodular optimization; Routing; Network design

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ene, A. (2014). Approximation algorithms for submodular optimization and graph problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/46738

Chicago Manual of Style (16th Edition):

Ene, Alina. “Approximation algorithms for submodular optimization and graph problems.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 22, 2019. http://hdl.handle.net/2142/46738.

MLA Handbook (7th Edition):

Ene, Alina. “Approximation algorithms for submodular optimization and graph problems.” 2014. Web. 22 Jul 2019.

Vancouver:

Ene A. Approximation algorithms for submodular optimization and graph problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2019 Jul 22]. Available from: http://hdl.handle.net/2142/46738.

Council of Science Editors:

Ene A. Approximation algorithms for submodular optimization and graph problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/46738

9. Hassanzadeh, Farzad. Distances on rankings: from social choice to flash memories.

Degree: PhD, 1200, 2013, University of Illinois – Urbana-Champaign

 From social choice to statistics to coding theory, rankings are found to be a useful vehicle for storing and presenting information in modern data systems.… (more)

Subjects/Keywords: Distance; Rankings; Permutations; Social choice; Flash memories; Kendall tau distance; Weighted Kendall distance; Weighted Transposition distance; Rank aggregation; Information Retrieval; Collaborative filtering; Rank modulation; Ulam distance; error-correcting codes

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hassanzadeh, F. (2013). Distances on rankings: from social choice to flash memories. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/44268

Chicago Manual of Style (16th Edition):

Hassanzadeh, Farzad. “Distances on rankings: from social choice to flash memories.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 22, 2019. http://hdl.handle.net/2142/44268.

MLA Handbook (7th Edition):

Hassanzadeh, Farzad. “Distances on rankings: from social choice to flash memories.” 2013. Web. 22 Jul 2019.

Vancouver:

Hassanzadeh F. Distances on rankings: from social choice to flash memories. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2019 Jul 22]. Available from: http://hdl.handle.net/2142/44268.

Council of Science Editors:

Hassanzadeh F. Distances on rankings: from social choice to flash memories. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/44268

10. Nayyeri, Amir. Combinatorial optimization on embedded curves.

Degree: PhD, 0112, 2013, University of Illinois – Urbana-Champaign

 We describe several algorithms for classifying, comparing and optimizing curves on surfaces. We give algorithms to compute the minimum member of a given homology class,… (more)

Subjects/Keywords: Computational topology; combinatorial optimization; curves; maximum flow; minimum cut; curve similarity; normal coordinated

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nayyeri, A. (2013). Combinatorial optimization on embedded curves. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42333

Chicago Manual of Style (16th Edition):

Nayyeri, Amir. “Combinatorial optimization on embedded curves.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 22, 2019. http://hdl.handle.net/2142/42333.

MLA Handbook (7th Edition):

Nayyeri, Amir. “Combinatorial optimization on embedded curves.” 2013. Web. 22 Jul 2019.

Vancouver:

Nayyeri A. Combinatorial optimization on embedded curves. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2019 Jul 22]. Available from: http://hdl.handle.net/2142/42333.

Council of Science Editors:

Nayyeri A. Combinatorial optimization on embedded curves. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/42333

.