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:("Chekuri, Chandra"). Showing records 1 – 30 of 31 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


University of Illinois – Urbana-Champaign

1. McDonald, Daniel Cooper. Competitive versions of vertex ranking and game acquisition, and a problem on proper colorings.

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

 In this thesis we study certain functions on graphs. Chapters 2 and 3 deal with variations on vertex ranking, a type of node-labeling scheme that… (more)

Subjects/Keywords: graph theory; vertex ranking; list ranking; on-line ranking; mixing number; game acquisition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McDonald, D. C. (2015). Competitive versions of vertex ranking and game acquisition, and a problem on proper colorings. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88024

Chicago Manual of Style (16th Edition):

McDonald, Daniel Cooper. “Competitive versions of vertex ranking and game acquisition, and a problem on proper colorings.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/88024.

MLA Handbook (7th Edition):

McDonald, Daniel Cooper. “Competitive versions of vertex ranking and game acquisition, and a problem on proper colorings.” 2015. Web. 02 Apr 2020.

Vancouver:

McDonald DC. Competitive versions of vertex ranking and game acquisition, and a problem on proper colorings. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/88024.

Council of Science Editors:

McDonald DC. Competitive versions of vertex ranking and game acquisition, and a problem on proper colorings. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88024


University of Illinois – Urbana-Champaign

2. Wise, Jennifer Irene. Games on graphs, visibility representations, and graph colorings.

Degree: PhD, Mathematics, 2016, University of Illinois – Urbana-Champaign

 In this thesis we study combinatorial games on graphs and some graph parameters whose consideration was inspired by an interest in the symmetry of hypercubes.… (more)

Subjects/Keywords: Graphs; Game Matching; Game $f$-Matching; Fool's Solitaire; Bar Visibility Representations; $r$-Dynamic Coloring; Antipodal Edge-Coloring; $A$-Cordial Labeling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wise, J. I. (2016). Games on graphs, visibility representations, and graph colorings. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/92697

Chicago Manual of Style (16th Edition):

Wise, Jennifer Irene. “Games on graphs, visibility representations, and graph colorings.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/92697.

MLA Handbook (7th Edition):

Wise, Jennifer Irene. “Games on graphs, visibility representations, and graph colorings.” 2016. Web. 02 Apr 2020.

Vancouver:

Wise JI. Games on graphs, visibility representations, and graph colorings. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/92697.

Council of Science Editors:

Wise JI. Games on graphs, visibility representations, and graph colorings. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/92697


University of Illinois – Urbana-Champaign

3. 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 April 02, 2020. 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. 02 Apr 2020.

Vancouver:

Madan V. On approximability and LP formulations for multicut and feedback set problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Apr 02]. 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

4. Samee, Md. Abul Hassan. Computational modeling of gene expression from regulatory sequences.

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

 Regulation of gene expression is an important early step in controlling every biological process that underlies the function of living organisms. Even though gene expression… (more)

Subjects/Keywords: Transcription; Transcriptional regulation; cis-Regulatory sequence; enhancer; Transcription factor; Statistical thermodynamics; Drosophila melanogaster; Computational model; Ensemble model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Samee, M. A. H. (2015). Computational modeling of gene expression from regulatory sequences. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78433

Chicago Manual of Style (16th Edition):

Samee, Md Abul Hassan. “Computational modeling of gene expression from regulatory sequences.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/78433.

MLA Handbook (7th Edition):

Samee, Md Abul Hassan. “Computational modeling of gene expression from regulatory sequences.” 2015. Web. 02 Apr 2020.

Vancouver:

Samee MAH. Computational modeling of gene expression from regulatory sequences. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/78433.

Council of Science Editors:

Samee MAH. Computational modeling of gene expression from regulatory sequences. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78433


University of Illinois – Urbana-Champaign

5. 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 April 02, 2020. 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. 02 Apr 2020.

Vancouver:

Raichel BA. In pursuit of linear complexity in discrete and computational geometry. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Apr 02]. 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

6. Yu, Ge. Dynamic online resource allocation problems.

Degree: PhD, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

 Online resource allocation problems consider assigning a limited number of available resources to sequentially arriving requests with the objective to maximize rewards. With the emergence… (more)

Subjects/Keywords: Online assignment; resource allocation problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yu, G. (2018). Dynamic online resource allocation problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100930

Chicago Manual of Style (16th Edition):

Yu, Ge. “Dynamic online resource allocation problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/100930.

MLA Handbook (7th Edition):

Yu, Ge. “Dynamic online resource allocation problems.” 2018. Web. 02 Apr 2020.

Vancouver:

Yu G. Dynamic online resource allocation problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/100930.

Council of Science Editors:

Yu G. Dynamic online resource allocation problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100930


University of Illinois – Urbana-Champaign

7. Shirazi, Afsaneh H. Reasoning with models of probabilistic knowledge over probabilistic knowledge.

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

 In multi-agent systems, the knowledge of agents about other agents??? knowledge often plays a pivotal role in their decisions. In many applications, this knowledge involves… (more)

Subjects/Keywords: Probabilistic Knowledge; Bayesian Networks; Modal Logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shirazi, A. H. (2011). Reasoning with models of probabilistic knowledge over probabilistic knowledge. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/24239

Chicago Manual of Style (16th Edition):

Shirazi, Afsaneh H. “Reasoning with models of probabilistic knowledge over probabilistic knowledge.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/24239.

MLA Handbook (7th Edition):

Shirazi, Afsaneh H. “Reasoning with models of probabilistic knowledge over probabilistic knowledge.” 2011. Web. 02 Apr 2020.

Vancouver:

Shirazi AH. Reasoning with models of probabilistic knowledge over probabilistic knowledge. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/24239.

Council of Science Editors:

Shirazi AH. Reasoning with models of probabilistic knowledge over probabilistic knowledge. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/24239


University of Illinois – Urbana-Champaign

8. Maji, Hemanta K. On computational intractability assumptions in cryptography.

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

 In cryptographic protocols, honest parties would prefer that their security is assured even in presence of adversarial parties who have unbounded computational power. Information theoretic… (more)

Subjects/Keywords: Computational Intractability Assumptions; Reduction; Universally Composable Security; Relativistic Separation; Implication and Equivalence of Assumptions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maji, H. K. (2012). On computational intractability assumptions in cryptography. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29716

Chicago Manual of Style (16th Edition):

Maji, Hemanta K. “On computational intractability assumptions in cryptography.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/29716.

MLA Handbook (7th Edition):

Maji, Hemanta K. “On computational intractability assumptions in cryptography.” 2012. Web. 02 Apr 2020.

Vancouver:

Maji HK. On computational intractability assumptions in cryptography. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/29716.

Council of Science Editors:

Maji HK. On computational intractability assumptions in cryptography. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29716

9. Chang, Hsien-Chih. Tightening curves and graphs on surfaces.

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

 Any continuous deformation of closed curves on a surface can be decomposed into a finite sequence of local changes on the structure of the curves;… (more)

Subjects/Keywords: curves; graphs; surfaces; tightening; homotopy; electrical transformations; Delta-Y transformations; plane graphs; smoothings; graph minors; medial; monotonic; untangling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chang, H. (2018). Tightening curves and graphs on surfaces. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101519

Chicago Manual of Style (16th Edition):

Chang, Hsien-Chih. “Tightening curves and graphs on surfaces.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/101519.

MLA Handbook (7th Edition):

Chang, Hsien-Chih. “Tightening curves and graphs on surfaces.” 2018. Web. 02 Apr 2020.

Vancouver:

Chang H. Tightening curves and graphs on surfaces. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/101519.

Council of Science Editors:

Chang H. Tightening curves and graphs on surfaces. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101519

10. Vakilian, Ali. Node-weighted prize-collecting survivable network design problems.

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

 We consider node-weighted network design problems, in particular the survivable network design problem SNDP and its prize-collecting version PC-SNDP. The input consists of a node-weighted… (more)

Subjects/Keywords: Approximation Algorithm; Survivable Network Design; Steiner Network; Prize-collecting survivable network design problem (SNDP)

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

Vakilian, A. (2013). Node-weighted prize-collecting survivable network design problems. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/45452

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

Vakilian, Ali. “Node-weighted prize-collecting survivable network design problems.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/45452.

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

MLA Handbook (7th Edition):

Vakilian, Ali. “Node-weighted prize-collecting survivable network design problems.” 2013. Web. 02 Apr 2020.

Vancouver:

Vakilian A. Node-weighted prize-collecting survivable network design problems. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/45452.

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

Council of Science Editors:

Vakilian A. Node-weighted prize-collecting survivable network design problems. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/45452

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

11. Idleman, Mark. Approximation algorithms for the minimum congestion routing problem via k-route flows.

Degree: MS, Computer Science, 2017, University of Illinois – Urbana-Champaign

 Given a directed network G = (V,E) with source and target nodes s and t, respectively, and an integral capacity c_e on each edge e… (more)

Subjects/Keywords: Minimum congestion routing; K-route flow; Network flow; Flow; Decomposition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Idleman, M. (2017). Approximation algorithms for the minimum congestion routing problem via k-route flows. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98428

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

Idleman, Mark. “Approximation algorithms for the minimum congestion routing problem via k-route flows.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/98428.

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

MLA Handbook (7th Edition):

Idleman, Mark. “Approximation algorithms for the minimum congestion routing problem via k-route flows.” 2017. Web. 02 Apr 2020.

Vancouver:

Idleman M. Approximation algorithms for the minimum congestion routing problem via k-route flows. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/98428.

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

Council of Science Editors:

Idleman M. Approximation algorithms for the minimum congestion routing problem via k-route flows. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98428

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

12. Patwa, Shweta Jayant. Survivable network design problems with element and vertex connectivity requirements.

Degree: MS, Computer Science, 2017, University of Illinois – Urbana-Champaign

 In this thesis, we consider degree-bounded element-connectivity Survivable Network Design Problem (Elem-SNDP) and degree-bounded Rooted k-outconnectivity Problem. We suggest bicriteria approximation algorithms that are motivated… (more)

Subjects/Keywords: Approximation algorithm; Network design; Bounded degree; Iterative rounding; Element connectivity; Node connectivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Patwa, S. J. (2017). Survivable network design problems with element and vertex connectivity requirements. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98117

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

Patwa, Shweta Jayant. “Survivable network design problems with element and vertex connectivity requirements.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/98117.

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

MLA Handbook (7th Edition):

Patwa, Shweta Jayant. “Survivable network design problems with element and vertex connectivity requirements.” 2017. Web. 02 Apr 2020.

Vancouver:

Patwa SJ. Survivable network design problems with element and vertex connectivity requirements. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/98117.

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

Council of Science Editors:

Patwa SJ. Survivable network design problems with element and vertex connectivity requirements. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98117

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

13. Quanrud, Kent. Fast approximations for combinatorial optimization via multiplicative weight updates.

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

 We develop fast approximations for several LP relaxations that arise in discrete and combinatorial optimization. New results include improved running times for explicit mixed packing… (more)

Subjects/Keywords: Approximation algorithms; Linear programming; Combinatorial optimization; fast approximations; traveling salesman problem

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

Quanrud, K. (2019). Fast approximations for combinatorial optimization via multiplicative weight updates. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/106153

Chicago Manual of Style (16th Edition):

Quanrud, Kent. “Fast approximations for combinatorial optimization via multiplicative weight updates.” 2019. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/106153.

MLA Handbook (7th Edition):

Quanrud, Kent. “Fast approximations for combinatorial optimization via multiplicative weight updates.” 2019. Web. 02 Apr 2020.

Vancouver:

Quanrud K. Fast approximations for combinatorial optimization via multiplicative weight updates. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2019. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/106153.

Council of Science Editors:

Quanrud K. Fast approximations for combinatorial optimization via multiplicative weight updates. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/106153

14. 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 April 02, 2020. http://hdl.handle.net/2142/102419.

MLA Handbook (7th Edition):

Gupta, Shalmoli. “Approximation algorithms for clustering and facility location problems.” 2018. Web. 02 Apr 2020.

Vancouver:

Gupta S. Approximation algorithms for clustering and facility location problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Apr 02]. 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

15. 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 April 02, 2020. http://hdl.handle.net/2142/46738.

MLA Handbook (7th Edition):

Ene, Alina. “Approximation algorithms for submodular optimization and graph problems.” 2014. Web. 02 Apr 2020.

Vancouver:

Ene A. Approximation algorithms for submodular optimization and graph problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Apr 02]. 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

16. 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 April 02, 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. 02 Apr 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 Apr 02]. 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

17. 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 April 02, 2020. http://hdl.handle.net/2142/34207.

MLA Handbook (7th Edition):

Moseley, Benjamin. “Online scheduling algorithms for broadcasting and general cost functions.” 2012. Web. 02 Apr 2020.

Vancouver:

Moseley B. Online scheduling algorithms for broadcasting and general cost functions. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Apr 02]. 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

18. Xu, Chao. Cuts and connectivity in graphs and hypergraphs.

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

 In this thesis, we consider cut and connectivity problems on graphs, digraphs, hypergraphs and hedgegraphs. The main results are the following: - We introduce a… (more)

Subjects/Keywords: hypergraph; cuts

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, C. (2018). Cuts and connectivity in graphs and hypergraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101009

Chicago Manual of Style (16th Edition):

Xu, Chao. “Cuts and connectivity in graphs and hypergraphs.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/101009.

MLA Handbook (7th Edition):

Xu, Chao. “Cuts and connectivity in graphs and hypergraphs.” 2018. Web. 02 Apr 2020.

Vancouver:

Xu C. Cuts and connectivity in graphs and hypergraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/101009.

Council of Science Editors:

Xu C. Cuts and connectivity in graphs and hypergraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101009

19. Vachaspati, Pranjal. Large scale phylogenomic estimation.

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

 Phylogenomic estimation - the science of calculating evolutionary trees from genomic data - is an important biological problem. As the amount of genomic data in… (more)

Subjects/Keywords: phylogenomics; species trees; computational biology; phylogenetics; evolution; incomplete lineage sorting; multispecies coalescent

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vachaspati, P. (2019). Large scale phylogenomic estimation. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/106182

Chicago Manual of Style (16th Edition):

Vachaspati, Pranjal. “Large scale phylogenomic estimation.” 2019. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/106182.

MLA Handbook (7th Edition):

Vachaspati, Pranjal. “Large scale phylogenomic estimation.” 2019. Web. 02 Apr 2020.

Vancouver:

Vachaspati P. Large scale phylogenomic estimation. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2019. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/106182.

Council of Science Editors:

Vachaspati P. Large scale phylogenomic estimation. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/106182

20. Tseng, Lewis. Fault-tolerant consensus in directed graphs and convex hull consensus.

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

 As distributed systems nowadays scale to thousands or more of nodes, fault-tolerance becomes one of the most important topics. This dissertation studies the fault-tolerance aspect… (more)

Subjects/Keywords: Consensus; Byzantine fault; Crash fault; Directed network; fault-tolerance; convex hull consensus

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tseng, L. (2016). Fault-tolerant consensus in directed graphs and convex hull consensus. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/90567

Chicago Manual of Style (16th Edition):

Tseng, Lewis. “Fault-tolerant consensus in directed graphs and convex hull consensus.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/90567.

MLA Handbook (7th Edition):

Tseng, Lewis. “Fault-tolerant consensus in directed graphs and convex hull consensus.” 2016. Web. 02 Apr 2020.

Vancouver:

Tseng L. Fault-tolerant consensus in directed graphs and convex hull consensus. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/90567.

Council of Science Editors:

Tseng L. Fault-tolerant consensus in directed graphs and convex hull consensus. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/90567

21. Kannan, Sreeram. Layering principles for wireless networks.

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

 The need to deliver increasing amounts of data over a fixed bandwidth in wireless networks necessitates the engineering of communication schemes with ever-increasing efficiencies. In… (more)

Subjects/Keywords: Polymatroidal networks; flow-cut gaps; capacity; wireless networks; information theory; approximation algorithms; Information Flow; local physical layer; global routing; network coding; layering; fading channels; function computation; Steiner packing; duality.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kannan, S. (2013). Layering principles for wireless networks. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42398

Chicago Manual of Style (16th Edition):

Kannan, Sreeram. “Layering principles for wireless networks.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/42398.

MLA Handbook (7th Edition):

Kannan, Sreeram. “Layering principles for wireless networks.” 2013. Web. 02 Apr 2020.

Vancouver:

Kannan S. Layering principles for wireless networks. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/42398.

Council of Science Editors:

Kannan S. Layering principles for wireless networks. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/42398

22. 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 April 02, 2020. http://hdl.handle.net/2142/46579.

MLA Handbook (7th Edition):

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

Vancouver:

Fox KJ. Fast algorithms for surface embedded graphs via homology. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Apr 02]. 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

23. Sauppe, Jason James. Balance Optimization Subset Selection: a framework for causal inference with observational data.

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

 Observational data are prevalent in many fields of research, and it is desirable to use this data to explore potential causal relationships. Additional assumptions and… (more)

Subjects/Keywords: optimization; causal inference; operations research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sauppe, J. J. (2015). Balance Optimization Subset Selection: a framework for causal inference with observational data. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88049

Chicago Manual of Style (16th Edition):

Sauppe, Jason James. “Balance Optimization Subset Selection: a framework for causal inference with observational data.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/88049.

MLA Handbook (7th Edition):

Sauppe, Jason James. “Balance Optimization Subset Selection: a framework for causal inference with observational data.” 2015. Web. 02 Apr 2020.

Vancouver:

Sauppe JJ. Balance Optimization Subset Selection: a framework for causal inference with observational data. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/88049.

Council of Science Editors:

Sauppe JJ. Balance Optimization Subset Selection: a framework for causal inference with observational data. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88049

24. Zamani Nasab, Reza. Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies.

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

 This thesis deals with the following three independent problems. Po'sa proved that if G is an n-vertex graph in which any two nonadjacent vertices have… (more)

Subjects/Keywords: hamiltonian cycle; bipartite graph; specified edges; domination game; the game of revolutionaries and spies

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

Zamani Nasab, R. (2011). Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26187

Chicago Manual of Style (16th Edition):

Zamani Nasab, Reza. “Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/26187.

MLA Handbook (7th Edition):

Zamani Nasab, Reza. “Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies.” 2011. Web. 02 Apr 2020.

Vancouver:

Zamani Nasab R. Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/26187.

Council of Science Editors:

Zamani Nasab R. Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26187

25. Wu, Hehui. Extremal problems on cycles, packing, and decomposition of graphs.

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

 In this thesis, we study extremal problems concerning cycles and paths in graphs, graph packing, and graph decomposition. We use “graph” in the general sense,… (more)

Subjects/Keywords: Graph; circumference; Steiner tree; packing S-connector; independent number; connectivity; decomposition; fractional arborictiy.

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

Wu, H. (2011). Extremal problems on cycles, packing, and decomposition of graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26227

Chicago Manual of Style (16th Edition):

Wu, Hehui. “Extremal problems on cycles, packing, and decomposition of graphs.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/26227.

MLA Handbook (7th Edition):

Wu, Hehui. “Extremal problems on cycles, packing, and decomposition of graphs.” 2011. Web. 02 Apr 2020.

Vancouver:

Wu H. Extremal problems on cycles, packing, and decomposition of graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/26227.

Council of Science Editors:

Wu H. Extremal problems on cycles, packing, and decomposition of graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26227

26. Liang, Guanfeng. Network-aware mechanisms for tolerating Byzantine failures in distributed systems.

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

 Given the growing reliance of industry and government on online information services such as cloud computing and data centers, efficient fault-tolerance algorithm design is of… (more)

Subjects/Keywords: Byzantine agreement; Consensus; Fault-Tolerance; Broadcast; Watchdog; Capacity; Distributed Algorithms; Distributed Systems; Equality

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

Liang, G. (2012). Network-aware mechanisms for tolerating Byzantine failures in distributed systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/31012

Chicago Manual of Style (16th Edition):

Liang, Guanfeng. “Network-aware mechanisms for tolerating Byzantine failures in distributed systems.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/31012.

MLA Handbook (7th Edition):

Liang, Guanfeng. “Network-aware mechanisms for tolerating Byzantine failures in distributed systems.” 2012. Web. 02 Apr 2020.

Vancouver:

Liang G. Network-aware mechanisms for tolerating Byzantine failures in distributed systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/31012.

Council of Science Editors:

Liang G. Network-aware mechanisms for tolerating Byzantine failures in distributed systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/31012

27. Raja, Adnan. Topics in multi-terminal wireless networks.

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

 In this dissertation, tools from information theory are used to study multiterminal wireless networks. A compress-and-forward scheme with layered decoding is presented for the unicast… (more)

Subjects/Keywords: wireless networks; relay; compress-and-forward; relay schemes; bisubmodular; polymatroidal flow; broadcast; reciprocity

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

Raja, A. (2012). Topics in multi-terminal wireless networks. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/31124

Chicago Manual of Style (16th Edition):

Raja, Adnan. “Topics in multi-terminal wireless networks.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/31124.

MLA Handbook (7th Edition):

Raja, Adnan. “Topics in multi-terminal wireless networks.” 2012. Web. 02 Apr 2020.

Vancouver:

Raja A. Topics in multi-terminal wireless networks. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/31124.

Council of Science Editors:

Raja A. Topics in multi-terminal wireless networks. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/31124

28. King, Douglas. Graph theory models and algorithms for political districting: an approach to inform public policy.

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

 Political districting is an intractable problem with significant ramifications for political representation. Districts are often required to satisfy some legal constraints, but these are typically… (more)

Subjects/Keywords: Operations research; Political districting; Plane graph theory; Local search

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

King, D. (2012). Graph theory models and algorithms for political districting: an approach to inform public policy. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/30931

Chicago Manual of Style (16th Edition):

King, Douglas. “Graph theory models and algorithms for political districting: an approach to inform public policy.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/30931.

MLA Handbook (7th Edition):

King, Douglas. “Graph theory models and algorithms for political districting: an approach to inform public policy.” 2012. Web. 02 Apr 2020.

Vancouver:

King D. Graph theory models and algorithms for political districting: an approach to inform public policy. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/30931.

Council of Science Editors:

King D. Graph theory models and algorithms for political districting: an approach to inform public policy. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/30931

29. Gummadi, Subha R. Coding and scheduling in networks for erasures and broadcast.

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

 This dissertation is concerned with the design and analysis of algorithms that address two related issues in communication networks, namely erasures and broadcast. Erasures are… (more)

Subjects/Keywords: Erasure Codes; Wireless Broadcast; Distributed Storage; Stochastic Control; Broadcast Server; Online Knapsack Problems

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gummadi, S. R. (2012). Coding and scheduling in networks for erasures and broadcast. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29831

Chicago Manual of Style (16th Edition):

Gummadi, Subha R. “Coding and scheduling in networks for erasures and broadcast.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 02, 2020. http://hdl.handle.net/2142/29831.

MLA Handbook (7th Edition):

Gummadi, Subha R. “Coding and scheduling in networks for erasures and broadcast.” 2012. Web. 02 Apr 2020.

Vancouver:

Gummadi SR. Coding and scheduling in networks for erasures and broadcast. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Apr 02]. Available from: http://hdl.handle.net/2142/29831.

Council of Science Editors:

Gummadi SR. Coding and scheduling in networks for erasures and broadcast. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29831


University of Illinois – Urbana-Champaign

30. 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 April 02, 2020. http://hdl.handle.net/2142/16731.

MLA Handbook (7th Edition):

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

Vancouver:

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

[1] [2]

.