The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexandre Tiskin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexandre Tiskin
    Tripods Do Not Pack Densely. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:272-280 [Conf]
  2. Alexandre Tiskin
    Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:270-281 [Conf]
  3. Alexandre Tiskin
    All Semi-local Longest Common Subsequences in Subquadratic Time. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:352-363 [Conf]
  4. Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, Alexandre Tiskin
    Parallel Priority Queue and List Contraction: The BSP Approach. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:409-416 [Conf]
  5. Alexandre Tiskin
    Parallel Convex Hull Computation by Generalised Regular Sampling. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:392-399 [Conf]
  6. Alexandre Tiskin
    The Bulk-Synchronous Parallel Random Access Machine. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. II, 1996, pp:327-338 [Conf]
  7. Alexandre Tiskin
    All-Pairs Shortest Paths Computation in the BSP Model. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:178-189 [Conf]
  8. Alexandre Tiskin
    Bulk-Synchronous Parallel Multiplication of Boolean Matrices. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:494-506 [Conf]
  9. Alexandre Tiskin
    Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:717-718 [Conf]
  10. Vladimir G. Deineko, Alexandre Tiskin
    One-Sided Monge TSP Is NP-Hard. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2006, pp:793-801 [Conf]
  11. Peter Krusche, Alexandre Tiskin
    Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism. [Citation Graph (0, 0)][DBLP]
    ICCSA (5), 2006, pp:165-174 [Conf]
  12. Alexandre Tiskin
    Communication-Efficient Parallel Gaussian Elimination. [Citation Graph (0, 0)][DBLP]
    PaCT, 2003, pp:369-383 [Conf]
  13. Alexandre Tiskin
    Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences. [Citation Graph (0, 0)][DBLP]
    PARCO, 2005, pp:827-834 [Conf]
  14. William F. McColl, Alexandre Tiskin
    Memory-Efficient Matrix Multiplication in the BSP Model. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:3-4, pp:287-297 [Journal]
  15. Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, Alexandre Tiskin
    Parallel Priority Queue and List Contraction: The BSP Approach. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2002, v:21, n:1, pp:- [Journal]
  16. Alexandre Tiskin
    Communication-efficient parallel generic pairwise elimination. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2007, v:23, n:2, pp:179-188 [Journal]
  17. Dror Irony, Sivan Toledo, Alexandre Tiskin
    Communication lower bounds for distributed-memory matrix multiplication. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:9, pp:1017-1026 [Journal]
  18. Alexandre Tiskin
    A New Way to Divide and Conquer. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2001, v:11, n:4, pp:409-422 [Journal]
  19. Alexandre Tiskin
    The Bulk-Synchronous Parallel Random Access Machine. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:196, n:1-2, pp:109-130 [Journal]
  20. Vladimir G. Deineko, Alexandre Tiskin
    Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:136-149 [Conf]
  21. Alexandre Tiskin
    Faster subsequence recognition in compressed strings [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  22. Alexandre Tiskin
    Faster exon assembly by sparse spliced alignment [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  23. Alexandre Tiskin
    Semi-local string comparison: algorithmic techniques and applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  24. Vladimir G. Deineko, Alexandre Tiskin
    Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough? [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  25. Alexandre Tiskin
    Packing tripods: Narrowing the density gap. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:1973-1981 [Journal]

  26. Efficient Parallel String Comparison. [Citation Graph (, )][DBLP]


  27. Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio [Citation Graph (, )][DBLP]


Search in 0.048secs, Finished in 0.050secs
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