-
Notifications
You must be signed in to change notification settings - Fork 1
/
index.html
113 lines (99 loc) · 5.64 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
<!DOCTYPE html>
<html>
<head>
<link rel="stylesheet" type="text/css" href="style.css">
<script src="http://code.jquery.com/jquery-latest.js"></script>
<script src="http://www.bitstorm.org/jquery/color-animation/jquery.animate-colors-min.js"></script>
<!-- Begin MathJax -->
<script type="text/javascript"
src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {inlineMath: [['$','$'], ['\\(','\\)']]}
});
</script>
<script type="text/javascript" src="path-to-mathjax/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
<!-- End MathJax -->
<title>UTG (Undergraduate Theory Group)</title>
</head>
<body>
<div id="mainBlock">
<div id="header"></div>
<div id="menu">
<ul>
<a href="#"><li id="aboutButton">About</li></a>
<a href="#"><li id="cscButton">Events</li></a>
<!-- <a href="#"><li id="matButton">CS Theory</li></a> -->
<a href="#"><li id="phlButton">Members</li></a>
<a href="#"><li id="solutionsButton">Faculty</li></a>
<a href="assets/utg-constitution.pdf"><li>Constitution</li></a>
<a href="#"><li id="contactButton">Contact</li></a>
</ul>
</div>
<div class="mainText" id="about">
<h3>Announcements</h3>
<p>
<ul>
<li>
We're happy to announce the UTG Winter 2015 Lecture Series, bringing the top researchers in UofT's CS theory group to give an open lecture on topics ranging from cryptography to distributed algorithms. Everyone is invited - only basic mathematical understanding required! Click on Events on the sidebar to view the dates and talk abstracts.
</li>
</ul>
</p>
<h3>Mission Statement</h3>
<p>
The purpose of the group is to introduce its members to the various subfields in Theoretical Computer Science. Presentations take place to educate group members on terms and concepts related to these subfields, with the purpose of increasing awareness about past, current, and potential research directions. Weekly
group meetings are used to accomplish this purpose, as well as to serve as a breeding ground for ideas and to stimulate discussions.
</p>
</div>
<div class="mainText" id="csc">
<h3>Events and Meetings</h3>
<!-- <h2>UTG Lecture Series</h2> -->
<h4>Prof. Faith Ellen - Concurrent Data Structures</h4>
<p class="desc">Wednesday January 21st 4-6PM at BA 1170: A concurrent data structure is a data structure on which multiple
processes can act simultaneously. Otherwise, it is called a sequential
data structure. A library of concurrent data structures can make the task of developing concurrent software much easier. Although sequential data structures can be transformed into concurrent data structures in straightforward ways, the results are generally inefficient and/or not fault tolerant. I'll discuss some of the difficulties and techniques involved in constructing efficient concurrent data structures, including my recent work on balanced binary search trees.</p>
<hr>
<h4>Prof. Charlie Rackoff - Cryptography</h4>
<p class="desc">Thursday March 5th 4-6PM. Details will be added soon.</p>
<hr>
<h4>Prof. Allan Borodin - Conceptually simple algorithms: the what, the why, and the why not.</h4>
<p class="desc">Friday March 20th 4-6PM: In many applications, there are factors that go beyond computational efficiency. One such factor is the conceptual simplicity of the algorithm. For example, in auctions, buyers prefer easy to understand how mechanisms for allocating and pricing items.
But what is a conceptually simple algorithm and at what cost (in performance, accuracy, efficiency) does it come? An ambitious research agenda would be to try define such a concept and study inherent tradeoffs. A more realistic agenda is to focus on the ``algorithmic paradigms'' that we study in courses such as CSC373.
To that end, what is a greedy algorithm, local search, dynamic programming? When are such algorithms successful and when not? And does such introspection lead to new algorithms? We will present a brief introduction to this more modest research agenda.</p>
<hr>
<!-- <p>We meet for the second time at noon on Friday, Novemener 21st at noon, in Bahen rm. 2179. Topics will include the Undergraduate Theory Day, tentatively planned for February, and some definitions in concurrent algorithm; others are welcome.</p>
<p>We meet for the first time on Friday October 3rd at 2PM @ PT266! Everyone is welcome to join.</p> -->
</div>
<!-- <div class="mainText" id="mat">
<h3>CS Theory</h3>
<p>CS Theory is cool because...</p>
</div> -->
<div class="mainText" id="phl">
<h3>Members</h3>
<p>
<ul>
<li>Founder: <a href="http://www.cs.toronto.edu/~lex/">Alex</a></li>
<li>President: <a href="">Ken Hoover</a></li>
<li>Co-President: <a href="http://individual.utoronto.ca/idh/">Itai David Hass</a></li>
</ul>
</p>
</div>
<div class="mainText" id="solutions">
<h3>Faculty</h3>
<p>
<ul>
<li><a href="http://www.cs.toronto.edu/~faith/">Faith Ellen</a></li>
<li><a href="http://www.cs.toronto.edu/~toni/">Toniann Pitassi</a></li>
</ul>
</p>
</div>
<div class="mainText" id="contact">
<h3>Contact</h3>
<p>Please feel free to contact us with any questions or ideas at <a href="mailto:[email protected]?Subject=Hi%20UTG" target="_top">utg --at-- cs.toronto.edu</a>. We would like to get to know as many people as possible.</p>
</div>
</div>
<script type="text/javascript" src="javascript/globals.js"></script>
<script type="text/javascript" src="javascript/webscript.js"></script>
</body>
</html>