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:("Erickson, Jeff G."). Showing records 1 – 13 of 13 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Illinois – Urbana-Champaign

1. Fox, Kyle J. Online Scheduling on Identical Machines Using SRPT.

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

 Due to its optimality on a single machine for the problem of minimizing average flow time, Shortest-Remaining-Processing-Time (SRPT) appears to be the most natural algorithm… (more)

Subjects/Keywords: scheduling; competitive analysis; resource augmentation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fox, K. J. (2011). Online Scheduling on Identical Machines Using SRPT. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/18275

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):

Fox, Kyle J. “Online Scheduling on Identical Machines Using SRPT.” 2011. Thesis, University of Illinois – Urbana-Champaign. Accessed August 08, 2020. http://hdl.handle.net/2142/18275.

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

MLA Handbook (7th Edition):

Fox, Kyle J. “Online Scheduling on Identical Machines Using SRPT.” 2011. Web. 08 Aug 2020.

Vancouver:

Fox KJ. Online Scheduling on Identical Machines Using SRPT. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/2142/18275.

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

Council of Science Editors:

Fox KJ. Online Scheduling on Identical Machines Using SRPT. [Thesis]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/18275

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. Mont, Alexander D. Adaptive unstructured spacetime meshing for four-dimensional spacetime discontinuous Galerkin finite element methods.

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

 We describe the spacetime discontinuous Galerkin method, a new type of finite-element method which promises dramatic improvement in solution speed for hyperbolic problems. These methods… (more)

Subjects/Keywords: spacetime meshing; discontinuous Galerkin; adaptive meshing; advancing front

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mont, A. D. (2012). Adaptive unstructured spacetime meshing for four-dimensional spacetime discontinuous Galerkin finite element methods. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29810

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):

Mont, Alexander D. “Adaptive unstructured spacetime meshing for four-dimensional spacetime discontinuous Galerkin finite element methods.” 2012. Thesis, University of Illinois – Urbana-Champaign. Accessed August 08, 2020. http://hdl.handle.net/2142/29810.

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

MLA Handbook (7th Edition):

Mont, Alexander D. “Adaptive unstructured spacetime meshing for four-dimensional spacetime discontinuous Galerkin finite element methods.” 2012. Web. 08 Aug 2020.

Vancouver:

Mont AD. Adaptive unstructured spacetime meshing for four-dimensional spacetime discontinuous Galerkin finite element methods. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/2142/29810.

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

Council of Science Editors:

Mont AD. Adaptive unstructured spacetime meshing for four-dimensional spacetime discontinuous Galerkin finite element methods. [Thesis]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29810

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


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 August 08, 2020. http://hdl.handle.net/2142/50535.

MLA Handbook (7th Edition):

Kumar, Nirman. “In search of better proximity.” 2014. Web. 08 Aug 2020.

Vancouver:

Kumar N. In search of better proximity. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Aug 08]. 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

4. Sundar, Aparna. More homology flows.

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

 Flows and cuts have been the topic of much study since Ford and Fulkerson's original paper. The problem we look at is the computation of… (more)

Subjects/Keywords: Homology Flows; ellipsoid method

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):

Sundar, A. (2010). More homology flows. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/16487

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):

Sundar, Aparna. “More homology flows.” 2010. Thesis, University of Illinois – Urbana-Champaign. Accessed August 08, 2020. http://hdl.handle.net/2142/16487.

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

MLA Handbook (7th Edition):

Sundar, Aparna. “More homology flows.” 2010. Web. 08 Aug 2020.

Vancouver:

Sundar A. More homology flows. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2010. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/2142/16487.

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

Council of Science Editors:

Sundar A. More homology flows. [Thesis]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/16487

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

5. 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 August 08, 2020. http://hdl.handle.net/2142/42333.

MLA Handbook (7th Edition):

Nayyeri, Amir. “Combinatorial optimization on embedded curves.” 2013. Web. 08 Aug 2020.

Vancouver:

Nayyeri A. Combinatorial optimization on embedded curves. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Aug 08]. 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

6. Fox, Kyle J. Fast algorithms for surface embedded graphs via homology.

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

 We describe several results on combinatorial optimization problems for graphs where the input comes with an embedding on an orientable surface of small genus. While… (more)

Subjects/Keywords: computational topology; topological graph theory; Homology; minimum cut; maximum flow; non-trivial cycles

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fox, K. J. (2014). Fast algorithms for surface embedded graphs via homology. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/46579

Chicago Manual of Style (16th Edition):

Fox, Kyle J. “Fast algorithms for surface embedded graphs via homology.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 08, 2020. http://hdl.handle.net/2142/46579.

MLA Handbook (7th Edition):

Fox, Kyle J. “Fast algorithms for surface embedded graphs via homology.” 2014. Web. 08 Aug 2020.

Vancouver:

Fox KJ. Fast algorithms for surface embedded graphs via homology. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/2142/46579.

Council of Science Editors:

Fox KJ. Fast algorithms for surface embedded graphs via homology. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/46579

7. Erickson, Lawrence. Visibility analysis of landmark-based navigation.

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

 This thesis introduces and examines the chromatic art gallery problem. The chromatic art gallery problem asks for the minimum number of landmark classes required to… (more)

Subjects/Keywords: Robotics; Art Gallery; Visibility

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Erickson, L. (2014). Visibility analysis of landmark-based navigation. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/49473

Chicago Manual of Style (16th Edition):

Erickson, Lawrence. “Visibility analysis of landmark-based navigation.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 08, 2020. http://hdl.handle.net/2142/49473.

MLA Handbook (7th Edition):

Erickson, Lawrence. “Visibility analysis of landmark-based navigation.” 2014. Web. 08 Aug 2020.

Vancouver:

Erickson L. Visibility analysis of landmark-based navigation. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/2142/49473.

Council of Science Editors:

Erickson L. Visibility analysis of landmark-based navigation. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/49473

8. Im, Sungjin. Online scheduling algorithms for average flow time and its variants.

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

 This dissertation focuses on scheduling problems that are found in a client-server setting where multiple clients and one server (or multiple servers) are the participating… (more)

Subjects/Keywords: online scheduling; average flow time; scalable

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Im, S. (2012). Online scheduling algorithms for average flow time and its variants. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/34274

Chicago Manual of Style (16th Edition):

Im, Sungjin. “Online scheduling algorithms for average flow time and its variants.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 08, 2020. http://hdl.handle.net/2142/34274.

MLA Handbook (7th Edition):

Im, Sungjin. “Online scheduling algorithms for average flow time and its variants.” 2012. Web. 08 Aug 2020.

Vancouver:

Im S. Online scheduling algorithms for average flow time and its variants. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/2142/34274.

Council of Science Editors:

Im S. Online scheduling algorithms for average flow time and its variants. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/34274


University of Illinois – Urbana-Champaign

9. O'Kane, Jason M. A Theory for Comparing Robot Systems.

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

 As robots interact with the physical world, their usefulness depends directly on how effectively they can sense and move through their environments. Unfortunately, sensors provide… (more)

Subjects/Keywords: theory; robotics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

O'Kane, J. M. (2007). A Theory for Comparing Robot Systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/11357

Chicago Manual of Style (16th Edition):

O'Kane, Jason M. “A Theory for Comparing Robot Systems.” 2007. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 08, 2020. http://hdl.handle.net/2142/11357.

MLA Handbook (7th Edition):

O'Kane, Jason M. “A Theory for Comparing Robot Systems.” 2007. Web. 08 Aug 2020.

Vancouver:

O'Kane JM. A Theory for Comparing Robot Systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2007. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/2142/11357.

Council of Science Editors:

O'Kane JM. A Theory for Comparing Robot Systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2007. Available from: http://hdl.handle.net/2142/11357


University of Illinois – Urbana-Champaign

10. Wolf, Michael M. Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication.

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

 Combinatorial scientific computing plays an important enabling role in computational science, particularly in high performance scientific computing. In this thesis, we will describe our work… (more)

Subjects/Keywords: matrix-vector multiplication; hypergraphs; combinatorial optimization; parallel data distributions; finite elements; sparse matrix computations; combinatorial scientific computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wolf, M. M. (2009). Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/13069

Chicago Manual of Style (16th Edition):

Wolf, Michael M. “Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication.” 2009. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 08, 2020. http://hdl.handle.net/2142/13069.

MLA Handbook (7th Edition):

Wolf, Michael M. “Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication.” 2009. Web. 08 Aug 2020.

Vancouver:

Wolf MM. Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2009. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/2142/13069.

Council of Science Editors:

Wolf MM. Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2009. Available from: http://hdl.handle.net/2142/13069


University of Illinois – Urbana-Champaign

11. Cochran, William Kenneth. A Generic Data Structure with Parallel Applications.

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

 High performance, massively-parallel multi-physics simulations are built on efficient mesh data structures. Most data structures are designed from the bottom up, focusing on the implementation… (more)

Subjects/Keywords: Parallel Computing; medial axis; indefinite direct solvers; mesh partitioning; parallel software engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cochran, W. K. (2009). A Generic Data Structure with Parallel Applications. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/13621

Chicago Manual of Style (16th Edition):

Cochran, William Kenneth. “A Generic Data Structure with Parallel Applications.” 2009. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 08, 2020. http://hdl.handle.net/2142/13621.

MLA Handbook (7th Edition):

Cochran, William Kenneth. “A Generic Data Structure with Parallel Applications.” 2009. Web. 08 Aug 2020.

Vancouver:

Cochran WK. A Generic Data Structure with Parallel Applications. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2009. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/2142/13621.

Council of Science Editors:

Cochran WK. A Generic Data Structure with Parallel Applications. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2009. Available from: http://hdl.handle.net/2142/13621


University of Illinois – Urbana-Champaign

12. 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 August 08, 2020. http://hdl.handle.net/2142/16731.

MLA Handbook (7th Edition):

Korula, Nitish J. “Approximation Algorithms for Network Design and Orienteering.” 2010. Web. 08 Aug 2020.

Vancouver:

Korula NJ. Approximation Algorithms for Network Design and Orienteering. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2010. [cited 2020 Aug 08]. 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

13. Vanderzee, Evan B. Well-centered meshing.

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

 A well-centered simplex is a simplex whose circumcenter lies in its interior, and a well-centered mesh is a simplicial mesh in which every simplex is… (more)

Subjects/Keywords: well-centered; meshing; triangulation; acute; Delaunay; simplex

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vanderzee, E. B. (2010). Well-centered meshing. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/15591

Chicago Manual of Style (16th Edition):

Vanderzee, Evan B. “Well-centered meshing.” 2010. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 08, 2020. http://hdl.handle.net/2142/15591.

MLA Handbook (7th Edition):

Vanderzee, Evan B. “Well-centered meshing.” 2010. Web. 08 Aug 2020.

Vancouver:

Vanderzee EB. Well-centered meshing. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2010. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/2142/15591.

Council of Science Editors:

Vanderzee EB. Well-centered meshing. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/15591

.