Aart Middeldorp - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged rewriting

Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, ProceedingsRalf Treinen, editor, Volume 5595 of Lecture Notes in Computer Science, Springer, 2009. [doi]

Proving Termination of Rewrite Systems Using BoundsMartin Korp, Aart Middeldorp. RTA 2007: 273-287 [doi]

Dynamic Multilevel Graph VisualizationTodd L. Veldhuizen. corr, abs/0712.1549, 2007. [doi]

Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised PapersMichael Kaufmann, Dorothea Wagner, editors, Volume 4372 of Lecture Notes in Computer Science, Springer, 2007.

Reducibility of gene patterns in ciliates using the breakpoint graphRobert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg. TCS, 356(1-2):26-45, 2006. [doi]

Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplicationBeate Bollig, Stephan Waack, Philipp Woelfel. TCS, 362(1-3):86-99, 2006. [doi]

Multi-way spatial join selectivity for the ring join graphJun-Ki Min, Ho-Hyun Park, Chin-Wan Chung. INFSOF, 47(12):785-795, 2005. [doi]

Aspect graphs for three-dimensional object recognition machine vision systemsTatiana Tambouratzis, Michael J. Wright. ijis, 20(1):47-72, 2005. [doi]

Transformation techniques for context-sensitive rewrite systemsJürgen Giesl, Aart Middeldorp. JFP, 14(4):379-427, 2004. [doi]

Finding hidden independent sets in interval graphsTCS, 310(1-3):287-307, 2004. [doi]

Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, ProceedingsRobert Nieuwenhuis, editor, Volume 2706 of Lecture Notes in Computer Science, Springer, 2003.

Associative-Commutative Rewriting on Large TermsSteven Eker. RTA 2003: 14-29 [doi]

Lower Bounds for General Graph-Driven Read-Once Parity Branching ProgramsHenrik Brosenne, Matthias Homeister, Stephan Waack. mfcs 2003: 290-299 [doi]

Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching ProgramsMatthias Homeister. eccc, (068), 2003. [doi]

Relative Undecidability in Term Rewriting: I. The Termination HierarchyAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. iandc, 178(1):101-131, 2002. [doi]

Relative Undecidability in Term Rewriting: II. The Confluence HierarchyAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. iandc, 178(1):132-148, 2002. [doi]

Innermost Termination of Context-Sensitive RewritingJürgen Giesl, Aart Middeldorp. dlt 2003: 231-244 [doi]

Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDsHenrik Brosenne, Matthias Homeister, Stephan Waack. ita, 36(3):229-247, 2002. [doi]

Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig, Stephan Waack, Philipp Woelfel. ifipTCS 2002: 83-94

Approximating Dependency Graphs Using Tree Automata TechniquesAart Middeldorp. cade 2001: 593-610 [doi]

Drawing Graphs on the TorusWilliam Kocay, Daniel Neilson, Ryan Szypowski. arscom, 59, 2001.

Graph-Driven Free Parity BDDs: Algorithms and Lower BoundsHenrik Brosenne, Matthias Homeister, Stephan Waack. mfcs 2001: 212-223 [doi]

Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig, Philipp Woelfel, Stephan Waack. eccc, 8(073), 2001. [doi]

Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, ProceedingsJoe Marks, editor, Volume 1984 of Lecture Notes in Computer Science, Springer, 2001.

Type Introduction for Equational RewritingAart Middeldorp, Hitoshi Ohsaki. ACTA, 36(12):1007-1029, 2000. [doi]

Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, ProceedingsLeo Bachmair, editor, Volume 1833 of Lecture Notes in Computer Science, Springer, 2000.

Term RewritingAart Middeldorp. csl 1999: 577

Transforming Context-Sensitive Rewrite SystemsJürgen Giesl, Aart Middeldorp. RTA 1999: 271-287 [doi]

Strongly Sequential and Inductively Sequential Term Rewriting SystemsMichael Hanus, Salvador Lucas, Aart Middeldorp. ipl, 67(1):1-8, 1998. [doi]

Neighborhood conditions for balanced independent sets in bipartite graphsDenise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz. DM, 181(1-3):31-36, 1998. [doi]

Within ARM s Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite SystemsWan Fokkink, Jasper Kamperman, Pum Walters. TOPLAS, 20(3):679-706, 1998. [doi]

Type Introduction for Equational RewritingHitoshi Ohsaki, Aart Middeldorp. lfcs 1997: 283-293

Logicality of Conditional Rewrite SystemsToshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp. tapsoft 1997: 141-152

Simple Termination of Rewrite SystemsAart Middeldorp, Hans Zantema. TCS, 175(1):127-158, 1997. [doi]

Relative Undecidability in the Termination Hierarchy of Single Rewrite RulesAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. tapsoft 1997: 237-248

on Global Dynamics of Optimal Graph ReductionJulia L. Lawall, Harry G. Mairson. ICFP 1997: 188-195

Graph Drawing, Symposium on Graph Drawing, GD 96, Berkeley, California, USA, September 18-20, ProceedingsStephen C. North, editor, Volume 1190 of Lecture Notes in Computer Science, Springer, 1997.

Relative Undecidability in Term RewritingAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. csl 1997: 150-166

Graph Drawing, Symposium on Graph Drawing, GD 95, Passau, Germany, September 20-22, 1995, ProceedingsFranz-Josef Brandenburg, editor, Volume 1027 of Lecture Notes in Computer Science, Springer, 1996.

On m-centers in P::t::-free graphsOdile Favaron, Jean-Luc Fouquet. DM, 125(1-3):147-152, 1994. [doi]

Modular Properties of Conditional Term Rewriting SystemsAart Middeldorp. iandc, 104(1):110-158, May 1993.

Graph TypesNils Klarlund, Michael I. Schwartzbach. POPL 1993: 196-205

Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, ProceedingsClaude Kirchner, editor, Volume 690 of Lecture Notes in Computer Science, Springer, 1993.

Sequentiality in Orthogonal Term Rewriting SystemsJan Willem Klop, Aart Middeldorp. JSC, 12(2):161-196, 1991.

Efficient Implementation of Narrowing and RewritingMichael Hanus. pdk 1991: 344-365

International Conference on Rewriting Techniques and ApplicationsRonald V. Book, editor, Volume 488 of Lecture Notes in Computer Science, Springer, Como, Italy, April 1991. [doi]

A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting SystemsAart Middeldorp. lics 1989: 396-401

Modular Aspects of Properties of Term Rewriting Systems Related to Normal FormsAart Middeldorp. RTA 1989: 263-277

Graph Reduction, Proceedings of a Workshop, Santa Fé, New Mexico, USA, September 29 - October 1, 1986Joseph H. Fasel, Robert M. Keller, editors, Volume 279 of Lecture Notes in Computer Science, Springer, 1987.

When m vertices in a k-connected graph cannot be walked round along a simple cycleAlexander K. Kelmans, M. V. Lomonosov. DM, 38(2-3):317-322, 1982. [doi]

runs on WebDSL