| 2008 |
|---|
| 114 | EE | Tomás Flouri,
Costas S. Iliopoulos,
Mohammad Sohel Rahman,
Ladislav Vagner,
Michal Vorácek:
Indexing Factors in DNA/RNA Sequences.
BIRD 2008: 436-445 |
| 113 | EE | Pavlos Antoniou,
Costas S. Iliopoulos,
Inuka Jayasekera,
M. Sohel Rahman:
Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model.
BIRD 2008: 446-455 |
| 112 | EE | Maxime Crochemore,
Szilárd Zsolt Fazekas,
Costas S. Iliopoulos,
Inuka Jayasekera:
Bounds on Powers in Strings.
Developments in Language Theory 2008: 206-215 |
| 111 | EE | Costas S. Iliopoulos,
M. Sohel Rahman:
A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns.
SOFSEM 2008: 316-327 |
| 110 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Marcin Kubica,
Mohammad Sohel Rahman,
Tomasz Walen:
Improved Algorithms for the Range Next Value Problem and Applications.
STACS 2008: 205-216 |
| 109 | EE | Costas S. Iliopoulos,
M. Sohel Rahman:
Indexing Circular Patterns.
WALCOM 2008: 46-57 |
| 108 | EE | Kangho Roh,
Maxime Crochemore,
Costas S. Iliopoulos,
Kunsoo Park:
External Memory Algorithms for String Problems.
Fundam. Inform. 84(1): 17-32 (2008) |
| 107 | EE | Hui Zhang,
Qing Guo,
Costas S. Iliopoulos:
Algorithms for Computing the lambda-regularities in Strings.
Fundam. Inform. 84(1): 33-49 (2008) |
| 106 | EE | Costas S. Iliopoulos,
Mohammad Sohel Rahman:
Faster index for property matching.
Inf. Process. Lett. 105(6): 218-223 (2008) |
| 105 | EE | Costas S. Iliopoulos,
Mohammad Sohel Rahman:
New efficient algorithms for the LCS and constrained LCS problems.
Inf. Process. Lett. 106(1): 13-18 (2008) |
| 104 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Mohammad Sohel Rahman:
Optimal prefix and suffix queries on texts.
Inf. Process. Lett. 108(5): 320-325 (2008) |
| 103 | EE | Hui Zhang,
Qing Guo,
Costas S. Iliopoulos:
Generalized approximate regularities in strings.
Int. J. Comput. Math. 85(2): 155-168 (2008) |
| 102 | EE | Manolis Christodoulakis,
Costas S. Iliopoulos,
Mohammad Sohel Rahman,
William F. Smyth:
Identifying Rhythms in Musical Texts.
Int. J. Found. Comput. Sci. 19(1): 37-51 (2008) |
| 101 | EE | Costas S. Iliopoulos,
Mirka Miller:
Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia.
J. Discrete Algorithms 6(1): 1-2 (2008) |
| 100 | EE | Costas S. Iliopoulos,
Laurent Mouchard,
Mohammad Sohel Rahman:
A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching.
Mathematics in Computer Science 1(4): 557-569 (2008) |
| 99 | EE | Costas S. Iliopoulos,
M. Sohel Rahman:
Algorithms for computing variants of the longest common subsequence problem.
Theor. Comput. Sci. 395(2-3): 255-267 (2008) |
| 98 | EE | Amihood Amir,
Eran Chencinski,
Costas S. Iliopoulos,
Tsvi Kopelowitz,
Hui Zhang:
Property matching and weighted matching.
Theor. Comput. Sci. 395(2-3): 298-310 (2008) |
| 2007 |
|---|
| 97 | EE | M. Sohel Rahman,
Costas S. Iliopoulos:
A New Efficient Algorithm for Computing the Longest Common Subsequence.
AAIM 2007: 82-90 |
| 96 | EE | Costas S. Iliopoulos,
M. Sohel Rahman,
Michal Vorácek,
Ladislav Vagner:
The Constrained Longest Common Subsequence Problem for Degenerate Strings.
CIAA 2007: 309-311 |
| 95 | EE | Costas S. Iliopoulos,
Marcin Kubica,
M. Sohel Rahman,
Tomasz Walen:
Algorithms for Computing the Longest Parameterized Common Subsequence.
CPM 2007: 265-273 |
| 94 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
M. Sohel Rahman:
Finding Patterns in Given Intervals.
MFCS 2007: 645-656 |
| 93 | EE | Inbok Lee,
Costas S. Iliopoulos,
Syng-Yup Ohn:
Transformation of Suffix Arrays into Suffix Trees on the MPI Environment.
RSFDGrC 2007: 248-255 |
| 92 | EE | M. Sohel Rahman,
Costas S. Iliopoulos:
Indexing Factors with Gaps.
SOFSEM (1) 2007: 465-474 |
| 91 | | M. Sohel Rahman,
Costas S. Iliopoulos:
Pattern Matching Algorithms with Don't Cares.
SOFSEM (2) 2007: 116-126 |
| 90 | EE | Julien Allali,
Pascal Ferraro,
Pierre Hanna,
Costas S. Iliopoulos:
Local Transpositions in Alignment of Polyphonic Musical Sequences.
SPIRE 2007: 26-38 |
| 89 | | M. Sohel Rahman,
Costas S. Iliopoulos,
Laurent Mouchard:
Pattern Matching in Degenerate DNA/RNA Sequences.
WALCOM 2007: 109-120 |
| 88 | EE | A. Bakalis,
Costas S. Iliopoulos,
Christos Makris,
Spyros Sioutas,
Evangelos Theodoridis,
Athanasios K. Tsakalidis,
Kostas Tsichlas:
Locating Maximal Multirepeats in Multiple Strings Under Various Constraints.
Comput. J. 50(2): 178-185 (2007) |
| 87 | EE | Qing Guo,
Hui Zhang,
Costas S. Iliopoulos:
Computing the lambda-covers of a string.
Inf. Sci. 177(19): 3957-3967 (2007) |
| 86 | EE | Emilios Cambouropoulos,
Maxime Crochemore,
Costas S. Iliopoulos,
Manal Mohamed,
Marie-France Sagot:
All maximal-pairs in step-leap representation of melodic sequence.
Inf. Sci. 177(9): 1954-1962 (2007) |
| 85 | EE | Costas S. Iliopoulos,
Katerina Perdikuri,
Evangelos Theodoridis,
Athanasios K. Tsakalidis,
Kostas Tsichlas:
Algorithms for extracting motifs from biological weighted sequences.
J. Discrete Algorithms 5(2): 229-242 (2007) |
| 84 | EE | Inbok Lee,
Costas S. Iliopoulos,
Kunsoo Park:
Linear time algorithm for the longest common repeat problem.
J. Discrete Algorithms 5(2): 243-249 (2007) |
| 83 | EE | Manolis Christodoulakis,
G. Brian Golding,
Costas S. Iliopoulos,
Yoan José Pinzón Ardila,
William F. Smyth:
Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences.
Journal of Computational Biology 14(7): 1001-1010 (2007) |
| 2006 |
|---|
| 82 | EE | Qing Guo,
Hui Zhang,
Costas S. Iliopoulos:
Computing the lambda-Seeds of a String.
AAIM 2006: 303-313 |
| 81 | EE | Pavlos Antoniou,
Jan Holub,
Costas S. Iliopoulos,
Borivoj Melichar,
Pierre Peterlongo:
Finding Common Motifs with Gaps Using Finite Automata.
CIAA 2006: 69-77 |
| 80 | EE | M. Sohel Rahman,
Costas S. Iliopoulos,
Inbok Lee,
Manal Mohamed,
William F. Smyth:
Finding Patterns with Variable Length Gaps or Don't Cares.
COCOON 2006: 146-155 |
| 79 | EE | Amihood Amir,
Eran Chencinski,
Costas S. Iliopoulos,
Tsvi Kopelowitz,
Hui Zhang:
Property Matching and Weighted Matching.
CPM 2006: 188-199 |
| 78 | EE | Amihood Amir,
Costas S. Iliopoulos,
Oren Kapah,
Ely Porat:
Approximate Matching in Weighted Sequences.
CPM 2006: 365-376 |
| 77 | EE | M. Sohel Rahman,
Costas S. Iliopoulos:
Algorithms for Computing Variants of the Longest Common Subsequence Problem.
ISAAC 2006: 399-408 |
| 76 | EE | Manolis Christodoulakis,
Costas S. Iliopoulos,
Yoan José Pinzón Ardila:
Simple Algorithm for Sorting the Fibonacci String Rotations.
SOFSEM 2006: 218-225 |
| 75 | EE | Qing Guo,
Hui Zhang,
Costas S. Iliopoulos:
Computing the Minimum Approximate lambda-Cover of a String.
SPIRE 2006: 49-60 |
| 74 | EE | Manolis Christodoulakis,
Costas S. Iliopoulos,
Mohammad Sohel Rahman,
William F. Smyth:
Song classifications for dancing.
Stringology 2006: 41-48 |
| 73 | EE | Costas S. Iliopoulos,
Christos Makris,
Yannis Panagis,
Katerina Perdikuri,
Evangelos Theodoridis,
Athanasios K. Tsakalidis:
The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications.
Fundam. Inform. 71(2-3): 259-277 (2006) |
| 72 | EE | Manolis Christodoulakis,
Costas S. Iliopoulos,
Laurent Mouchard,
Katerina Perdikuri,
Athanasios K. Tsakalidis,
Kostas Tsichlas:
Computation of Repetitions and Regularities of Biologically Weighted Sequences.
Journal of Computational Biology 13(6): 1214-1231 (2006) |
| 71 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Manal Mohamed,
Marie-France Sagot:
Longest repeats with a block of k don't cares.
Theor. Comput. Sci. 362(1-3): 248-254 (2006) |
| 2005 |
|---|
| 70 | EE | Peter Clifford,
Raphaël Clifford,
Costas S. Iliopoulos:
Faster Algorithms for delta, gamma-Matching and Related Problems.
CPM 2005: 68-78 |
| 69 | EE | Emilios Cambouropoulos,
Maxime Crochemore,
Costas S. Iliopoulos,
Manal Mohamed,
Marie-France Sagot:
A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories.
ISMIR 2005: 167-174 |
| 68 | EE | Jeremy Pickens,
Costas S. Iliopoulos:
Markov Random Fields and Maximum Entropy Modeling for Music Information Retrieval.
ISMIR 2005: 207-214 |
| 67 | | Yoan José Pinzón Ardila,
Costas S. Iliopoulos,
Gad M. Landau,
Manal Mohamed:
Approximation algorithm for the cyclic swap problem.
Stringology 2005: 190-200 |
| 66 | EE | Costas S. Iliopoulos,
James A. M. McHugh,
Pierre Peterlongo,
Nadia Pisanti,
Wojciech Rytter,
Marie-France Sagot:
A first approach to finding common motifs with gaps.
Int. J. Found. Comput. Sci. 16(6): 1145-1154 (2005) |
| 65 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Gonzalo Navarro,
Yoan J. Pinzon,
Alejandro Salinger:
Bit-parallel (delta, gamma)-matching and suffix automata.
J. Discrete Algorithms 3(2-4): 198-214 (2005) |
| 64 | | Manolis Christodoulakis,
Costas S. Iliopoulos,
Kunsoo Park,
Jeong Seop Sim:
Approximate Seeds of Strings.
Journal of Automata, Languages and Combinatorics 10(5/6): 609-626 (2005) |
| 63 | | Richard Cole,
Costas S. Iliopoulos,
Manal Mohamed,
William F. Smyth,
L. Yang:
The Complexity of the Minimum k-Cover Problem.
Journal of Automata, Languages and Combinatorics 10(5/6): 641-653 (2005) |
| 62 | | Costas S. Iliopoulos,
Laurent Mouchard,
Katerina Perdikuri,
Athanasios K. Tsakalidis:
Computing the Repetitions in a Biological Weighted Sequence.
Journal of Automata, Languages and Combinatorics 10(5/6): 687-696 (2005) |
| 2004 |
|---|
| 61 | EE | Hui Zhang,
Qing Guo,
Costas S. Iliopoulos:
String Matching with Swaps in a Weighted Sequence.
CIS 2004: 698-704 |
| 60 | | Costas S. Iliopoulos,
Christos Makris,
Yannis Panagis,
Katerina Perdikuri,
Evangelos Theodoridis,
Athanasios K. Tsakalidis:
Efficient Algorithms for Handling Molecular Weighted Sequences.
IFIP TCS 2004: 265-278 |
| 59 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Manal Mohamed,
Marie-France Sagot:
Longest Repeats with a Block of Don't Cares.
LATIN 2004: 271-278 |
| 58 | EE | Inbok Lee,
Costas S. Iliopoulos,
Kunsoo Park:
Linear Time Algorithm for the Longest Common Repeat Problem.
SPIRE 2004: 10-17 |
| 57 | EE | Costas S. Iliopoulos,
Katerina Perdikuri,
Evangelos Theodoridis,
Athanasios K. Tsakalidis,
Kostas Tsichlas:
Motif Extraction from Weighted Sequences.
SPIRE 2004: 286-297 |
| 56 | EE | Costas S. Iliopoulos,
James A. M. McHugh,
Pierre Peterlongo,
Nadia Pisanti,
Wojciech Rytter,
Marie-France Sagot:
A First Approach to Finding Common Motifs With Gaps.
Stringology 2004: 88-97 |
| 55 | EE | Raphaël Clifford,
Costas S. Iliopoulos:
Approximate string matching for music analysis.
Soft Comput. 8(9): 597-603 (2004) |
| 2003 |
|---|
| 54 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Gonzalo Navarro,
Yoan J. Pinzon:
A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval.
SPIRE 2003: 211-223 |
| 53 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Thierry Lecroq:
Occurrence and Substring Heuristics for i-Matching.
Fundam. Inform. 56(1-2): 1-21 (2003) |
| 52 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Yoan J. Pinzon:
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
Fundam. Inform. 56(1-2): 89-103 (2003) |
| 51 | EE | Richard Cole,
Costas S. Iliopoulos,
Thierry Lecroq,
Wojciech Plandowski,
Wojciech Rytter:
On special families of morphisms related to [delta]-matching and don't care symbols.
Inf. Process. Lett. 85(5): 227-233 (2003) |
| 50 | | Diane Donovan,
Costas S. Iliopoulos,
Mirka Miller:
Editorial.
Journal of Automata, Languages and Combinatorics 8(4): 555 (2003) |
| 49 | | Costas S. Iliopoulos,
Manal Mohamed,
Laurent Mouchard,
Katerina Perdikuri,
William F. Smyth,
Athanasios K. Tsakalidis:
String Regularities with Don't Cares.
Nord. J. Comput. 10(1): 40-51 (2003) |
| 48 | EE | Joong Chae Na,
Alberto Apostolico,
Costas S. Iliopoulos,
Kunsoo Park:
Truncated suffix trees and their application to data compression.
Theor. Comput. Sci. 1-3(304): 87-101 (2003) |
| 2002 |
|---|
| 47 | EE | Costas S. Iliopoulos,
Christos Makris,
Spyros Sioutas,
Athanasios K. Tsakalidis,
Kostas Tsichlas:
Identifying Occurrences of Maximal Pairs in Multiple Strings.
CPM 2002: 133-143 |
| 46 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Thierry Lecroq,
Wojciech Plandowski,
Wojciech Rytter:
Three Heuristics for delta-Matching: delta-BM Algorithms.
CPM 2002: 178-189 |
| 45 | EE | Costas S. Iliopoulos,
Manal Mohamed:
Validation and Decomposition of Partially Occluded Images.
SOFSEM 2002: 218-230 |
| 44 | EE | Emilios Cambouropoulos,
Maxime Crochemore,
Costas S. Iliopoulos,
Laurent Mouchard,
Yoan J. Pinzon:
Algorithms for Computing Approximate Repetitions in Musical Sequences.
Int. J. Comput. Math. 79(11): 1135-1148 (2002) |
| 43 | EE | Aspassia Daskalopulu,
Costas S. Iliopoulos,
Manal Mohamed:
On-Line Analysis and Validation of Partially Occluded Images: Implementation and Practice.
Int. J. Comput. Math. 79(12): 1245-1257 (2002) |
| 42 | | Maxime Crochemore,
Costas S. Iliopoulos,
Christos Makris,
Wojciech Rytter,
Athanasios K. Tsakalidis,
T. Tsichlas:
Approximate String Matching with Gaps.
Nord. J. Comput. 9(1): 54-65 (2002) |
| 41 | EE | Costas S. Iliopoulos,
Yoan J. Pinzon:
Recovering an LCS in O(n2/w) Time and Space.
Revista Comlombiana de Computación 3(1): 41-51 (2002) |
| 2001 |
|---|
| 40 | EE | Costas S. Iliopoulos,
Laurent Mouchard,
Yoan J. Pinzon:
The Max-Shift Algorithm for Approximate String Matching.
Algorithm Engineering 2001: 13-25 |
| 39 | | Maxime Crochemore,
Costas S. Iliopoulos,
Yoan J. Pinzon:
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
SPIRE 2001: 59-67 |
| 38 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Yoan J. Pinzon:
Computing Evolutionary Chains in Musical Sequences.
Electr. J. Comb. 8(2): (2001) |
| 37 | | Costas S. Iliopoulos,
James F. Reid:
Decomposition of Partially Occluded Strings in the Presence of Errors.
IJPRAI 15(7): 1129-1142 (2001) |
| 36 | | Jan Holub,
Costas S. Iliopoulos,
Borivoj Melichar,
Laurent Mouchard:
Distributed Pattern Matching Using Finite Automata.
Journal of Automata, Languages and Combinatorics 6(2): 191-204 (2001) |
| 35 | | Costas S. Iliopoulos,
Jamie Simpson:
On-Line Validation and Analysis of Partially Occluded Images.
Journal of Automata, Languages and Combinatorics 6(3): 291-303 (2001) |
| 34 | EE | Jeong Seop Sim,
Costas S. Iliopoulos,
Kunsoo Park,
William F. Smyth:
Approximate periods of strings.
Theor. Comput. Sci. 262(1): 557-568 (2001) |
| 2000 |
|---|
| 33 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Yoan J. Pinzon:
Finding Motifs with Gaps.
ISMIR 2000 |
| 32 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Yoan J. Pinzon:
Fast Evolutionary Chains.
SOFSEM 2000: 307-318 |
| 31 | | Costas S. Iliopoulos,
James F. Reid:
Optimal parallel analysis and decomposition of partially occluded strings.
Parallel Computing 26(4): 483-494 (2000) |
| 30 | EE | Costas S. Iliopoulos:
Combinatorial Algorithms - Preface.
Theor. Comput. Sci. 249(2): 241 (2000) |
| 1999 |
|---|
| 29 | EE | Jeong Seop Sim,
Costas S. Iliopoulos,
Kunsoo Park,
William F. Smyth:
Approximate Periods of Strings.
CPM 1999: 123-133 |
| 28 | | Costas S. Iliopoulos,
Laurent Mouchard:
Quasiperiodicity: From Detection to Normal Forms.
Journal of Automata, Languages and Combinatorics 4(3): 213-228 (1999) |
| 27 | EE | Costas S. Iliopoulos,
Laurent Mouchard:
Quasiperiodicity and String Covering.
Theor. Comput. Sci. 218(1): 205-216 (1999) |
| 1998 |
|---|
| 26 | EE | Costas S. Iliopoulos,
Maureen Korda:
Massively Parallel Suffix Array Construction.
SOFSEM 1998: 371-380 |
| 25 | | Maxime Crochemore,
Costas S. Iliopoulos,
Maureen Korda:
Two-Dimensional Prefix String Matching and Covering on Square Matrices.
Algorithmica 20(4): 353-373 (1998) |
| 1997 |
|---|
| 24 | EE | Costas S. Iliopoulos,
Dennis Moore,
William F. Smyth:
A Characterization of the Squares in a Fibonacci String.
Theor. Comput. Sci. 172(1-2): 281-291 (1997) |
| 1996 |
|---|
| 23 | | Costas S. Iliopoulos,
D. W. G. Moore,
Kunsoo Park:
Covering a String.
Algorithmica 16(3): 288-297 (1996) |
| 22 | EE | Clive N. Galley,
Costas S. Iliopoulos:
A Pram Algorithm for a Special Case of the Set Partition Problem.
Parallel Algorithms Appl. 10(1-2): 105-109 (1996) |
| 21 | EE | Costas S. Iliopoulos,
Kunsoo Park:
A Work-Time Optimal Algorithm for Computing All String Covers.
Theor. Comput. Sci. 164(1&2): 299-310 (1996) |
| 1995 |
|---|
| 20 | | Omer Berkman,
Costas S. Iliopoulos,
Kunsoo Park:
The Subtree Max Gap Problem with Application to Parallel String Covering.
Inf. Comput. 123(1): 127-137 (1995) |
| 1994 |
|---|
| 19 | | Amir M. Ben-Amram,
Omer Berkman,
Costas S. Iliopoulos,
Kunsoo Park:
The Subtree Max Gap Problem with Application to Parallel String Covering.
SODA 1994: 501-510 |
| 18 | | Clive N. Galley,
Costas S. Iliopoulos:
A Simple Parallel Algorithm for the Single Function Coarsest Partition Problem.
Parallel Processing Letters 4: 437-445 (1994) |
| 17 | | Jacqueline W. Daykin,
Costas S. Iliopoulos,
William F. Smyth:
Parallel RAM Algorithms for Factorizing Words.
Theor. Comput. Sci. 127(1): 53-67 (1994) |
| 1993 |
|---|
| 16 | | Costas S. Iliopoulos,
Dennis Moore,
Kunsoo Park:
Covering a String.
CPM 1993: 54-62 |
| 1992 |
|---|
| 15 | | Costas S. Iliopoulos,
William F. Smyth:
Optimal Algorithms for Computing the canonical form of a circular string.
Theor. Comput. Sci. 92(1): 87-105 (1992) |
| 1991 |
|---|
| 14 | | Alberto Apostolico,
Martin Farach,
Costas S. Iliopoulos:
Optimal Superprimitivity Testing for Strings.
Inf. Process. Lett. 39(1): 17-20 (1991) |
| 1989 |
|---|
| 13 | | Costas S. Iliopoulos,
William F. Smyth:
PRAM Algorithms for Identifying Polygon Similarity.
Optimal Algorithms 1989: 25-32 |
| 12 | | Costas S. Iliopoulos:
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix.
SIAM J. Comput. 18(4): 658-669 (1989) |
| 11 | | Costas S. Iliopoulos:
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations.
SIAM J. Comput. 18(4): 670-678 (1989) |
| 1988 |
|---|
| 10 | | Alberto Apostolico,
Costas S. Iliopoulos,
Gad M. Landau,
Baruch Schieber,
Uzi Vishkin:
Parallel Construction of a Suffix Tree with Applications.
Algorithmica 3: 347-365 (1988) |
| 9 | | Costas S. Iliopoulos:
On the Computational Complexity of the Abelian Permutation Group Structure, Membership and Intersection Problems.
Theor. Comput. Sci. 56: 211-222 (1988) |
| 1987 |
|---|
| 8 | | Alberto Apostolico,
Costas S. Iliopoulos,
Robert Paige:
On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem.
Parallel Algorithms and Architectures 1987: 70-76 |
| 1986 |
|---|
| 7 | | Costas S. Iliopoulos:
Monte Carlo Circuits for the Abelian Permutation Group Intersection Problem.
Acta Inf. 23(6): 697-705 (1986) |
| 1985 |
|---|
| 6 | | Costas S. Iliopoulos:
Worst-Case Analysis of Algorithms for Computational Problems on Abelian Permutation Groups.
European Conference on Computer Algebra (2) 1985: 225-228 |
| 5 | | Costas S. Iliopoulos:
Gaussian Elimination over a Euclidean Ring.
European Conference on Computer Algebra (2) 1985: 29-30 |
| 4 | | W. M. Beynon,
Costas S. Iliopoulos:
Computing a Basis for a Finite Abelian p-Group.
Inf. Process. Lett. 20(3): 161-163 (1985) |
| 3 | | Costas S. Iliopoulos:
Analysis of Algorithms on Problems in General Abelian Groups.
Inf. Process. Lett. 20(4): 215-220 (1985) |
| 2 | | Costas S. Iliopoulos:
Computing in General Abelian Groups is Hard.
Theor. Comput. Sci. 41: 81-93 (1985) |
| 1982 |
|---|
| 1 | | Costas S. Iliopoulos:
Analysis of an Algorithm for Composition of Binary Quadratic Forms.
J. Algorithms 3(2): 157-159 (1982) |
