Search ACM DL

Search Issue

enter search term and/or author name

**An algorithm for finding canonical sets of ground rewrite rules in polynomial time**

Jean Gallier, Paliath Narendran, David Plaisted, Stan Raatz, Wayne Snyder

Pages: 1-16

DOI: 10.1145/138027.138032

**Perfectly secure message transmission**

Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung

Pages: 17-47

DOI: 10.1145/138027.138036

**Generating automatically tuned bitmaps from outlines**

John D. Hobby

Pages: 48-94

DOI: 10.1145/138027.138040

**The minimum consistent DFA problem cannot be approximated within any polynomial**

Leonard Pitt, Manfred K. Warmuth

Pages: 95-142

DOI: 10.1145/138027.138042

**A framework for defining logics**

Robert Harper, Furio Honsell, Gordon Plotkin

Pages: 143-184

DOI: 10.1145/138027.138060

**Learning read-once formulas with queries**

Dana Angluin, Lisa Hellerstein, Marek Karpinski

Pages: 185-210

DOI: 10.1145/138027.138061