Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Alexander Tiskin Alexandre Tiskin ( http://dblp.L3S.de/Authors/Alexander_Tiskin )

URL (Homepage):  http://www2.warwick.ac.uk/fac/sci/dcs/people/alexander_tiskin/  Author page on DBLP  Author page in RDF  Community of Alexander Tiskin in ASPL-2

Publication years (Num. hits)
1996-2006 (18) 2007-2009 (18) 2010-2011 (7)
Publication types (Num. hits)
article(19) incollection(1) inproceedings(23)
Venues (Conferences, Journals, ...)
CoRR(7) Euro-Par(4) ICALP(3) CPM(2) CSR(2) ICCSA(2) PARCO(2) Theor. Comput. Sci.(2) ACM Journal of Experimental Al...(1) Algorithmica(1) COCOON(1) Computers and Artificial Intel...(1) Discrete Mathematics(1) Electronic Notes in Discrete M...(1) Encyclopedia of Parallel Compu...(1) Euro-Par, Vol. II(1) More (+10 of total 27)
Authors
Alexandre Tiskin(28) Alexander Tiskin(15) Peter Krusche(6) Vladimir G. Deineko(6) Alexandros V. Gerbessiotis(2) Constantinos J. Siniolakis(2) Nicholas Korpelainen(2) Vadim V. Lozin(2) Andrea Pietracaprina(1) Dmitriy S. Malyshev(1) Dror Irony(1) Emmanuelle Lebhar(1) Rob H. Bisseling(1) Sivan Toledo(1) William F. McColl(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 4 keywords
Results
Found 43 publication records. Showing 43 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin Boundary properties of graphs for algorithmic graph problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alexander Tiskin BSP (Bulk Synchronous Parallelism). Search on Bibsonomy Encyclopedia of Parallel Computing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alexander Tiskin Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition. Search on Bibsonomy CSR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alexander Tiskin Parallel Selection by Regular Sampling. Search on Bibsonomy Euro-Par The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Alexander Tiskin Fast Distance Multiplication of Unit-Monge Matrices. Search on Bibsonomy SODA The full citation details ... 2010 DBLP  BibTeX  RDF
1Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. Search on Bibsonomy TAMC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Peter Krusche, Alexander Tiskin New algorithms for efficient parallel string comparison. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF BSP algorithms, longest increasing subsequences, longest common subsequences
1Vladimir G. Deineko, Alexander Tiskin Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Peter Krusche, Alexander Tiskin String comparison by transposition networks Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Peter Krusche, Alexander Tiskin Computing alignment plots efficiently Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Vladimir G. Deineko, Alexander Tiskin Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Peter Krusche, Alexander Tiskin Parallel Longest Increasing Subsequences in Scalable Time and Memory. Search on Bibsonomy PPAM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin Introduction. Search on Bibsonomy Euro-Par The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Alexander Tiskin Periodic String Comparison. Search on Bibsonomy CPM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Alexander Tiskin Semi-local longest common subsequences in subquadratic time. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Alexandre Tiskin Semi-local String Comparison: Algorithmic Techniques and Applications. Search on Bibsonomy Mathematics in Computer Science The full citation details ... 2008 DBLP  DOI  BibTeX  RDF semi-local string comparison, longest common subsequence, String algorithms
1Alexandre Tiskin Packing tripods: Narrowing the density gap. Search on Bibsonomy Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Alexandre Tiskin Communication-efficient parallel generic pairwise elimination. Search on Bibsonomy Future Generation Comp. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Alexandre Tiskin Faster exon assembly by sparse spliced alignment Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Vladimir G. Deineko, Alexandre Tiskin Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Alexandre Tiskin Faster subsequence recognition in compressed strings Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Vladimir G. Deineko, Alexandre Tiskin Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough? Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Alexandre Tiskin Semi-local string comparison: algorithmic techniques and applications Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Vladimir G. Deineko, Alexandre Tiskin Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. Search on Bibsonomy WEA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Peter Krusche, Alexandre Tiskin Efficient Parallel String Comparison. Search on Bibsonomy PARCO The full citation details ... 2007 DBLP  BibTeX  RDF
1Alexandre Tiskin All Semi-local Longest Common Subsequences in Subquadratic Time. Search on Bibsonomy CSR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Alexandre Tiskin Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. Search on Bibsonomy CPM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Vladimir G. Deineko, Alexandre Tiskin One-Sided Monge TSP Is NP-Hard. Search on Bibsonomy ICCSA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Peter Krusche, Alexandre Tiskin Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism. Search on Bibsonomy ICCSA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Alexandre Tiskin Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences. Search on Bibsonomy PARCO The full citation details ... 2005 DBLP  BibTeX  RDF
1Dror Irony, Sivan Toledo, Alexandre Tiskin Communication lower bounds for distributed-memory matrix multiplication. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Alexandre Tiskin Communication-Efficient Parallel Gaussian Elimination. Search on Bibsonomy PaCT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, Alexandre Tiskin Parallel Priority Queue and List Contraction: The BSP Approach. Search on Bibsonomy Computers and Artificial Intelligence The full citation details ... 2002 DBLP  BibTeX  RDF
1Alexandre Tiskin Parallel Convex Hull Computation by Generalised Regular Sampling. Search on Bibsonomy Euro-Par The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Alexandre Tiskin A New Way to Divide and Conquer. Search on Bibsonomy Parallel Processing Letters The full citation details ... 2001 DBLP  BibTeX  RDF
1Alexandre Tiskin All-Pairs Shortest Paths Computation in the BSP Model. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Alexandre Tiskin Tripods Do Not Pack Densely. Search on Bibsonomy COCOON The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1William F. McColl, Alexandre Tiskin Memory-Efficient Matrix Multiplication in the BSP Model. Search on Bibsonomy Algorithmica The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Bulk-synchronous parallel computation, Memory efficiency, BSP, Parallel matrix multiplication
1Alexandre Tiskin Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices. Search on Bibsonomy ICALP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Alexandre Tiskin The Bulk-Synchronous Parallel Random Access Machine. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Alexandre Tiskin Bulk-Synchronous Parallel Multiplication of Boolean Matrices. Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Alexandros V. Gerbessiotis, Constantinos J. Siniolakis, Alexandre Tiskin Parallel Priority Queue and List Contraction: The BSP Approach. Search on Bibsonomy Euro-Par The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Alexandre Tiskin The Bulk-Synchronous Parallel Random Access Machine. Search on Bibsonomy Euro-Par, Vol. II The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #43 of 43 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.