Some New Results in Pseudo-Random Number Generation. - Allen Van Gelder (J. ACM, 1967)

Structured Programming in Cobol: An Approach for Application Programmers. - Allen Van Gelder (Commun. ACM, 1977)

System/U: A Database System Based on the Universal Relation Assumption. - Henry F. Korth; Gabriel M. Kuper; Joan Feigenbaum; Allen Van Gelder; Jeffrey D. Ullman (ACM Trans. Database Syst., 1984)

Design Overview of the NAIL! System. - Katherine A. Morris; Jeffrey D. Ullman; Allen Van Gelder (ICLP, 1986)

A Message Passing Framework for Logical Query Evaluation. - Allen Van Gelder (SIGMOD Conference, 1986)

Logic programming for parallel implementation. - Allen Van Gelder (1986)

Safety and Correct Translation of Relational Calculus Formulas. - Allen Van Gelder; Rodney W. Topor (PODS, 1987)

YAWN! (Yet Another Window on NAIL!). - Katherine A. Morris; Jeffrey F. Naughton; Yatin P. Saraiya; Jeffrey D. Ullman; Allen Van Gelder (IEEE Data Eng. Bull., 1987)

Efficient Loop Detection in Prolog using the Tortoise-and-Hare Technique. - Allen Van Gelder (J. Log. Program., 1987)

Negation as Failure Using Tight Derivations for General Logic Programs. - Allen Van Gelder (Foundations of Deductive Databases and Logic Programming., 1988)

Unfounded Sets and Well-Founded Semantics for General Logic Programs. - Allen Van Gelder; Kenneth A. Ross; John S. Schlipf (PODS, 1988)

Parallel Complexity of Logical Query Programs. - Jeffrey D. Ullman; Allen Van Gelder (Algorithmica, 1988)

Efficient tests for top-down termination of logical rules. - Jeffrey D. Ullman; Allen Van Gelder (J. ACM, 1988)

A Satisfiability Tester for Non-clausal Propositional Calculus - Allen Van Gelder (Inf. Comput., 1988)

Negation as Failure using Tight Derivations for General Logic Programs. - Allen Van Gelder (J. Log. Program., 1989)

Packet Distribution on a Ring. - David Peleg; Allen Van Gelder (J. Parallel Distributed Comput., 1989)

PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms. - Allen Van Gelder (IEEE Trans. Computers, 1989)

A New Form of Circumscription for Logic Programs (Extended Abstract). - Allen Van Gelder (LPNMR, 1990)

Topological considerations in isosurface generation extended abstract. - Jane Wilhelms; Allen Van Gelder (VVS, 1990)

Modeling Simultaneous Events with Default Reasoning and Tight Derivations. - Allen Van Gelder (J. Log. Program., 1990)

Termination Detection in Logic Programs using Argument Sizes. - Kirack Sohn; Allen Van Gelder (PODS, 1991)

A coherent projection approach for direct volume rendering. - Jane Wilhelms; Allen Van Gelder (SIGGRAPH, 1991)

Deriving Constraints Among Argument Sizes in Logic Programs. - Allen Van Gelder (Ann. Math. Artif. Intell., 1991)

The Well-Founded Semantics for General Logic Programs. - Allen Van Gelder; Kenneth A. Ross; John S. Schlipf (J. ACM, 1991)

Safety and Translation of Relational Calculus Queries. - Allen Van Gelder; Rodney W. Topor (ACM Trans. Database Syst., 1991)

Measuring the effectiveness of optimization. Search Strategies. - Rosana S. G. Lanzelotte; Mohamed Zaït; Allen Van Gelder (BDA, 1992)

Optimizing Active Databases using the Split Technique. - Serge Abiteboul; Allen Van Gelder (ICDT, 1992)

The Well-Founded Semantics of Aggregation. - Allen Van Gelder (PODS, 1992)

Interactive Visualization of Flow Fields. - Allen Van Gelder; Jane Wilhelms (VVS, 1992)

Short Note: Van Gelder's Response. - Allen Van Gelder (J. Log. Program., 1992)

Octrees for Faster Isosurface Generation. - Jane Wilhelms; Allen Van Gelder (ACM Trans. Graph., 1992)

Satisfiability testing with more reasoning and less guessing. - Allen Van Gelder; Yumi K. Tsuji (Cliques, Coloring, and Satisfiability, 1993)

Foundations of Aggregation in Deductive Databases. - Allen Van Gelder (DOOD, 1993)

Multiple Join Size Estimation by Virtual Domains. - Allen Van Gelder (PODS, 1993)

Deterministic Parsing of Languages with Dynamic Operators. - Kjell Post; Allen Van Gelder; James Kerr (ILPS, 1993)

Rapid Exploration of Curvilinear Grids Using Direct Volume Rendering. - Allen Van Gelder; Jane Wilhelms (IEEE Visualization, 1993)

The Alternating Fixpoint of Logic Programs with Negation. - Allen Van Gelder (J. Comput. Syst. Sci., 1993)

Commonsense Axiomatizations for Logic Programs. - Allen Van Gelder; John S. Schlipf (J. Log. Program., 1993)

Topological considerations in isosurface generation. - Allen Van Gelder; Jane Wilhelms (ACM Trans. Graph., 1994)

Multi-Dimensional Trees for Controlled Volume Rendering and Compression. - Jane Wilhelms; Allen Van Gelder (VVS, 1995)

Corrigendum: Topological Considerations in Isosurface Generation. - Allen Van Gelder; Jane Wilhelms (ACM Trans. Graph., 1995)

Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids. - Jane Wilhelms; Allen Van Gelder; Paul Tarantino; Jonathan Gibbs (IEEE Visualization, 1996)

Direct Volume Rendering with Shading via Three-Dimensional Textures. - Allen Van Gelder; Kwansik Kim (VVS, 1996)

An Interactive Fur Modeling Technique. - Allen Van Gelder; Jane Wilhelms (Graphics Interface, 1997)

Varying spring constants for accurate simulation of elastic materials. - Allen Van Gelder; Jane Wilhelms (SIGGRAPH Visual Proceedings, 1997)

Anatomically based modeling. - Jane Wilhelms; Allen Van Gelder (SIGGRAPH, 1997)

Approximate Simulation of Elastic Membranes by Triangulated Spring Meshes. - Allen Van Gelder (J. Graphics, GPU, & Game Tools, 1998)

Volume Decimation of Irregular Tetrahedral Grids. - Allen Van Gelder; Vivek Verma; Jane Wilhelms (Computer Graphics International, 1999)

A propositional theorem prover to solve planning and other problems. - Allen Van Gelder; Fumiaki Okushi (Ann. Math. Artif. Intell., 1999)

Lemma and cut strategies for propositional model elimination. - Allen Van Gelder; Fumiaki Okushi (Ann. Math. Artif. Intell., 1999)

Complexity Analysis of Propositional Resolution with Autarky Pruning. - Allen Van Gelder (Discret. Appl. Math., 1999)

Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy. - Allen Van Gelder (J. Autom. Reason., 1999)

Computer Algorithms - Introduction to Design and Analysis (3. ed., repr. with corr.). - Sara Baase; Allen Van Gelder (Pearson / Prentice Hall, 2000)

Human Motion from Active Contours. - Jane Wilhelms; Allen Van Gelder; L. Atkinson-Derman; A. Luo (Workshop on Human Motion, 2000)

Partitioning Methods for Satisfiability Testing on Large Formulas. - Tai Joon Park; Allen Van Gelder (Inf. Comput., 2000)

Stream Surface Generation for Fluid Flow Solutions on Curvilinear Grids. - Allen Van Gelder (VisSym, 2001)

Combining Preorder and Postorder Resolution in a Satisfiability Solver. - Allen Van Gelder (Electron. Notes Discret. Math., 2001)

Fast and Easy Reach-Cone Joint Limits. - Jane Wilhelms; Allen Van Gelder (J. Graphics, GPU, & Game Tools, 2001)

Generalizations of Watched Literals for Backtracking Search. - Allen Van Gelder (AI&M, 2002)

Extracting (Easily) Checkable Proofs from a Satisfiability Solver that Employs both Preorder and Postorder Resolution. - Allen Van Gelder (AI&M, 2002)

Model-based reconstruction for creature animation. - Maryann Simmons; Jane Wilhelms; Allen Van Gelder (Symposium on Computer Animation, 2002)

A perspective on certain polynomial-time solvable classes of satisfiability. - John V. Franco; Allen Van Gelder (Discret. Appl. Math., 2003)

Combining vision and computer graphics for video motion capture. - Jane Wilhelms; Allen Van Gelder (Vis. Comput., 2003)

Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination. - Fumiaki Okushi; Allen Van Gelder (Ann. Math. Artif. Intell., 2004)

Independently Checkable Proofs from Decision Procedures: Issues and Progress. - Allen Van Gelder (LPAR, 2005)

Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning. - Allen Van Gelder (LPAR, 2005)

Input Distance and Lower Bounds for Propositional Resolution Proof Length. - Allen Van Gelder (SAT, 2005)

Toward leaner binary-clause reasoning in a satisfiability solver. - Allen Van Gelder (Ann. Math. Artif. Intell., 2005)

Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation. - Allen Van Gelder; Geoff Sutcliffe (IJCAR, 2006)

Using the TPTP Language for Writing Derivations and Finite Interpretations. - Geoff Sutcliffe; Stephan Schulz 001; Koen Claessen; Allen Van Gelder (IJCAR, 2006)

Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs. - Allen Van Gelder (SAT, 2006)

Verifying Propositional Unsatisfiability: Pitfalls to Avoid. - Allen Van Gelder (SAT, 2007)

Clause Learning Can Effectively P-Simulate General Propositional Resolution. - Philipp Hertel; Fahiem Bacchus; Toniann Pitassi; Allen Van Gelder (AAAI, 2008)

Verifying RUP Proofs of Propositional Unsatisfiability. - Allen Van Gelder (ISAIM, 2008)

Decomposition and Visualization of Fourth-Order Elastic-Plastic Tensors. - Alisa Neeman; Rebecca M. Brannon; Boris Jeremic; Allen Van Gelder; Alex Pang (VG/PBG@SIGGRAPH, 2008)

Another look at graph coloring via propositional satisfiability. - Allen Van Gelder (Discret. Appl. Math., 2008)

Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces. - Allen Van Gelder (SAT, 2009)

Using PVsolve to Analyze and Locate Positions of Parallel Vectors. - Allen Van Gelder; Alex Pang (IEEE Trans. Vis. Comput. Graph., 2009)

Zero-One Designs Produce Small Hard SAT Instances. - Allen Van Gelder; Ivor T. A. Spence (SAT, 2010)

Variable Independence and Resolution Paths for Quantified Boolean Formulas. - Allen Van Gelder (CP, 2011)

A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas. - Alexandra Goultiaeva; Allen Van Gelder; Fahiem Bacchus (IJCAI, 2011)

Careful Ranking of Multiple Solvers with Timeouts and Ties. - Allen Van Gelder (SAT, 2011)

Generalized Conflict-Clause Strengthening for Satisfiability Solvers. - Allen Van Gelder (SAT, 2011)

Stable Feature Flow Fields. - Tino Weinkauf; Holger Theisel; Allen Van Gelder; Alex T. Pang (IEEE Trans. Vis. Comput. Graph., 2011)

Contributions to the Theory of Practical Quantified Boolean Formula Solving. - Allen Van Gelder (CP, 2012)

Extended Failed-Literal Preprocessing for Quantified Boolean Formulas. - Allen Van Gelder; Samuel B. Wood; Florian Lonsing (SAT, 2012)

Vortex core detection: back to basics. - Allen Van Gelder (Visualization and Data Analysis, 2012)

Producing and verifying extremely large propositional refutations - Have your cake and eat it too. - Allen Van Gelder (Ann. Math. Artif. Intell., 2012)

Contrasat - A Contrarian SAT Solver. - Allen Van Gelder (J. Satisf. Boolean Model. Comput., 2012)

Primal and Dual Encoding from Applications into Quantified Boolean Formulas. - Allen Van Gelder (CP, 2013)

Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation. - Florian Lonsing; Uwe Egly; Allen Van Gelder (SAT, 2013)

The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games. - Mikolas Janota; Charles Jordan; Will Klieber; Florian Lonsing; Martina Seidl; Allen Van Gelder (J. Satisf. Boolean Model. Comput., 2014)

The QBF Gallery: Behind the scenes. - Florian Lonsing; Martina Seidl; Allen Van Gelder (Artif. Intell., 2016)

Subsumption-Linear Q-Resolution for QBF Theorem Proving. - Allen Van Gelder (WoLLIC, 2023)

Partial Boolean Functions for QBF Semantics. - Allen Van Gelder (ISAIM, 2024)