CoRR, May 2002

• Almut Burchard, Jörg Liebeherr, Stephen D. Patek:
  A Calculus for End-to-end Statistical Service Guarantees. , (informal publication)
  Electronic Edition (link) BibTeX [cs.NI/0205001]
• Joachim Rosenthal:
  A Polynomial Description of the Rijndael Advanced Encryption Standard. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CR/0205002]
• Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore:
  The prospects for mathematical logic in the twenty-first century. , (informal publication)
  Electronic Edition (link) BibTeX [cs.LO/0205003]
• Srinidhi Varadarajan, Joy Mukherjee, Naren Ramakrishnan:
  Weaves: A Novel Direct Code Execution Interface for Parallel High Performance Scientific Codes. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DC/0205004]
• Robert A. Hearn, Erik D. Demaine:
  PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CC/0205005]
• Marco Baroni, Johannes Matiasek, Harald Trost:
  Unsupervised discovery of morphologically related words based on orthographic and semantic similarity. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205006]
• Neal E. Young:
  On-Line Paging against Adversarially Biased Random Inputs. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205007]
• Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young:
  Improved Bicriteria Existence Theorems for Scheduling. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205008]
• Rie Kubota Ando, Lillian Lee:
  Mostly-Unsupervised Statistical Segmentation of Japanese Kanji Sequences. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205009]
• Yossi Matias, Jeffrey Scott Vitter, Neal E. Young:
  Approximate Data Structures with Applications. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205010]
• Samir Khuller, Balaji Raghavachari, Neal E. Young:
  On Strongly Connected Digraphs with Bounded Cycle Length. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205011]
• Claire Kenyon, Nicolas Schabanel, Neal E. Young:
  Polynomial-Time Approximation Scheme for Data Broadcast. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205012]
• Zbigniew Lonc, Miroslaw Truszczynski:
  Computing stable models: worst-case performance estimates. , (informal publication)
  Electronic Edition (link) BibTeX [cs.LO/0205013]
• Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski:
  Ultimate approximations in nonmonotonic knowledge representation systems. , (informal publication)
  Electronic Edition (link) BibTeX [cs.AI/0205014]
• Michael Farber:
  Instabilities of Robot Motion. , (informal publication)
  Electronic Edition (link) BibTeX [cs.RO/0205015]
• Jing Han, Jiming Liu, Qingsheng Cai:
  From Alife Agents to a Kingdom of N Queens. , (informal publication)
  Electronic Edition (link) BibTeX [cs.AI/0205016]
• Georgios Petasis, Vangelis Karkaletsis, Georgios Paliouras, Ion Androutsopoulos, Constantine D. Spyropoulos:
  Ellogon: A New Text Engineering Platform. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205017]
• Ralf Lämmel:
  Typed Generic Traversal With Term Rewriting Strategies. , (informal publication)
  Electronic Edition (link) BibTeX [cs.PL/0205018]
• W. Chen:
  Distance function wavelets - Part I: Helmholtz and convection-diffusion transforms and series. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CE/0205019]
• W. Chen:
  A quasi-RBF technique for numerical discretization of PDE's. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CE/0205020]
• Anders Wäänänen, Mattias Ellert, Aleksandr Konstantinov, Balázs Kónya, Oxana Smirnova:
  An Overview of a Grid Architecture for Scientific Computing. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DC/0205021]
• Naren Ramakrishnan:
  The Traits of the Personable. , (informal publication)
  Electronic Edition (link) BibTeX [cs.AI/0205022]
• Mattias Ellert, Aleksandr Konstantinov, Balázs Kónya, Oxana Smirnova, Anders Wäänänen:
  Performance evaluation of the GridFTP within the NorduGrid project. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DC/0205023]
• Evgueniy Vitchev:
  A (non)static 0-order statistical model and its implementation for compressing virtually uncompressible data. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205024]
• Menno van Zaanen:
  Bootstrapping Structure into Language: Alignment-Based Learning. , (informal publication)
  Electronic Edition (link) BibTeX [cs.LG/0205025]
• Chung-chieh Shan:
  Monads for natural language semantics. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205026]
• Chung-chieh Shan:
  A variable-free dynamic semantics. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205027]
• Edward Loper, Steven Bird:
  NLTK: The Natural Language Toolkit. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205028]
• Qin Zhang, John M. Danskin, Neal E. Young:
  A Codebook Generation Algorithm for Document Image Compression. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205029]
• Stavros G. Kolliopoulos, Neal E. Young:
  Tight Approximation Results for General Covering Integer Programs. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205030]
• László Lovász, Neal E. Young:
  Lecture Notes on Evasiveness of Graph Properties. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CC/0205031]
• Naveen Garg, Neal E. Young:
  On-Line End-to-End Congestion Control. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205032]
• Neal E. Young:
  On-Line File Caching. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205033]
• Robert Lupton, F. Miller Maley, Neal E. Young:
  Data-Collection for the Sloan Digital Sky Survey: a Network-Flow Heuristic. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205034]
• Richard J. Lipton, Neal E. Young:
  Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CC/0205035]
• Neal E. Young:
  Randomized Rounding without Solving the Linear Program. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205036]
• Samir Khuller, Uzi Vishkin, Neal E. Young:
  A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205037]
• Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young:
  Competitive Paging Algorithms. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205038]
• Neal E. Young:
  Sequential and Parallel Algorithms for Mixed Packing and Covering. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205039]
• Samir Khuller, Balaji Raghavachari, Neal E. Young:
  Approximating the Minimum Equivalent Digraph. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205040]
• Neal E. Young, Robert Endre Tarjan, James B. Orlin:
  Faster Parametric Shortest Path and Minimum Balance Algorithms. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205041]
• S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young:
  Orienting Graphs to Optimize Reachability. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205042]
• Samir Khuller, Balaji Raghavachari, Neal E. Young:
  Low-Degree Spanning Trees of Small Weight. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205043]
• Neal E. Young:
  The K-Server Dual and Loose Competitiveness for Paging. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205044]
• Samir Khuller, Balaji Raghavachari, Neal E. Young:
  Balancing Minimum Spanning and Shortest Path Trees. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205045]
• Philip N. Klein, Neal E. Young:
  On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205046]
• Neal E. Young:
  K-Medians, Facility Location, and the Chernoff-Wald Bound. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205047]
• Mordecai J. Golin, Claire Kenyon, Neal E. Young:
  Huffman Coding with Unequal Letter Costs. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205048]
• Mordecai J. Golin, Neal E. Young:
  Prefix Codes: Equiprobable Words, Unequal Letter Costs. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205049]
• Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young:
  A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205050]
• David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young:
  Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205051]
• Vasu S. Alagar, Ralf Lämmel:
  Three-Tiered Specification of Micro-Architectures. , (informal publication)
  Electronic Edition (link) BibTeX [cs.SE/0205052]
• Paul M. Aoki, Rebecca E. Grinter, Amy Hurst, Margaret H. Szymanski, James D. Thornton, Allison Woodruff:
  Sotto Voce: Exploring the Interplay of Conversation and Mobile Audio Spaces. , (informal publication)
  Electronic Edition (link) BibTeX [cs.HC/0205053]
• Allison Woodruff, Paul M. Aoki, Rebecca E. Grinter, Amy Hurst, Margaret H. Szymanski, James D. Thornton:
  Eavesdropping on Electronic Guidebooks: Observing Learning Resources in Shared Listening Environments. , (informal publication)
  Electronic Edition (link) BibTeX [cs.HC/0205054]
• Allison Woodruff, Margaret H. Szymanski, Rebecca E. Grinter, Paul M. Aoki:
  Practical Strategies for Integrating a Conversation Analyst in an Iterative Design Process. , (informal publication)
  Electronic Edition (link) BibTeX [cs.HC/0205055]
• Michael R. Fellows, Jens Gramm, Rolf Niedermeier:
  Parameterized Intractability of Motif Search Problems. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CC/0205056]
• Mathias Creutz, Krista Lagus:
  Unsupervised Discovery of Morphemes. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205057]
• Alexei Novikov:
  Content Distribution in Unicast Replica Meshes. , (informal publication)
  Electronic Edition (link) BibTeX [cs.NI/0205058]
• Saverio Perugini, Marcos André Gonçalves, Edward A. Fox:
  A Connection-Centric Survey of Recommender Systems Research. , (informal publication)
  Electronic Edition (link) BibTeX [cs.IR/0205059]
• Christoph Koch:
  Optimizing Queries Using a Meta-level Database. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DB/0205060]
• Marek W. Gutowski:
  Aging, double helix and small world property in genetic algorithms. , (informal publication)
  Electronic Edition (link) BibTeX [cs.NE/0205061]
• Michael A. Frumkin, Rob F. Van der Wijngaart:
  Minimizing Cache Misses in Scientific Computing Using Isoperimetric Bodies. , (informal publication)
  Electronic Edition (link) BibTeX [cs.PF/0205062]
• W. Chen:
  Distance function wavelets - Part II: Extended results and conjectures. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CE/0205063]
• Charles Sauerbier:
  A polynomial time (heuristic) SAT algorithm. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CC/0205064]
• Regina Barzilay, Lillian Lee:
  Bootstrapping Lexical Choice via Multiple-Sequence Alignment. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205065]
• Benoît Hudson, Tuomas Sandholm:
  Effectiveness of Preference Elicitation in Combinatorial Auctions. , (informal publication)
  Electronic Edition (link) BibTeX [cs.GT/0205066]
• Ted Pedersen:
  Evaluating the Effectiveness of Ensembles of Decision Trees in Disambiguating Senseval Lexical Samples. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205067]
• Ted Pedersen:
  Assessing System Agreement and Instance Difficulty in the Lexical Sample Tasks of Senseval-2. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205068]
• Ted Pedersen:
  Machine Learning with Lexical Features: The Duluth Approach to Senseval-2. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205069]
• Bo Pang, Lillian Lee, Shivakumar Vaithyanathan:
  Thumbs up? Sentiment Classification using Machine Learning Techniques. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205070]
• Xiaoming Liu, Tim Brody, Stevan Harnad, Les Carr, Kurt Maly, Mohammad Zubair, Michael L. Nelson:
  A Scalable Architecture for Harvest-Based Digital Libraries - The ODU/Southampton Experiments. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DL/0205071]
• Sylvain Neuvel, Sean A. Fulop:
  Unsupervised Learning of Morphology without Morphemes. , (informal publication)
  Electronic Edition (link) BibTeX [cs.CL/0205072]
• Vincent Conitzer, Tuomas Sandholm:
  Vote Elicitation: Complexity and Strategy-Proofness. , (informal publication)
  Electronic Edition (link) BibTeX [cs.GT/0205073]
• Vincent Conitzer, Tuomas Sandholm:
  Complexity Results about Nash Equilibria. , (informal publication)
  Electronic Edition (link) BibTeX [cs.GT/0205074]
• Vincent Conitzer, Tuomas Sandholm:
  Complexity of Mechanism Design. , (informal publication)
  Electronic Edition (link) BibTeX [cs.GT/0205075]
• Vincent Conitzer, Tuomas Sandholm:
  Complexity of Manipulating Elections with Few Candidates. , (informal publication)
  Electronic Edition (link) BibTeX [cs.GT/0205076]
• Samir Khuller, Balaji Raghavachari, Neal E. Young:
  Designing Multi-Commodity Flow Trees. , (informal publication)
  Electronic Edition (link) BibTeX [cs.DS/0205077]
• Larry Wos:
  A Spectrum of Applications of Automated Reasoning. , (informal publication)
  Electronic Edition (link) BibTeX [cs.AI/0205078]
• Daniel J. Lehmann:
  Connectives in Quantum and other Cumulative Logics. , (informal publication)
  Electronic Edition (link) BibTeX [cs.AI/0205079]
• Matus Marko, M. A. Porter, A. Probst, Carlos Gershenson, Atin Das:
  Transforming the World Wide Web into a Complexity-Based Semantic Network. , (informal publication)
  Electronic Edition (link) BibTeX [cs.NI/0205080]
• David S. Dean, Satya N. Majumdar:
  Phase Transition in a Random Fragmentation Problem with Applications to Computer Science. , (informal publication)
  Electronic Edition (link) BibTeX [cond-mat/0205034]
• Satya N. Majumdar, David S. Dean:
  Exact Solution of a Drop-push Model for Percolation. , (informal publication)
  Electronic Edition (link) BibTeX [cond-mat/0205336]
• Jobst Heitzig:
  The asymptotic complexity of partial sorting -- How to learn large posets by pairwise comparisons. , (informal publication)
  Electronic Edition (link) BibTeX [math.CO/0205049]
• Julia Kempe:
  Quantum Random Walks Hit Exponentially Faster. , (informal publication)
  Electronic Edition (link) BibTeX [quant-ph/0205083]
• Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp:
  Authentication of Quantum Messages. , (informal publication)
  Electronic Edition (link) BibTeX [quant-ph/0205128]
• Barbara M. Terhal, David P. DiVincenzo:
  Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games. , (informal publication)
  Electronic Edition (link) BibTeX [quant-ph/0205133]