Jürgen Giesl - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged graph-rewriting

Termination Graphs for Java BytecodeMarc Brockschmidt, Carsten Otto, Christian von Essen, Jürgen Giesl. BIRTHDAY 2010: 17-37 [doi]

Automated Termination Analysis of Java Bytecode by Term RewritingCarsten Otto, Marc Brockschmidt, Christian von Essen, Jürgen Giesl. RTA 2010: 259-276 [doi]

Proving Termination of Integer Term RewritingCarsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke. RTA 2009: 32-47 [doi]

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]

Adding constants to string rewritingRené Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp. aaecc, 19(1):27-38, 2008. [doi]

Termination Analysis of Logic Programs Based on Dependency GraphsManh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Danny De Schreye. LOPSTR 2008: 8-22 [doi]

Termination of Programs using Term Rewriting and SAT SolvingJürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik. Dagstuhl 2007: [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.

Automated Termination Analysis for Haskell: From Term Rewriting to Programming LanguagesJürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann. RTA 2006: 297-312 [doi]

Automated Termination Analysis for Logic Programs by Term RewritingPeter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann. LOPSTR 2007: 177-193 [doi]

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]

Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, ProceedingsJürgen Giesl, editor, Volume 3467 of Lecture Notes in Computer Science, Springer, 2005.

The size-change principle and dependency pairs for termination of term rewritingRené Thiemann, Jürgen Giesl. aaecc, 16(4):229-270, 2005. [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]

Size-Change Termination for Term RewritingRené Thiemann, Jürgen Giesl. RTA 2003: 264-278 [doi]

Liveness in RewritingJürgen Giesl, Hans Zantema. RTA 2003: 321-336 [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]

Modular Termination Proofs for Rewriting Using Dependency PairsJürgen Giesl, Thomas Arts, Enno Ohlebusch. JSC, 34(1):21-58, 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

Dependency Pairs for Equational RewritingJürgen Giesl, Deepak Kapur. RTA 2001: 93-108 [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.

Termination of term rewriting using dependency pairsThomas Arts, Jürgen Giesl. TCS, 236(1-2):133-178, 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.

Applying Rewriting Techniques to the Verification of Erlang ProcessesThomas Arts, Jürgen Giesl. csl 1999: 96-110

Transforming Context-Sensitive Rewrite SystemsJürgen Giesl, Aart Middeldorp. RTA 1999: 271-287 [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]

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.

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]

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.

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]

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