- 1770 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 5, SEPTEMBER 1998 A Dynamic Programming Algorithm for Constructing
- The Convex Hull for Random Lines in the Plane. Mordecai Golin1
- Design and Analysis of Algorithms Revised 05/02/03
- 7: Network Security Comp 361, Fall 2003
- Some More Undecidable Problems Theorem 1 The following problems are all unsolvable
- COMP 272 Theory of Computation Lecture 1 --Dr. Mordecai Golin
- 15. Universal Turing Machines ffl Turing machines are fixed at time of design to solve a par
- FunSort ---Or the Chaos of Unordered Binary Search
- THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS \Lambda
- Lecture 10: Minimum Spanning Trees and Prim's Algorithm
- Randomized Data Mordecai Golin*
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- Lecture 20: NP-Completeness II Main Topics of this Lecture
- LATEX 2 Cheat Sheet Document classes
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- COMP 151 --Lectures 1, 2, 3 Midterm April 4, 2001
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- Lecture 10: Minimum Spanning Trees and Prim's Algorithm
- Lecture 18: P & NP Revised, May 1, 2003
- Design and Analysis of Algorithms Revised 05/02/03
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- Lecture 4: Finite Automata Deterministic finite automata (DFA)
- Generalizing the KraftMcMillan Inequality to Restricted Languages
- On the Expected Depth of Random Circuits Sunil Arya \Lambda Mordecai J. Golin y Kurt Mehlhorn z
- Information Processing Letters 89 (2004) 5763 www.elsevier.com/locate/ipl
- Average Case Analysis of Insertionsort We want to analyze the average case number of compar-
- Online Dynamic Programming Speedups Amotz Bar-Noy1
- Lecture 12: Dynamic Progamming CLRS Chapter 15
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- Lecture 18: P & NP Revised, May 1, 2003
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
- Further Correction of error on UDP Checksum: updated 13/10/03 My previous explanation of how the UDP checksum worked was incorrect. Here is the correct version.
- 13. Turing Machines/Extensions of Ways to extend Turing machines
- Lecture 10: Minimum Spanning Trees and Prim's Algorithm
- Lecture 17: Huffman Coding Outline of this Lecture
- RANDOMIZED DATA STRUCTURES FOR THE DYNAMIC CLOSESTPAIR PROBLEM #
- Chapter 1: Introduction 1Comp361, Fall 2003 COMP 361 "Networks I" Fall 2003
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- Lecture 6: BreadthFirst Search Outline of this Lecture
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- Discrete Mathematics 298 (2005) 334364 www.elsevier.com/locate/disc
- The Knuth-Yao Quadrangle-Inequality Speedup is a Consequence of Total-Monotonicity
- Lecture 19: NP-Completeness 1 Revised Sun May 25, 2003
- Lecture 3: Facility Location Problems (Vazirani. Ch. 5)
- 6: Proofs that languages are and are not reg Example: \Sigma = f0; 1; : : : ; 9g
- Properties of CFLs Theorem 1 CFLs are closed under union, concatenation,
- 11. Turing Machines Formal model of computers, consisting of
- Designs, Codes and Cryptography, ?, 1--11 (2002) fl 2002 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- 6: A Second Pumping Theorem The pumping theorem we saw previously was
- Discrete Applied Mathematics 144 (2004) 231236 www.elsevier.com/locate/dam
- 4: Network LayerComp 361, Fall 2003 Chapter 4: Network Layer last revision 08/11/03
- Computational Geometry 25 (2003) 197231 www.elsevier.com/locate/comgeo
- 5: Properties of regular languages Properties of languages accepted by NFA's or DFA's.
- Maximum Contiguous Subarray Problem ffl Reference: Chapter 8 in Programming Pearls,
- COMP 272 Theory of Computation 1997 Spring Semester
- Lecture 18: P & NP Revised, May 1, 2003
- Lecture 6: BreadthFirst Search Outline of this Lecture
- Approximation Algorithms --COMP 670J Fall Semester 2001 --Class Project I/O Info
- Topics in Theoretical CS: Approximation Algorithms http://www.cs.ust.hk/faculty/golin/COMP670J.html
- Lecture 2: Introduction (Continued) This section covers the following topics
- Theoretical HKUSTTCSC200403 Online Maintenance of kMedians and kCovers on
- Lecture 3: Divide-and-Conquer Algorithms We just derived an
- Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs
- 3: Transport LayerComp 361, Fall 2003 Chapter 3: Transport Layer last updated 11/10/03
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- Lecture 20: NPCompleteness II Main Topics of this Lecture
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- Lecture 9: Dijkstra's Shortest Path Outline of this Lecture
- The Probabilistic Complexity of the Voronoi Diagram of Points on a Polyhedron
- Lecture 8: Randomized Rounding and Set Cover Based on Vazirani: Chapter 14
- Theoretical HKUSTTCSC200407 Algorithms for Constructing Infinite Hu#man Codes
- Design and Analysis of Algorithms Revised 05/02/03
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- Lecture 4.1: The fundamental theorem Let L ` \Sigma \Lambda . Then the following three statements are
- Lecture 3: DivideandConquer Algorithms We just derived an O(n log n) divideandconquer al
- Chebyshev polynomials and spanning tree formulas for circulant graphs
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- Mellin Transforms and Asymptotics: The Mergesort Recurrence
- The RSA Public Key Encryption System Common Sense tells us that if we know how a secret message was encoded then we can easily decode
- MAXSAT: Best of Two We have so far seen two different approaches to approximat
- An Algorithm for Finding a kMedian in a Directed Tree
- Permanents of Circulants: a Transfer Matrix Approach (Extended Abstract)
- Theoretical Computer Science 310 (2004) 457467 www.elsevier.com/locate/tcs
- Recurrence Relations on Transfer Matrices Yield Good Lower and Upper Bounds on the Channel
- Online Maintenance of k-Medians and k-Covers Rudolf Fleischer1
- Lecture 11: Kruskal's MST Algorithm CLRS Chapter 23
- "!$#&%'#)(10#2%'354678@9BAC03"!B9BDE5FHGPIQ 'RBR$SUTWV)DE8#2!XTYI`YaFHbD
- Curve Reconstruction from Noisy Samples Siu-Wing Cheng
- A Personal View of Generalized Huffman Mordecai J. Golin
- 12. Turing Machines/Combinations of ffl We claimed that Turing machines are a formal model of
- HuffmanCodes Mordecai golin@cs.ust.hk
- Derandomizing MaxCut In this note we quickly sketch how derandomizing the MaxCut algorithm from
- Lecture 13: Chain Matrix Multiplication CLRS Section 15.2
- Lecture 2: Sets, Relations, and Functions (a ffl A set is a collection of objects.
- Lecture 9: Dijkstra's Shortest Path Outline of this Lecture
- COMP 670J --Addendum This page proves the statement
- Lecture 4: The Shortest Superstring Problem In this lecture we describe a 4approximation algorithm for
- COMP 670J --APPROXIMATION ALGORITHMS ffl Linear Algebra
- Lecture 19: NPCompleteness 1 Revised Sun May 25, 2003
- Lecture 12: Dynamic Progamming CLRS Chapter 15
- Set Multicover The Set Multicover problem is the same as set cover except
- Nordic Journal of Computing SIMPLE RANDOMIZED ALGORITHMS FOR
- Lecture 4 Part II: The Overlap Lemma Overlap Lemma: Let c and c 0 be cycles in C and r; r repre
- Lecture Notes COMP 271 COMP 271: Design and Analysis of Algorithms 1
- 8: ContextFree Languages Contextfree grammars
- Lecture 14: AllPairs Shortest Paths Revised May 1, 2003
- Lecture 19: NPCompleteness 1 Revised Sun May 25, 2003
- Lecture 14: All-Pairs Shortest Paths Revised May 1, 2003
- Lecture 16 -GREEDY ALGORITHMS CLRS-Chapter 16
- Optimal PrefixFree Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
- Lecture 3: Languages and Regular Expres Basic concepts
- COMP272: Theory of Computation Lecture 1: Motivation and Overview
- The Structure of Optimal Prefix-Free Codes in Restricted Languages
- COMP 272 Theory of Computation November 29, 1996 Exam One
- Lecture 15: The FloydWarshall CLRS section 25.2
- 9: Pushdown Automata ffl Language recognizer for CFLs.
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- Lecture 5: Graphs & their Representation Why Do We Need Graphs
- Lecture 11: Kruskal's MST Algorithm CLRS Chapter 23
- Lecture 20: NPCompleteness II Main Topics of this Lecture
- 15. Uncomputability ffl If a language or a problem is not Turingdecidable, it is said
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 4, JULY 2000 1637 [7] S. Verd and T. S. Han, "A general formula for channel capacity," IEEE
- Maxima in Convex Regions Mordecai J. Golin*
- Online Dynamic Programming Speedups Amotz Bar-Noy
- A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding Mordecai GOLIN
- Multidimensional Divide-and-Conquer and Weighted Digital Sums
- The Two-Median Problem on Manhattan Meshes Mordecai J. Golin and Yan Zhang
- Paging Mobile Users Efficiently and Optimally Amotz Bar-Noy
- Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results
- Computational Geometry 31 (2005) 63100 www.elsevier.com/locate/comgeo
- Unhooking Circulant Graphs: A Combinatorial Method for Counting
- Online Maintenance of k-Medians and k-Covers Rudolf FLEISCHER, Mordecai J. GOLIN, and ZHANG Yan
- Algorithms for Infinite Huffman-Codes (Extended Abstract)
- Huffman Coding with Unequal Letter Costs [Extended Abstract]
- New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memory
- DOI: 10.1007/s00453-001-0063-1 Algorithmica (2001) 31: 240290
- Theoretical Computer Science 263 (2001) 283304 www.elsevier.com/locate/tcs
- Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations
- Chapter 2: Application Layer 1 Comp361 Fall 2003
- 5: DataLink Layer 1Comp 361, Fall 2003 Chapter 5: The Data Link Layer last revised 24/11/03
- Maximum Contiguous Subarray Problem Reference: Chapter 8 in Programming Pearls,
- Lecture 4: Linear Time Selection So far we have seen Divide-and-Conquer algorithms
- Lecture 5: Graphs & their Representation Why Do We Need Graphs
- Lecture 6: Breadth-First Search Outline of this Lecture
- Lecture 7: Depth-First Search CLRS, section 22.3
- Lecture 8: DFS and Topological Sort CLRS 22.3, 22.4
- Disjoint sets with union -a fixed set U is partitioned
- Lecture 13: Chain Matrix Multiplication CLRS Section 15.2
- Lecture 15: The Floyd-Warshall CLRS section 25.2
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- COMP 271 Design and Analysis of Algorithms 2003 Spring Semester
- Lecture 4: Linear Time Selection So far we have seen DivideandConquer algorithms
- Lecture 7: DepthFirst Search CLRS, section 22.3
- Lecture 3: DivideandConquer Algorithms We just derived an O(n log n) divideandconquer al
- Theoretical HKUSTTCSC200402 Unhooking Circulant Graphs
- Lecture 17: Huffman Coding Outline of this Lecture
- The Insertionsort Extra Credit After performing the average case analysis of Insertionsort we asked the following
- The number of spanning trees in a class of double fixed-step loop networks
- Set Multicover The Set Multicover problem is the same as set cover except
- Lecture 8: DFS and Topological Sort CLRS 22.3, 22.4
- Discrete Applied Mathematics 140 (2004) 3548 www.elsevier.com/locate/dam
