Skip to main Skip to footer
University of Waterloo
  • Admissions
  • About Waterloo
  • Faculties & academics
  • Offices & services
  • Support Waterloo
  • COVID-19
Search
  • Combinatorics and Optimization home
  • Our people
  • Research and awards
    • Research areas
    • Awards and achievements
    • Research Chairs
    • Centres and institutes
    • Journal of Combinatorial Theory, Series B
    • Technical reports
    • Faculty Lectures
    • Faculty book list
  • Career opportunities
  • News
  • Events
    • Tutte Colloquium Series
    • Tutte's Distinguished Lecture Series
  • Contact us
  • Undergraduate students
    • Contact
    • Degrees
    • Courses
    • Degree checklists
    • Undergraduate Research Assistantship Spring Program
      • Spring Noticeboard
      • Spring URA Application
      • URA FAQs
      • URA Job Board Fall and Winter terms
    • Frequently Asked Questions
  • Graduate students
    • Contact us
    • Applying
    • Programs
    • Courses
    • Milestones for PhD students
      • PhD Thesis Proposal
    • Teaching Assistant position
    • Travel and Expense Claims
    • Alumni profiles
    • Student profiles
    • PhD recipients
    • MMath theses
    • MMath essays
    • Funding and awards
    • FAQ's for new graduate students
    • Outstanding TA award
    • FAQ's for prospective graduate students
    • Important Dates
    • Orientation for new graduate students
  • Admissions
  • About Waterloo
  • Faculties & academics
  • Offices & services
  • Support Waterloo
  • COVID-19
Combinatorics and Optimization
  • Combinatorics and Optimization home
  • Our people
  • Research and awards
    • Research areas
    • Awards and achievements
    • Research Chairs
    • Centres and institutes
    • Journal of Combinatorial Theory, Series B
    • Technical reports
    • Faculty Lectures
    • Faculty book list
  • Career opportunities
  • News
  • Events
  • Contact us

Information for

  • Undergraduate students
  • Graduate students
  1. Combinatorics and Optimization
  2. Research and awards
  3. Technical reports

Technical reports - 1999

  • On the Interpolation Attacks on Block Ciphers (PDF)

    CORR 1999-64

    A.M. Youssef and G. Gong

  • Dyck paths and a bijection for multisets of hook numbers (PDF)

    CORR 1999-63

    Ian Goulden and Alexander Yong

  • Chain Polynomials of Graphs (PDF)

    CORR 1999-62

    Ronald C. Read

  • Constructions of Orthomorphisms of Z^n_2 (PDF)

    CORR 1999-61

    Solomon W. Golomb and Guang Gong and Lothrop Mittenthal

  • Discrepancy Transforms and their Applications (PDF)

    CORR 1999-60

    Guang Gong

  • A Note on Lack of Strong Duality for Quadratic Problems with Orthogonal Constraints (PDF)

    CORR 1999-59

    Henry Wolkowicz

  • Computing Discrete Logarithms in Quadratic Orders (PDF)

    CORR 1999-58

    Michael J. Jacobson, Jr.

  • Threshold Visual Cyrptogrpahy Schemes with Specified Whiteness Levels of Reconstructed Pixels (PDF)

    CORR 1999-57

    Philip A. Eisen and Douglas R. Stinson

  • Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph (PDF)

    CORR 1999-56

    J. Cheriyan, A. Sebo, and Z. Szigeti

  • A Strengthened SDP Relaxation via a Second Lifting for the Max-Cut Problem (PDF)

    CORR 1999-55

    Miguel F. Anjos and Henry Wolkowicz

  • Non-Linear Complexity of the Naor-Reingold Pseudo-Random Function (PDF)

    CORR 1999-54

    William D. Banks, Frances Griffin, Daniel Lieman, and Igor E. Shparlinski*

  • Cryptography in Quadratic Function Fields (PDF)

    CORR 1999-53

    R. Scheidler

  • Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems (PDF)

    CORR 1999-52

    Masakazu Kojima and Levent Tuncel

  • The Probability that the Number of Points on an Elliptic Curve Over a Finite Field is Prime (PDF)

    CORR 1999-51

    Steven Galbraith and James McKee

  • The Gromov-Witten Potential of a Point, Hurwitz Numbers, and Hodge Integrals (PDF)

    CORR 1999-50

    I.P. Goulden, D.M. Jackson, and R. Vakil

  • New Large Sets of $t$-Designs (PDF)

    CORR 1999-49

    Reinhard Laue, Spyros S. Magliveras, and Alfred Wassermann

  • Almost $k$-wise Independent Sample Spaces and Their Cryptologic Applications (PDF)

    CORR 1999-48

    Kaoru Kurosawa, Thomas Johansson, and Douglas Stinson

  • Resolution of Degenerate Critical Parameter Values in Parametric Quadratic Programming (PDF)

    CORR 1999-47

    Lise Arseneau and Michael J. Best

  • Improved Algorithms for Arithmetic on Anomalous Binary Curves (PDF)

    CORR 1999-46

    Jerome A. Solinas

  • Ideal Arithmetic and Infrastructure in Purely Cubic Function Fields (PDF)

    CORR 1999-45

    Renate Scheidler

  • Certification of Secure RSA Keys (PDF)

    CORR 1999-44

    S.R. Blackburn and Steven D. Galbraith

  • Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice (PDF)

    CORR 1999-43

    Marcelo H. de Carvalho, Claudio L. Lucchesi, and U.S.R. Murty

  • On a Conjecture of Lovasz Concerning Bricks. II. Brick of Finite Characteristic (PDF)

    CORR 1999-42

    Marcelo H. de Carvalho, Claudio L. Lucchesi, and U.S.R. Murty

  • On a Conjecture of Lovasz Concerning Bricks. I. The Characteristic of a Matching Covered Graph (PDF)

    CORR 1999-41

    Marcelo H. de Carvalho, Claudio L. Lucchesi, and U.S.R. Murty

  • Symmetric designs, sets with two intersection numbers and Krein parameters of incidence graphs (PDF)

    CORR 1999-40

    William J. Martin

  • Generalized Mersenne Numbers (PDF)

    CORR 1999-39

    Jerome A. Solinas

  • Minimum distance bounds for s-regular codes (PDF)

    CORR 1999-38

    William J. Martin

  • Complexity Analyses of Discretized Successive Convex Relaxation Methods (PDF)

    CORR 1999-37

    Levent Tuncel and Song Xu

  • On the Finite convergence of Successive SDP Relaxation Methods (PDF)

    CORR 1999-36

    Masakazu Kojima and Levent Tuncel

  • Generalization of Primal-Dual Interior-Point Methods to Convex Optimization Problems in Conic Form (PDF)

    CORR 1999-35

    Levent Tuncel

  • The Elliptic curve Digital Signature Algorithm (ECDSA) (PDF)

    CORR 1999-34

    Don Johnson and Alfred Menezes

  • The Complexity of a Non-Interior Path Following Method for the Linear Complementarity Problem (PDF)

    CORR 1999-33

    James Burke and Song Xu

  • New Quadratic Polynomials with High Densities of Prime Values (PDF)

    CORR 1999-32

    Michael J. Jacobson, Jr. and Hugh C. Williams

  • Self-concordant Barriers for Hyperbolic Means (PDF)

    CORR 1999-31

    Adrian S. Lewis and Hristo S. Sendov

  • A Conjecture on Binary Sequences with the "Trinomial Property" (PDF)

    CORR 1999-30

    Thomas W. Cusick and Guang Gong

  • Decomposition and Classification of Cascaded GMW Functions (PDF)

    CORR 1999-29

    Zong Duo Dai, Guang Gong, and Ding Feng Ye

  • Counting Set Covers and Split Graphs (PDF)

    CORR 1999-28

    Gordon F. Royle

  • Linear Complexity versus Pseudorandomness: On Beth and Dai's Result (PDF)

    CORR 1999-27

    Yongge Wang

  • Explicit Bounds and Heuristics on Class Numbers in Hyperelliptic Function Fields (PDF)

    CORR 1999-26

    Andreas Stein and Edlyn Teske

  • Smoothing Method for Minimax Problems (PDF)

    CORR 1999-25

    Song Xu

  • The Tutte polynomial for homeomorphis classes of graphs (PDF)

    CORR 1999-24

    Ronald C. Read and Earl Glen Whitehead, Jr.

  • Sharp upper bounds for arithmetics in hyperelliptic function fields (PDF)

    CORR 1999-23

    Andreas Stein

  • The Efficient Frontier for Uncorrelated, Bounded Assets (PDF)

    CORR 1999-22

    Michael J. Best and Jaroslava Hlouskova

  • On Homogeneous Convex Cones, Caratheodory Number, and Duality Mapping (PDF)

    CORR 1999-21

    Levent Tuncel and Song Xu

  • Matroid 4-Connectivity: A Delection-Contraction Theorem (PDF)

    CORR 1999-20

    James Geelen and Geoff Whittle

  • A Sublinear Bound on the Chromatic Zeros of Theta Graphs (PDF)

    CORR 1999-19

    David G. Wagner

  • The Size of the Fundamental Solutions of Consecutive Pell Equations (PDF)

    CORR 1999-18

    M.J. Jacobson, Jr. and H.C. Williams

  • Infrastructure in Real Quadratic Function Fields (PDF)

    CORR 1999-17

    Andreas Stein

  • Introduction to Continued Fraction Expansions in Real Quadratic Function Fields (PDF)

    CORR 1999-16

    Andreas Stein

  • Asymptotic Estimates for Generalized Stirling Numbers (PDF)

    CORR 1999-15

    R. Chelluri, L.B. Richmond, and N.M. Temme

  • Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures (PDF)

    CORR 1999-14

    D.R. Stinson and R. Wei

  • Enumeration and Criteria for Cyclically Shift-Distinct GMW Sequences (PDF)

    CORR 1999-13

    Zongduo Dai, Solomon W. Golomb, and Guang Gong

  • Notes on $q$-ary Interleaved Sequences (PDF)

    CORR 1999-12

    Shaoquan Jiang, Zongduo Dai, and Guang Gong

  • Smallest components in decomposable structures (PDF)

    CORR 1999-11

    Daniel Panario and Bruce Richmond

  • Determining the maximum consistent set of shares in a threshold scheme (PDF)

    CORR 1999-10

    D.R. Stinson and R. Wei

  • Catching Kangaroos in Function Fields (PDF)

    CORR 1999-09

    Andreas Stein and Edlyn Teske

  • Convex spectral functions of compact operators (PDF)

    CORR 1999-08

    J.M. Borwein, A.S. Lewis, J. Read, and Qiji Zhu

  • Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem (PDF)

    CORR 1999-07

    D.R. Stinson

  • Analysis of the Xedni Calculus Attack (PDF)

    CORR 1999-06

    Michael J. Jacobson, Neal Koblitz, Joseph H. Silverman, Andreas Stein, and Edlyn Teske

  • The Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem (PDF)

    CORR 1999-05

    Joseph H. Silverman

  • Computing Discrete Logarithms in High-Genus Hyperelliptic Jacobians in Provably Subexponential Time (PDF)

    CORR 1999-04

    Andreas Enge

  • The number of ramified coverings of the sphere by the double torus, and a general form for higher genera (PDF)

    CORR 1999-03

    I.P. Goulden and D.M. Jackson

  • A proof of a conjecture for the number of ramified coverings of the sphere by the torus (PDF)

    CORR 1999-02

    I.P. Goulden and D.M. Jackson

  • Applications of Combinatorial Designs to Communications, Cryptography, and Networking (PDF)

    CORR 1999-01

    C.J. Colbourn, J.H. Dinitz, and D.R. Stinson

  • Share via Facebook
  • Share via Twitter
  • Share via Google+
  • Share via LinkedIn
  • Share via Email
  • TOP
  • Share
Department of Combinatorics and Optimization

Contact Info

Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038

Visit Combinatorics & Optimization

Support Mathematics

Work for Mathematics

Provide website feedback

PDF files require Adobe Acrobat Reader.


 

University of Waterloo
University of Waterloo
43.471468
-80.544205
200 University Avenue West
Waterloo, ON, Canada  N2L 3G1
+1 519 888 4567
  • Contact Waterloo
  • Maps & Directions
  • WatSAFE
  • Accessibility
  • Privacy
  • Copyright
  • News
  • Careers
  • Feedback
@uwaterloo social directory

The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is co-ordinated within our Office of Indigenous Relations.

Log in