Steve Seiden  Home/Search
Context Related
| lsu.edu/~seiden/manifesto2.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lsu.edu/~seiden/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We promote the much maligned computational method. The computational method is a paradigm for proving mathematical results where the burden of doing the \grunt work" is given to our able research assistant, the computer. We assert that proofs using the computational method, also known as computer aided proofs, are here to stay. In fact, the use of a computer can make the analysis of complicated algorithms fun. We illustrate the usefulness of the method by analyzing a randomized algorithm for... (Update)
Context of citations to this paper: More
...are not so readily accepted. We present one viewpoint on computer assisted proofs, or what we call proofs via the computational method [13]. While one might expect pure mathematicians to be a bit leery of the computational method, one would hope that computer scientists would...
Cited by: More
Can a Computer Proof be Elegant? - Seiden (Correct)
Similar documents (at the sentence level):
42.8%: Making the Analysis of Complicated Algorithms Fun: A Manifesto.. - Seiden (1998) (Correct)
Active bibliography (related documents): More All
0.4: Inheritable Properties and Computer Assisted Proofs in Dynamics - Mrozek (Correct)
0.3: The Power of Vacillation in Language Learning - Case (1999) (Correct)
0.2: A Course in Combinatorial Optimization - Schrijver (2003) (Correct)
Similar documents based on text: More All
0.1: Barely Random Algorithms for Multiprocessor Scheduling - Seiden (2000) (Correct)
0.1: New Results for Online Page Replication - Fleischer, Seiden (2000) (Correct)
0.1: New Bounds for Multi-dimensional Packing - Seiden, van Stee (2002) (Correct)
BibTeX entry: (Update)
Seiden, S. S. A manifesto for the computational method. In Fun with Algorithms: Proceedings of the International Conference (Jun 1998), pp. 148-159. Final version to appear in Theoretical Computer Science. http://citeseer.ist.psu.edu/seiden00manifesto.html More
@misc{ seiden98manifesto,
author = "S. Seiden",
title = "A manifesto for the computational method",
text = "Seiden, S. S. A manifesto for the computational method. In Fun with Algorithms:
Proceedings of the International Conference (Jun 1998), pp. 148-159. Final
version to appear in Theoretical Computer Science.",
year = "1998",
url = "citeseer.ist.psu.edu/seiden00manifesto.html" }
Citations (may not include all citations):957 The Probabilistic Method (context) - Alon, Erdos et al. - 1992
170 Bounds for certain multiprocessing anomalies (context) - Graham - 1966
127 with an application to the entscheidungsproblem (context) - Turing, numbers - 1937
98 New algorithms for an ancient scheduling problem - Bartal, Fiat et al. - 1995
70 A better algorithm for an ancient scheduling problem - Karger, Phillips et al. - 1996
69 An algorithmic proof theory for hypergeometric (context) - Wilf, Zeilberger - 1992
56 and linear programming (context) - Trevisan, Sorkin et al. - 1996
55 approximation algorithm for MAX 3SAT - Karlo, Zwick - 1997
46 Randomized competitive algorithms for the list update proble.. - Reingold, Westbrook et al. - 1994
42 Modular elliptic curves and Fermat's last theorem (context) - Wiles - 1995
36 Ring theoretic properties of certain Hecke algebras (context) - Taylor, Wiles - 1995
20 Anatomy of the Pentium bug - Pratt - 1995
20 Improved bounds for harmonic-based bin packing algorithms (context) - Richey - 1991
18 Multiprocessor scheduling with rejection - Bartal, Leonardi et al. - 2000
12 Computer-assisted proofs in analysis and programming in logi.. - Koch, Schenkel et al. - 1996
12 Theorems for a price: Tomorrow's semi-rigorous mathematical .. (context) - Zeilberger - 1993
8 A note on on-line load balancing for related machines (context) - Berman, Charikar et al. - 1997
8 Every planar map is four colorable part I: Discharging (context) - Appel, Haken - 1977
7 Randomized online multiprocessor scheduling (context) - Seiden - 2000
6 Every planar map is four colorable part II: Reducibility (context) - Appel, Haken et al. - 1977
3 Counterexample to Euler's conjecture on sums of like powers (context) - Lander, Parkin - 1966
3 On formally undecidable propositions of Principia Mathematic.. (context) - odel - 1931
3 Ergebnisse des Mathematischen Kolloquiums (context) - odel, length et al. - 1936
3 A counterexample to Euler's sum of powers conjecture (context) - Lander, Parkin - 1967
3 Short theorems with long proofs (context) - Spencer - 1983
2 Swiss scientists warn of robot Armageddon (context) - Kelly
2 Experimental mathematics: A discussion - Borwein, Borwein et al. - 1996
2 Choas in Lorenz equations: A computer assisted proof (context) - Mischaikow, Mrozek - 1995
Documents on the same site (http://bit.csc.lsu.edu/~seiden/): More
Online Randomized Multiprocessor Scheduling - Seiden (1998) (Correct)
Scheduling Two Machines with Release Times - Noga, Seiden (1998) (Correct)
On Multi-threaded Metrical Task Systems - Feuerstein, Seiden, de Loma (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC