Allen Van Gelder
#163,599
Most Influential Person Now
Allen Van Gelder's AcademicInfluence.com Rankings
Allen Van Geldercomputer-science Degrees
Computer Science
#9618
World Rank
#10094
Historical Rank
Programming
#90
World Rank
#94
Historical Rank
Artificial Intelligence
#4613
World Rank
#4675
Historical Rank
Database
#6586
World Rank
#6821
Historical Rank
Download Badge
Computer Science
Allen Van Gelder's Degrees
- PhD Computer Science Stanford University
- Masters Computer Science Stanford University
- Bachelors Mathematics University of California, Berkeley
Similar Degrees You Can Earn
Why Is Allen Van Gelder Influential?
(Suggest an Edit or Addition)Allen Van Gelder's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- The well-founded semantics for general logic programs (1991) (1970)
- Octrees for faster isosurface generation (1990) (612)
- Computer Algorithms: Introduction to Design and Analysis (1978) (539)
- The Alternating Fixpoint of Logic Programs with Negation (1989) (487)
- Unfounded sets and well-founded semantics for general logic programs (1988) (487)
- Negation as Failure using Tight Derivations for General Logic Programs (1988) (303)
- Anatomically based modeling (1997) (291)
- Topological considerations in isosurface generation (1994) (274)
- A coherent projection approach for direct volume rendering (1991) (266)
- Direct volume rendering with shading via three-dimensional textures (1996) (251)
- Octrees for faster isosurface generation (1992) (228)
- Approximate Simulation of Elastic Membranes by Triangulated Spring Meshes (1998) (225)
- Parallel complexity of logical query programs (1986) (161)
- Efficient tests for top-down termination of logical rules (1988) (140)
- Topological considerations in isosurface generation extended abstract (1990) (139)
- Design Overview of the NAIL! System (1986) (138)
- Termination detection in logic programs using argument sizes (extended abstract) (1991) (123)
- Satisfiability testing with more reasoning and less guessing (1995) (109)
- Multi-dimensional trees for controlled volume rendering and compression (1994) (109)
- Safety and translation of relational calculus (1991) (103)
- The well-founded semantics of aggregation (1992) (86)
- A perspective on certain polynomial-time solvable classes of satisfiability (2003) (83)
- Using the TPTP Language for Writing Derivations and Finite Interpretations (2006) (80)
- Another look at graph coloring via propositional satisfiability (2008) (74)
- Contributions to the Theory of Practical Quantified Boolean Formula Solving (2012) (72)
- Verifying RUP Proofs of Propositional Unsatisfiability (2008) (70)
- Deriving constraints among argument sizes in logic programs (1990) (69)
- A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas (2011) (66)
- Hierarchical and parallelizable direct volume rendering for irregular and multiple grids (1996) (63)
- Clause Learning Can Effectively P-Simulate General Propositional Resolution (2008) (61)
- Stable Feature Flow Fields (2011) (60)
- An Interactive Fur Modeling Technique (1997) (50)
- YAWN! (Yet Another Window on NAIL!) (1987) (48)
- A Satisfiability Tester for Non-clausal Propositional Calculus (1984) (47)
- Fast and Easy Reach-Cone Joint Limits (2001) (47)
- Efficient Loop Detection in Prolog using the Tortoise-and-Hare Technique (1987) (45)
- Safety and correct translation of relational calculus formulas (1987) (45)
- Rapid exploration of curvilinear grids using direct volume rendering (1993) (44)
- Extracting (Easily) Checkable Proofs from a Satisfiability Solver that Employs both Preorder and Postorder Resolution (2002) (41)
- Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning (2005) (41)
- Partitioning Methods for Satisfiability Testing on Large Formulas (1996) (39)
- Foundations of Aggregation in Deductive Databases (1993) (38)
- Verifying Propositional Unsatisfiability: Pitfalls to Avoid (2007) (37)
- Model-based reconstruction for creature animation (2002) (35)
- Variable Independence and Resolution Paths for Quantified Boolean Formulas (2011) (34)
- Producing and verifying extremely large propositional refutations Have your cake and eat it too (2012) (33)
- Toward leaner binary-clause reasoning in a satisfiability solver (2005) (29)
- Generalizations of Watched Literals for Backtracking Search (2002) (27)
- Efficient Computation of Polygon Area and Polyhedron Volume (1995) (27)
- Interactive visualization of flow fields (1992) (25)
- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation (2013) (24)
- Producing and verifying extremely large propositional refutations (2012) (23)
- The QBF Gallery: Behind the scenes (2015) (23)
- Careful Ranking of Multiple Solvers with Timeouts and Ties (2011) (22)
- Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation (2006) (22)
- Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces (2009) (22)
- Some New Results in Pseudo-Random Number Generation (1967) (22)
- Theory and Applications of Satisfiability Testing – SAT 2013 (2013) (22)
- Zero-One Designs Produce Small Hard SAT Instances (2010) (21)
- Using PVsolve to Analyze and Locate Positions of Parallel Vectors (2009) (21)
- Multiple Join Size Estimation by Virtual Domains. (1993) (19)
- Generalized Conflict-Clause Strengthening for Satisfiability Solvers (2011) (19)
- The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games (2016) (18)
- Volume decimation of irregular tetrahedral grids (1999) (18)
- Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy (1999) (17)
- Commonsense Axiomatizations for Logic Programs (1993) (16)
- Structured programming in Cobol: an approach for application programmers (1977) (14)
- Combining vision and computer graphics for video motion capture (2003) (14)
- Stream Surface Generation for Fluid Flow Solutions on Curvilinear Grids (2001) (12)
- Lemma and cut strategies for propositional model elimination (1999) (10)
- Extended Failed-Literal Preprocessing for Quantified Boolean Formulas (2012) (10)
- Primal and Dual Encoding from Applications into Quantified Boolean Formulas (2013) (10)
- Multiple join size estimation by virtual domains (extended abstract) (1993) (10)
- Decomposition and Visualization of Fourth-Order Elastic-Plastic Tensors (2008) (9)
- Combining Preorder and Postorder Resolution in a Satisfiability Solver (2001) (9)
- Interactive Video-Based Motion Capture for Character Animation (2002) (9)
- Human motion from active contours (2000) (8)
- Optimizing active databases using the SPLIT technique (1992) (8)
- Efficient Spherical Joint Limits with Reach Cones (2002) (8)
- Contrasat - A Contrarian SAT Solver (2012) (7)
- Input Distance and Lower Bounds for Propositional Resolution Proof Length (2005) (7)
- A propositional theorem prover to solve planning and other problems (1999) (7)
- Final value optimal stochastic control problem with bounded controller. (1967) (6)
- Complexity Analysis of Propositional Resolution with Autarky Pruning (1999) (6)
- PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms (1989) (6)
- Decision Procedures Should Be Able to Produce ( Easily ) Checkable Proofs (2002) (6)
- Propositional Search with k-Clause Introduction Can be Polynomially Simulated by Resolution (1997) (6)
- Deterministic Parsing of Languages with Dynamic Operators (1993) (6)
- Vortex core detection: back to basics (2012) (5)
- Simulation of Elastic Membranes with Triangulated Spring Meshes UCSC-CRL-97-12 (1997) (4)
- Packet Distribution on a Ring (1989) (4)
- On Minimum-Time Minimum-Fuel Rendezvous (1961) (4)
- Measuring the effectiveness of optimization. Search Strategies (1992) (4)
- Modeling Simultaneous Events with Default Reasoning and Tight Derivations (1990) (3)
- Incomplete Thoughts about Incomplete Satissability Procedures Extended Abstract (1993) (3)
- Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination (2004) (3)
- Independently Checkable Proofs from Decision Procedures: Issues and Progress (2005) (3)
- Report on Relaxed Jordan Canonical Form for Computer Animation and Visualization (2009) (2)
- SParallel Complexity of Logical Query Programs (2)
- Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs (2006) (2)
- Partitioning Methods for Satis ability Testing on Large Formulas ( Extended Abstract ) (1)
- Propositional theorem proving: advanced lemma strategies and multi-agent search (1998) (1)
- Final Value Optimization of Systems with Bounded Controller and Noisy Measurements (1968) (1)
- Short Note: Van Gelder's Response (1992) (1)
- Verifying Propositional Unsatis ability: Pitfalls to Avoid (1)
- Corrigendum: Topological considerations in isosurface generation (1995) (1)
- Computer Algorithms - Introduction to Design and Analysis (3. ed., repr. with corr.) (2000) (1)
- A Message Passing Framework for Logical Query Evaluation (1986) (1)
- Varying spring constants for accurate simulation of elastic materials (1997) (0)
- Contrasat - A Contrarian SAT Solver system description (2012) (0)
- A New Form of Circumscription for Logic Programs (Extended Abstract) (1990) (0)
- A Numerically Stable Procedure for Canonical Coordinates in 2 D UCSC – CRL – 99 – 12 (2008) (0)
- Logic progrmming for parallel implementation (1987) (0)
- Logic programming for parallel implementation (1986) (0)
- Hierarchically Accelerated Ray Castingfor Volume Rendering with Controlled (1995) (0)
- An Overview of Nonmonotonic Reasoning and Logic Programming (1993) (0)
- STATISTICAL CONTROL SYSTEM DESIGN. (1966) (0)
- 4 Conclusions and Future Directions Example 5 Existential Query Example 6 Intelligent Backtracking. 3 Compilation and Execution Example 4 Rule Compression and Literal Collapsing for Aggregate Operators Example 3 Built-in Aggregate Operators Example 2 Sql Generation (2007) (0)
- A Tutorial on the Well-Founded Semantics (1997) (0)
- Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing (2013) (0)
- Theory and Applications of Satisfiability Testing - SAT 2013: 16th International Conference, Helsinki, Finland, July 8-12, 2013, Proceedings (2013) (0)
- language. Journal of the ACM, 23(4):733{742, 1976. (2008) (0)
- Rapid Decimation for Direct Volume (2007) (0)
- Lemma and Cut Strategies forTwo-Sided Propositional Resolution (1996) (0)
- The Well-founded Semantics of Aggregation Extended Abstract (1992) (0)
- A Wd&kwwn Prxrblem with Prolog-style Interpreters That Perform Goal (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Allen Van Gelder?
Allen Van Gelder is affiliated with the following schools:
