The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Inge Li Gørtz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Inge Li Gørtz
    Hardness of Preemptive Finite Capacity Dial-a-Ride. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:200-211 [Conf]
  2. Philip Bille, Inge Li Gørtz
    Matching Subsequences in Trees. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:248-259 [Conf]
  3. Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick
    Union-Find with Constant Time Deletions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:78-89 [Conf]
  4. Philip Bille, Inge Li Gørtz
    The Tree Inclusion Problem: In Optimal Space and Faster. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:66-77 [Conf]
  5. Inge Li Gørtz, Anthony Wirth
    Asymmetry in k-Center Variants. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:59-70 [Conf]
  6. Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe
    Time and Space Efficient Multi-method Dispatching. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:20-29 [Conf]
  7. Inge Li Gørtz, Signe Reuss, Morten Heine Sørensen
    Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2003, v:16, n:3, pp:253-285 [Journal]
  8. Inge Li Gørtz, Anthony Wirth
    Asymmetry in k-center variants. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:188-199 [Journal]
  9. Philip Bille, Rolf Fagerberg, Inge Li Gørtz
    Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:52-62 [Conf]
  10. Philip Bille, Rolf Fagerberg, Inge Li Gørtz
    Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  11. Philip Bille, Inge Li Gørtz
    The Tree Inclusion Problem: In Linear Space and Faster [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  12. Minimum Makespan Multi-vehicle Dial-a-Ride. [Citation Graph (, )][DBLP]


  13. Fast Arc-Annotated Subsequence Matching in Linear Space. [Citation Graph (, )][DBLP]


  14. Matching Subsequences in Trees [Citation Graph (, )][DBLP]


  15. Fast Arc-Annotated Subsequence Matching in Linear Space [Citation Graph (, )][DBLP]


Search in 0.452secs, Finished in 0.453secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002