i A random zoo: sloth, un∨corn, and trx Arjen K. Lenstra and Benjamin Wesolowski EPFL IC LACAL, Station 14, CH-1015 Lausanne, Switzerland Abstract. Many applications require trustworthy generation of public random num

Source URL: eprint.iacr.org

• Combinatorics
• Cryptography
• Search algorithms
• Applied mathematics
• SHA-2
• Theoretical computer science
• Permutation
• Hash function
• Independence
• Mathematics
• Cryptographic hash functions
• Hashing

ERCOT 401(k) Savings Plan ERCOT values its employees and the need to save for retirement. By providing above average company contributions, employees are eligible to receive up to 14.5% of eligible wages in company contr

Source URL: www.ercot.com

• 401
• Individual Retirement Accounts
• Economics
• Vesting
• Retirement
• Internal Revenue Code
• Law
• Private law

Science in China Series A: Mathematics Jul., 2009, Vol. 52, No. 7, 1–14 www.scichina.com math.scichina.com www.springerlink.com On the rate of convergence of the maximum likelihood estimator of a k-monotone density

Source URL: www.stat.washington.edu

• Measure theory
• Essential range
• Symbol
• Mathematical analysis
• Calculus
• Continuous function

The Diversity of Roles for Scientists in K-14 Education and Public Outreach Draft by Cherilynn A. Morrow Space Science Institute

Source URL: www.spacescience.org

• Science outreach
• Science
• National Virtual Observatory
• Teacher
• Knowledge
• Education
• Science education
• Science in society

A NEWSLETTER OF THE MIDTOWN GREENWAY COALITION Volume 14, Issue 3 k July, August, September 2009 By Gabriel Hoffman, Coalition board member from Seward

Source URL: midtowngreenway.org

• Geography of the United States
• Chicago
• Milwaukee
• St. Paul and Pacific Railroad
• Midtown Greenway
• Minneapolis
• Lyn-Lake
• Lake Street
• Lake Calhoun
• Midtown Exchange
• Geography of Minnesota
• Greenways
• Minnesota

CCCG 2006, Kingston, Ontario, August 14–16, 2006 On Bipartite Matching under the RMS Distance Pankaj K. Agarwal∗ Abstract

Source URL: cccg.ca

• Analysis of algorithms
• Computational complexity theory
• Time complexity
• Ordinal number
• Matching
• Euclidean algorithm
• Symbol
• Theoretical computer science
• Applied mathematics
• Mathematics

28 CHAPTER 14. APPROXIMATE TREE PATTERN MATCHING Zhang, K., R. Statman and D. Shasha [1992]. \On the editing distance between unordered

Source URL: www.cs.nyu.edu

• Knowledge representation
• Tree
• Approximate string matching
• Pruning
• Systems science
• Dynamic programming
• Control theory
• Systems theory

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Open Problems from CCCG 2005 Erik D. Demaine∗ The following is a list of the problems presented on

Source URL: cccg.ca

• Discrete geometry
• Euclidean plane geometry
• Computational geometry
• NP-complete problems
• K-set
• 3SUM
• Pseudotriangle
• Planar graph
• Dominating set
• Graph theory
• Mathematics
• Geometry

CCCG 2006, Kingston, Ontario, August 14–16, Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram Stefan Funke†∗ Theocharis Malamatos†

Source URL: cccg.ca

• Search algorithms
• Discrete geometry
• Computational geometry
• Approximation algorithms
• Diagrams
• Voronoi diagram
• Nearest neighbor search
• Cone
• K-d tree
• Geometry
• Mathematics
• Information science

平成 14 年版 かながわ環境白書 神 奈 川 県

Source URL: www.k-erc.pref.kanagawa.jp