@Preamble{
"\ifx \undefined \k \let \k = \c \fi" #
"\ifx \undefined \mathbb \def \mathbb #1{{\bf #1}} \fi" #
"\ifx \undefined \ocirc \def \ocirc #1{{\accent'27#1}} \fi" #
"\ifx \undefined \r \let \r = \ocirc \fi"
}
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|https://www.math.utah.edu/~beebe/|"}
@String{j-INT-J-FOUND-COMP-SCI = "International Journal of Foundations
of Computer Science (IJFCS)"}
@Article{Kenyon:1990:EBF,
author = "Claire Kenyon and Andrew C. Yao",
title = "On Evaluating {Boolean} Functions with Unreliable
Tests",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "1",
pages = "1--??",
month = mar,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:46 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Saoudi:1990:COT,
author = "A. Saoudi and D. E. Muller and P. E. Schupp",
title = "On the Complexity of omega-Tree Sets and {Nerode}
Theorem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "1",
pages = "11--??",
month = mar,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:46 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Subrahmanian:1990:RTBa,
author = "V. S. Subrahmanian",
title = "A Ring-Theoretic Basis for Logic Programming",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "1",
pages = "23--??",
month = mar,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:46 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Suchenek:1990:ALH,
author = "Marek A. Suchenek",
title = "Applications of {Lyndon} Homomorphism Theorems to the
Theory of Minimal Models",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "1",
pages = "49--??",
month = mar,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:46 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wan-Di:1990:PAP,
author = "Wei Wan-Di",
title = "On a Personnel Assignment Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "1",
pages = "61--??",
month = mar,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:46 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Preparata:1990:PPL,
author = "Franco P. Preparata",
title = "Planar Point Location Revisited",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "1",
pages = "71--??",
month = mar,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:46 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fachini:1990:SST,
author = "Emanuela Fachini and Jozef Gruska and Andrea Maggiolo
Schettini and others",
title = "Simulation of Systolic Tree Automata on Trellis
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "2",
pages = "87--??",
month = jun,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:46 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ausiello:1990:LPA,
author = "G. Ausiello and M. Protasi",
title = "Limiting Polynomial Approximation of Complexity
Classes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "2",
pages = "111--??",
month = jun,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:46 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{DeAgostino:1990:PRA,
author = "Sergio {De Agostino} and Rossella Petreschi",
title = "Parallel Recognition Algorithms for Graphs with
Restricted Neighbourhoods",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "2",
pages = "123--??",
month = jun,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:46 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Keqin:1990:GFF,
author = "Li Keqin and Cheng Kam-Hoi",
title = "Generalized First-Fit Algorithms in Two and Three
Dimensions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "2",
pages = "131--??",
month = jun,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:46 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Barbuti:1990:RNF,
author = "Roberto Barbuti and Maurizio Martelli",
title = "Recognizing Non-Floundering Logic Programs and Goals",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "2",
pages = "151--??",
month = jun,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:45 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Barbanera:1990:CTR,
author = "Franco Barbanera",
title = "Combining Term Rewriting and Type Assignment Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "165--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:45 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bovet:1990:DPC,
author = "Daniel P. Bovet and Miriam {Di Ianni} and Pierluigi
Crescenzi",
title = "Deadlock Prediction in the Case of Dynamic Routing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "185--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:45 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bruschi:1990:SSB,
author = "Danilo Bruschi and Deborah Joseph and Paul Young",
title = "Strong Separations for the {Boolean} Hierarchy over
{RP}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "201--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:45 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cherubini:1990:BDG,
author = "Alessandra Cherubini and Claudio Citrini and Stefano
Crespi Reghizzi and others",
title = "Breadth and Depth Grammars and Deque Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "219--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:45 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Costantini:1990:SMP,
author = "Stefania Costantini",
title = "Semantics of a Metalogic Programming Language",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "233--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:45 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Falaschi:1990:NGH,
author = "Moreno Falaschi and Maurizio Gabbrielli and Giorgio
Levi and others",
title = "Nested Guarded {Horn} Clauses",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "249--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:45 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Goldwurm:1990:SLD,
author = "Massimiliano Goldwurm",
title = "Some Limit Distributions in Analysis of Algorithms for
Problems on Trace Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "265--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:45 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gorrieri:1990:THD,
author = "Roberto Gorrieri and Ugo Montanari",
title = "Towards Hierarchical Description of Systems: a Proof
System for Strong Prefixing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "277--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:45 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gradel:1990:NLT,
author = "Erich Gradel",
title = "On the Notion of Linear Time Computability",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "295--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:44 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mignosi:1990:SWA,
author = "Filippo Mignosi",
title = "{Sturmian} Words and Ambiguous Context-Free
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "309--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:44 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Piperno:1990:RSE,
author = "Adolfo Piperno and Enrico Tronci",
title = "Regular Systems of Equations in lambda-Calculus",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "325--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:44 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rosolini:1990:AMS,
author = "G. Rosolini",
title = "About Modest Sets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "341--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:44 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bertoni:1990:I,
author = "A. Bertoni and C. Bohm and P. Miglioli",
title = "Introduction",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "3",
pages = "??--??",
month = sep,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:45 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{McNaughton:1990:DFL,
author = "Robert McNaughton",
title = "The Development of Formal Language Theory Since 1956",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "4",
pages = "355--??",
month = dec,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:44 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Farmer:1990:RCT,
author = "William M. Farmer and Ronald J. Watro",
title = "Redex Capturing in Term Graph Rewriting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "4",
pages = "369--??",
month = dec,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:44 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Comon:1990:SSO,
author = "Hubert Comon",
title = "Solving Symbolic Ordering Constraints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "4",
pages = "387--??",
month = dec,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:44 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Droste:1990:UIS,
author = "Manfred Droste and Rudiger Gobel",
title = "Universal Information Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "4",
pages = "413--??",
month = dec,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:44 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Katajainen:1990:TCO,
author = "Jyrki Katajainen and Erkki Makinen",
title = "Tree Compression and Optimization with Applications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "4",
pages = "425--??",
month = dec,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:44 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Korah:1990:DOB,
author = "A. P. Korah and M. R. Kaimal",
title = "Dynamic Optimal Binary Search Tree",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "4",
pages = "449--??",
month = dec,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:44 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Subrahmanian:1990:RTBb,
author = "V. S. Subrahmanian",
title = "A Ring-Theoretic Basis for Logic Programming",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "1",
number = "4",
pages = "465--??",
month = dec,
year = "1990",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Abadi:1991:FIM,
author = "Martin Abadi and Benjamin Pierce and Gordon Plotkin",
title = "Faithful Ideal Models for Recursive Polymorphic
Types",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "1",
pages = "1--??",
month = mar,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wilmes:1991:FPS,
author = "Thomas Wilmes",
title = "Functional Production Systems Viewed as Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "1",
pages = "23--??",
month = mar,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bergstra:1991:UAS,
author = "J. A. Bergstra and S. Mauw and F. Wiedijk",
title = "Uniform Algebraic Specifications of Finite Sets with
Equality",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "1",
pages = "43--??",
month = mar,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jin-Yi:1991:PSC,
author = "Cai Jin-Yi and Merrick Furst",
title = "{PSPACE} Survives Constant-Width Bottlenecks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "1",
pages = "67--??",
month = mar,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zanko:1991:PCM,
author = "Viktoria Zanko",
title = "{{\#P}}-Completeness via Many-One Reductions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "1",
pages = "77--??",
month = mar,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Arvind:1991:EDG,
author = "V. Arvind and S. Biswas",
title = "Edge-Deletion Graph Problems with First-Order
Expressible Subgraph Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "2",
pages = "83--100",
month = jun,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Thanh:1991:RMD,
author = "Tung Nguyen Thanh",
title = "A Relational Model of Demonic Nondeterministic
Programs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "2",
pages = "101--132",
month = jun,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bodlaender:1991:CSC,
author = "Hans L. Bodlaender",
title = "On the Complexity of Some Coloring Games",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "2",
pages = "133--148",
month = jun,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hirokawa:1991:PTA,
author = "Sachio Hirokawa",
title = "Principal Type Assignment to Lambda Terms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "2",
pages = "149--162",
month = jun,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jiang:1991:SCM,
author = "Tao Jiang and Edward McDowell and B. Ravikumar",
title = "The Structure and Complexity of Minimal {NFA}'s over a
Unary Alphabet",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "2",
pages = "163--??",
month = jun,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Huynh:1991:EDC,
author = "Dung T. Huynh",
title = "Efficient Detectors and Constructors for Simple
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "3",
pages = "183--206",
month = sep,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:42 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhi-Zhong:1991:CCO,
author = "Chen Zhi-Zhong and Seinosuke Toda",
title = "On the Complexity of Computing Optimal Solutions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "3",
pages = "207--220",
month = sep,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:42 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Monti:1991:STB,
author = "A. Monti and D. Parente",
title = "Systolic Tree with Base Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "3",
pages = "221--236",
month = sep,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:42 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hemachandra:1991:LLR,
author = "Lane A. Hemachandra and Sanjay Jain",
title = "On the Limitations of Locally Robust Positive
Reductions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "3",
pages = "237--256",
month = sep,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:42 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Metivier:1991:SOF,
author = "Yves Metivier and Brigitte Rozoy",
title = "On the Star Operation in Free Partially Commutative
Monoids",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "3",
pages = "257--266",
month = sep,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:42 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tucker:1991:PSR,
author = "J. V. Tucker and J. I. Zucker",
title = "Projections of Semicomputable Relations on Abstract
Data Types",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "3",
pages = "267--??",
month = sep,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:42 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Marti-Oliet:1991:PNL,
author = "N. Marti-Oliet and J. Meseguer",
title = "From {Petri} Nets to Linear Logic through Categories:
a Survey",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "4",
pages = "297--400",
month = dec,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Inoue:1991:ATM,
author = "K. Inoue and A. Ito and I. Takanami",
title = "Alternating {Turing} Machines with Modified Accepting
Structure",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "4",
pages = "401--418",
month = dec,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Panti:1991:SNT,
author = "G. Panti",
title = "Solution of a Number Theoretic Problem Involving
Knowledge",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "2",
number = "4",
pages = "419--424",
month = dec,
year = "1991",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Olariu:1992:OPE,
author = "S. Olariu and J. L. Schwing and J. Zhang",
title = "Optimal Parallel Encoding and Decoding Algorithms for
Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "1",
pages = "1--10",
month = mar,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Agostino:1992:PCO,
author = "S. D. Agostino and R. Petreschi",
title = "On {PVsub} chunk Operations and Matrogenic Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "1",
pages = "11--20",
month = mar,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Saoudi:1992:PAI,
author = "A. Saoudi",
title = "Pushdown Automata on Infinite Trees and
Nondeterministic Context-Free Programs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "1",
pages = "21--40",
month = mar,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Campadelli:1992:LCL,
author = "P. Campadelli and A. Morpurgo",
title = "Learning Classes of Linearly Separable {Boolean}
Functions from Positive Examples",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "1",
pages = "41--54",
month = mar,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Luccio:1992:AIP,
author = "F. Luccio and A. Pietracaprina and G. Pucci",
title = "Analysis and Implementation of Parallel Uniform
Hashing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "1",
pages = "55--64",
month = mar,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hromkovic:1992:POW,
author = "J. Hromkovic and K. Inoue and B. Rovan and others",
title = "On the Power of One-Way Synchronized Alternating
Machines with Small Space",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "1",
pages = "65--80",
month = mar,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:43 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Marche:1992:WPA,
author = "C. Marche",
title = "The Word Problem of {ACD}-Ground Theories is
Undecidable",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "1",
pages = "81--92",
month = mar,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:42 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Case:1992:LLP,
author = "J. Case and S. Jain and A. Sharma",
title = "On Learning Limiting Programs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "1",
pages = "93--??",
month = mar,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:42 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lodaya:1992:TLC,
author = "K. Lodaya and R. Ramanujam and P. S. Thiagarajan",
title = "Temporal Logics for Communicating Sequential Agents:
{I}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "2",
pages = "117--160",
month = jun,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:42 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Stolboushkin:1992:CPP,
author = "A. P. Stolboushkin",
title = "On the Computing Power of Programs with Sets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "2",
pages = "161--180",
month = jun,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:42 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bertoni:1992:HGF,
author = "A. Bertoni and P. Massazza and N. Sabadini",
title = "Holonomic Generating Functions and Context Free
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "2",
pages = "181--192",
month = jun,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{vanderHoek:1992:MSI,
author = "W. van der Hoek and J.-J. Ch. Meyer",
title = "Making Some Issues of Implicit Knowledge Explicit",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "2",
pages = "193--224",
month = jun,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Oles:1992:WCM,
author = "F. J. Oles",
title = "When is a Category of Many-Sorted Algebras {Cartesian}
Closed?",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "2",
pages = "225--??",
month = jun,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Saoudi:1992:FSP,
author = "A. Saoudi and D. E. Muller and P. E. Schupp",
title = "Finite State Processes, {$Z$}-Temporal Logic and the
Monadic Theory of the Integers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "3",
pages = "233--244",
month = sep,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bloom:1992:IA,
author = "S. L. Bloom and Z. Esik",
title = "Iteration Algebras",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "3",
pages = "245--302",
month = sep,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Krishnan:1992:CTC,
author = "P. Krishnan",
title = "A Calculus of Timed Communicating Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "3",
pages = "303--322",
month = sep,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cheng:1992:RAD,
author = "Y. Cheng and F. K. Hwang and I. F. Akyildiz and
others",
title = "Routing Algorithms for Double Loop Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "3",
pages = "323--332",
month = sep,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pym:1992:UAL,
author = "D. Pym",
title = "A Unification Algorithm for the {lambdaPi}-Calculus",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "3",
pages = "333--378",
month = sep,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Antonelli:1992:CMP,
author = "S. Antonelli and S. Pelagatti",
title = "On the Complexity of the Mapping Problem for Massively
Parallel Architectures",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "3",
pages = "379--??",
month = sep,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Droste:1992:CAD,
author = "M. Droste",
title = "Concurrent Automata and Domains",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "4",
pages = "389--418",
month = dec,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Blanchet-Sadri:1992:DDG,
author = "F. Blanchet-Sadri",
title = "The Dot-Depth of a Generating Class of Aperiodic
Monoids is Computable",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "4",
pages = "419--442",
month = dec,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mukund:1992:PNS,
author = "M. Mukund",
title = "{Petri} Nets and Step Transition Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "4",
pages = "443--478",
month = dec,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ottmann:1992:UBT,
author = "T. Ottmann and D. Wood",
title = "Updating Binary Trees with Constant Linkage Cost",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "3",
number = "4",
pages = "479--502",
month = dec,
year = "1992",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dassow:1993:GBP,
author = "J. Dassow and G. P{\u{a}}un and A. Salomaa",
title = "Grammars Based on Patterns",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "1",
pages = "1--14",
month = mar,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Crescenzi:1993:AMD,
author = "P. Crescenzi and R. Silvestri",
title = "Average Measure, Descriptive Complexity and
Approximation of Maximization Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "1",
pages = "15--30",
month = mar,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Penczek:1993:TLT,
author = "W. Penczek",
title = "Temporal Logics for Trace Systems: On Automated
Verification",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "1",
pages = "31--68",
month = mar,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kirschenhofer:1993:MDS,
author = "P. Kirschenhofer and H. Prodinger and W. Szpankowski",
title = "Multidimensional Digital Searching and Some New
Parameters in Tries",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "1",
pages = "69--84",
month = mar,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Moffat:1993:HS,
author = "A. Moffat and O. Petersson",
title = "Historical Searching",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "1",
pages = "85--98",
month = mar,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bloom:1993:IA,
author = "S. L. Bloom and Z. Esik",
title = "Iteration Algebras",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "1",
pages = "99--??",
month = mar,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nakano:1993:SFT,
author = "S.-I. Nakano and T. Nishizeki",
title = "Scheduling File Transfers Under Port and Channel
Constraints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "2",
pages = "101--116",
month = jun,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:41 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Stewart:1993:TAA,
author = "I. A. Stewart",
title = "On Two Approximation Algorithms for the Clique
Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "2",
pages = "117--134",
month = jun,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:40 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:1993:ETW,
author = "O. H. Ibarra and T. Jiang and N. Tran and others",
title = "On the Equivalence of Two-Way Pushdown Automata and
Counter Machines Over Bounded Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "2",
pages = "135--146",
month = jun,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:40 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dickerson:1993:GPD,
author = "M. T. Dickerson",
title = "General Polynomial Decomposition and the
$s$-$1$-Decomposition are {NP}-Hard",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "2",
pages = "147--156",
month = jun,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:40 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lange:1993:LRL,
author = "S. Lange and T. Zeugmann",
title = "Learning Recursive Languages With a Bounded Number of
Mind Changes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "2",
pages = "157--178",
month = jun,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:40 MST 2002",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/z/zeugmann-thomas-u.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
xxtitle = "Learning Recursive Languages with Bounded Mind
Changes",
}
@Article{Diks:1993:PAF,
author = "K. Diks and O. Garrido and A. Lingas",
title = "Parallel Algorithms for Finding Maximal $k$-Dependent
Sets and Maximal $f$-Matchings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "2",
pages = "179--??",
month = jun,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:40 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Olariu:1993:NCU,
author = "S. Olariu and I. A. Stewart",
title = "A New Characterization of Unbreakable Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "3",
pages = "193--196",
month = sep,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:40 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kamareddine:1993:SES,
author = "F. Kamareddine and R. Nederpelt",
title = "On Stepwise Explicit Substitution",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "3",
pages = "197--240",
month = sep,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:40 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lisitsa:1993:CUC,
author = "A. P. Lisitsa",
title = "Complexity of Universal Circumscription",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "3",
pages = "241--244",
month = sep,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:40 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hemaspaandra:1993:BRT,
author = "L. A. Hemaspaandra and S. Jain and N. K.
Vereshchagin",
title = "Banishing Robust {Turing} Completeness",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "3",
pages = "245--266",
month = sep,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:40 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Melnikov:1993:ECI,
author = "B. F. Melnikov",
title = "The Equality Condition for Infinite Catenations of Two
Sets of Finite Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "3",
pages = "267--??",
month = sep,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:40 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jansen:1993:SIJ,
author = "K. Jansen",
title = "Scheduling of Incompatible Jobs on Unrelated
Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "4",
pages = "275--292",
month = dec,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:39 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Vollmer:1993:CFM,
author = "H. Vollmer and K. W. Wagner",
title = "The Complexity of Finding Middle Elements",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "4",
pages = "293--308",
month = dec,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:39 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lai:1993:TUA,
author = "T. W. Lai and D. Wood",
title = "A Top-Down Updating Algorithm for Weight-Balanced
Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "4",
pages = "309--324",
month = dec,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:39 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Symvonis:1993:SPS,
author = "A. Symvonis and S. Tragoudas",
title = "Searching a Pseudo $3$-Sided Solid Orthoconvex Grid",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "4",
pages = "325--354",
month = dec,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:39 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Vincent:1993:RJF,
author = "M. W. Vincent and B. Srinivasan",
title = "Redundancy and the Justification for Fourth Normal
Form in Relational Databases",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "4",
number = "4",
pages = "355--366",
month = dec,
year = "1993",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:39 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cai:1994:CJN,
author = "J.-Y. Cai",
title = "Computing {Jordan Normal Forms} Exactly for Commuting
Matrices in Polynomial Time",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "5",
number = "3/4",
pages = "??--??",
year = "1994",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:39 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Duris:1994:CDR,
author = "P. Duris and J. D. P. Rolim",
title = "Conjunctive and Disjunctive Reducibilities to Sparse
and Tally Sets Revisited",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "5",
number = "3/4",
pages = "??--??",
year = "1994",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Leiberherr:1994:CAS,
author = "K. L. Leiberherr and C. Xiao",
title = "Customizing Adaptive Software to Object-Oriented
Software Using Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "5",
number = "3/4",
pages = "??--??",
year = "1994",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Leung:1994:HMN,
author = "J. Y.-T. Leung and V. K. M. Yu",
title = "Heuristic for Minimizing the Number of Late Jobs on
Two Processors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "5",
number = "3/4",
pages = "??--??",
year = "1994",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:39 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Maelbrancke:1994:DTR,
author = "R. Maelbrancke and H. Olivie",
title = "Dynamic Tree Rebalancing Using Recurrent Rotations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "5",
number = "3/4",
pages = "??--??",
year = "1994",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:39 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ogihara:1994:SL,
author = "M. Ogihara",
title = "On Serializable Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "5",
number = "3/4",
pages = "??--??",
year = "1994",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Trahan:1994:API,
author = "J. L. Trahan and S. Vedantham",
title = "Analysis of {PRAM} Instruction Sets from a Log Cost
Perspective",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "5",
number = "3/4",
pages = "??--??",
year = "1994",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:39 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yen:1994:SCR,
author = "H.-C. Yen and B.-Y. Wang and M.-S. Yang",
title = "Some Complexity Results for Rings of {Petri} Nets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "5",
number = "3/4",
pages = "??--??",
year = "1994",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:39 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Baeza-Yates:1995:HOA,
author = "R. A. Baeza-Yates and P. V. Poblete",
title = "Higher-Order Analysis of $2$-$3$ Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "1",
pages = "1--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Musikaev:1995:FBP,
author = "I. K. Musikaev and M. A. Taitslin",
title = "Flat Backtracking {Prolog} for Databases: a Formal
Semantics, the Computational Complexity and the
Expressibility",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "1",
pages = "11--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hintikka:1995:WLP,
author = "J. Hintikka and G. Sandu",
title = "What is the Logic of Parallel Processing?",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "1",
pages = "27--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Monserrat:1995:WCM,
author = "M. Monserrat and F. Rossello and J. Torrens",
title = "When is a Category of Many-Sorted Partial Algebras
{Cartesian}-Closed?",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "1",
pages = "51--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Haralambides:1995:BOS,
author = "J. Haralambides and S. Tragoudas",
title = "Bipartitioning into Overlapping Sets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "1",
pages = "67--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jain:1995:ICF,
author = "S. Jain",
title = "An Infinite Class of Functions Identifiable Using
Minimal Programs in All {Kolmogorov} Numberings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "1",
pages = "89--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bloom:1995:SEL,
author = "S. L. Bloom and Z. Esik",
title = "Some Equational Laws of Initiality in {2CCC}'s",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "2",
pages = "95--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Besnard:1995:ETB,
author = "P. Besnard and J. Kohlas",
title = "Evidence Theory Based on General Consequence
Relations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "2",
pages = "119--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Arvind:1995:HIP,
author = "V. Arvind and J. Koebler and R. Schuler",
title = "On Helping and Interactive Proof Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "2",
pages = "137--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Clementi:1995:OSP,
author = "A. Clementi and M. {Di Ianni}",
title = "Optimum Schedule Problems in Store and Forward
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "2",
pages = "155--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Peng:1995:NTP,
author = "W. Peng and S. P. Iyer",
title = "A New Type of Pushdown Automata on Infinite Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "2",
pages = "169--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hayashi:1995:NFF,
author = "S. Hayashi and S. Kobayashi",
title = "A New Formalization of {Feferman}'s System of
Functions and Classes and Its Relation to {Frege}
Structure",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "3",
pages = "187--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kameyama:1995:TFT,
author = "Y. Kameyama",
title = "A Type-Free Theory of Half-Monotone Inductive
Definitions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "3",
pages = "203--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Smith:1995:HPT,
author = "S. F. Smith",
title = "Hybrid Partial-Total Type Theory",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "3",
pages = "235--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mason:1995:RAO,
author = "I. Mason and C. Talcott",
title = "Reasoning About Object Systems in {VTLoE}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "3",
pages = "265--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Beeson:1995:UNA,
author = "M. Beeson",
title = "Using Nonstandard Analysis to Ensure the Correctness
of Symbolic Computations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "3",
pages = "299--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Szwast:1995:NAP,
author = "W. Szwast",
title = "A Note on the Asymptotic Probabilities of Existential
Second-Order Minimal {Goedel} Sentences with Equality",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "4",
pages = "339--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Castellani:1995:ODP,
author = "I. Castellani",
title = "Observing Distribution in Processes: Static and
Dynamic Localities",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "4",
pages = "353--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:37 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dubacq:1995:HST,
author = "J.-C. Dubacq",
title = "How to Simulate {Turing} Machines by Invertible
One-Dimensional Cellular Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "4",
pages = "395--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:37 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hemaspaandra:1995:NSS,
author = "L. A. Hemaspaandra and A. Hoene and A. V. Naik and
others",
title = "Nondeterministically Selective Sets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "4",
pages = "403--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:37 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Raja:1995:QBC,
author = "N. Raja and R. K. Shyamasundar",
title = "The {Quine-Bernays} Combinatory Calculus",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "4",
pages = "417--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:37 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Slobodova:1995:POW,
author = "A. Slobodova",
title = "On the Power of One-Way Globally Deterministic
Synchronized Alternating {Turing} Machines and
Multihead Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "6",
number = "4",
pages = "431--??",
year = "1995",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:37 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sankoff:1996:SPS,
author = "D. Sankoff and G. Sundaram and J. Kececioglu",
title = "{Steiner} Points in the Space of Genome
Rearrangements",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "1",
pages = "1--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:37 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Agarwala:1996:SAP,
author = "R. Agarwala and D. Fernandez-Baca",
title = "Simple-Algorithms for Perfect Phylogeny and
Triangulating Colored Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "1",
pages = "11--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:37 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fuerer:1996:AAE,
author = "M. Fuerer and W. Miller",
title = "Alignment-to-Alignment Editing with ``Move Gap''
Operations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "1",
pages = "23--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:37 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:1996:EDB,
author = "K.-Z. Zhang and J. T. L. Wang and D. Shasha",
title = "On the Editing Distance Between Undirected Acyclic
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "1",
pages = "43--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:37 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hanks:1996:FTV,
author = "L. Hanks and R. K. Cytron and W. Gillett",
title = "On Finding Topologically Valid Matchings in
Restriction-Fragment Maps",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "1",
pages = "59--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:37 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Duval:1996:CCS,
author = "A. M. Duval and W. F. Smyth",
title = "Covering a Circular String with Substrings of Fixed
Length",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "1",
pages = "87--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ripphausen-Lipa:1996:LTA,
author = "H. Ripphausen-Lipa and D. Wagner and K. Weihe",
title = "Linear-Time Algorithms for Disjoint Two-Face Paths
Problems in Planar Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "2",
pages = "95--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kloks:1996:TCG,
author = "T. Kloks",
title = "Treewidth of Circle Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "2",
pages = "111--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Das:1996:CDS,
author = "G. Das and P. J. Heffernan",
title = "Constructing Degree-$3$ Spanners with Other Sparseness
Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "2",
pages = "121--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fleischer:1996:SBS,
author = "R. Fleischer",
title = "A Simple Balanced Search Tree with {O(1)} Worst-Case
Update Time",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "2",
pages = "137--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ruohonen:1996:ECP,
author = "K. Ruohonen",
title = "An Effective {Cauchy-Peano} Existence Theorem for
Unique Solutions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "2",
pages = "151--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Greenlaw:1996:SID,
author = "R. Greenlaw",
title = "Subtree Isomorphism is in {DLOG} for Nested Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "2",
pages = "161--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Larsen:1996:ERB,
author = "K. S. Larsen and R. Fagerberg",
title = "Efficient Rebalancing of {B}-Trees with Relaxed
Balance",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "2",
pages = "169--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Viksna:1996:IIL,
author = "J. Viksna",
title = "Inductive Inference of Limiting Programs with Bounded
Number of Mind Changes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "3",
pages = "187--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Orlandic:1996:SOT,
author = "R. Orlandic and H. M. Mahmoud",
title = "Storage Overhead of {O}-Trees, {B}-Trees and Prefix
{B}-Trees: a Comparative Analysis",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "3",
pages = "209--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chen:1996:OOR,
author = "L. Chen and R. Schott",
title = "Optimal Operations on Red-Black Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "3",
pages = "227--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Caporaso:1996:STM,
author = "S. Caporaso",
title = "Safe {Turing} Machines, {Grzegorczyk} Classes and
Polytime",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "3",
pages = "241--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Breveglieri:1996:MPL,
author = "L. Breveglieri and A. Cherubini and C. Citrini and
others",
title = "Multi-Push-Down Languages and Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "3",
pages = "253--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Prodinger:1996:DPL,
author = "H. Prodinger",
title = "Depth and Path Length of Heap Ordered Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "3",
pages = "293--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wong:1996:AFM,
author = "P.-K. Wong",
title = "An Algorithm for Finding a Maximum Cycle of Bipartite
Graphs with Large Degrees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "4",
pages = "301--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kobayashi:1996:FNL,
author = "S. Kobayashi and T. Yokomori",
title = "Families of Noncounting Languages and Their
Learnability from Positive Data",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "4",
pages = "309--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Macarie:1996:NMF,
author = "I. I. Macarie",
title = "A Note of Multihead Finite-State Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "4",
pages = "329--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Agrawal:1996:ICD,
author = "M. Agrawal and S. Venkatesh",
title = "On the Isomorphism Conjecture for {$2$-DFA}
Reductions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "4",
pages = "339--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Klostermeyer:1996:STS,
author = "W. F. Klostermeyer",
title = "Scheduling Two Salesmen in a Network",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "4",
pages = "353--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Plaza:1996:PSR,
author = "J. A. Plaza",
title = "On the Propositional {SLDNF}-Resolution",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "7",
number = "4",
pages = "359--??",
year = "1996",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:36 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mateescu:1997:GTL,
author = "Alexandru Mateescu and Grzegorz Rozenberg and Arto
Salomaa",
title = "Geometric Transformations of Language Families: {The}
Power of Symmetry",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "1",
pages = "1--??",
month = mar,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:45 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Smith:1997:CPL,
author = "Carl H. Smith and Rolf Wiehagen and Thomas Zeugmann",
title = "Classifying Predicates and Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "1",
pages = "15--41",
month = mar,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:45 MST 2004",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/z/zeugmann-thomas-u.bib;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Finta:1997:CTG,
author = "Lucian Finta and Zhen Liu",
title = "Complexity of Task Graph Scheduling with Fixed
Communication Capacity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "1",
pages = "43--??",
month = mar,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:45 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dumitrescu:1997:PLV,
author = "Sorina Dumitrescu and Georghe P{\u{a}}un and Arto
Salomaa",
title = "Pattern Languages Versus Parallel Communicating
Grammar Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "1",
pages = "67--??",
month = mar,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:45 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:1997:CCA,
author = "Oscar H. Ibarra and Pedro C. Diniz and Martin C.
Rinard",
title = "On the Complexity of Commutativity Analysis",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "1",
pages = "81--??",
month = mar,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:45 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hemaspaandra:1997:LRM,
author = "Lane A. Hemaspaandra and Zhigen Jiang",
title = "Logspace Reducibility: Models and Equivalences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "1",
pages = "95--??",
month = mar,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:45 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bermond:1997:NDM,
author = "Jean-Claude Bermond and H. A. Harutyunyan and A. L.
Liestman and others",
title = "A Note on the Dimensionality of Modified {Kn{\"o}del}
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "2",
pages = "109--??",
month = jun,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kranakis:1997:HCT,
author = "Evangelos Kranakis and Danny Krizanc and Andrzej
Pelc",
title = "Hop-Congestion Trade-Offs for High-Speed Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "2",
pages = "117--??",
month = jun,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hu:1997:FTS,
author = "Shuo-Cheng Hu and Chang-Biau Yang",
title = "Fault Tolerance on Star Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "2",
pages = "127--??",
month = jun,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Berthome:1997:CIP,
author = "Pascal Berthom{\'e} and Afonso Ferreira",
title = "Communication Issues in Parallel Systems with Optical
Interconnections",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "2",
pages = "143--??",
month = jun,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Das:1997:ECF,
author = "Sajal K. Das and Dirk H. Hohndel and Maximilian Ibel
and Sabine R. {\"O}hring",
title = "Efficient Communication in Folded {Petersen}
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "2",
pages = "163--??",
month = jun,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wu:1997:MCN,
author = "Jie Wu and Haifeng Qian",
title = "Multitriangle: a Constant Node Degree Interconnection
Network",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "2",
pages = "187--??",
month = jun,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Calvin:1997:MOC,
author = "C. Calvin and L. Colombet and P. Michallon",
title = "Methods to Overlap Communications in Parallel
Numerical Algorithms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "2",
pages = "211--??",
month = jun,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dai:1997:CDS,
author = "H. K. Dai",
title = "The Complexity of Deciding Strictly Non-Blocking
Concentration and Generalized-Concentration
Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "3",
pages = "237--??",
month = sep,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Keum:1997:DAS,
author = "Young Wook Keum and Hwakyung Rim",
title = "Design and Analysis of the {Symmetric Banyan Network
(SBN)}: a Min with High Performance and High Fault
Tolerance",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "3",
pages = "253--??",
month = sep,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sibeyn:1997:RTT,
author = "Jop F. Sibeyn",
title = "Routing on Triangles, Tori and Honeycombs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "3",
pages = "269--??",
month = sep,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Baumslag:1997:ISG,
author = "Marc Baumslag and Bojana Obrenic",
title = "Index-Shuffle Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "3",
pages = "289--??",
month = sep,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jia:1997:TLN,
author = "Xingde Jia and Weidong Su",
title = "Triple Loop Networks with Minimal Transmission Delay",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "3",
pages = "305--??",
month = sep,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Heirich:1997:SDA,
author = "A. Heirich",
title = "A Scalable Diffusion Algorithm for Dynamic Mapping and
Load Balancing on Networks of Arbitrary Topology",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "3",
pages = "329--??",
month = sep,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Monien:1997:CLS,
author = "Burkhard Monien and Ralf Diekmann and Reinhard
L{\"u}ling",
title = "The Construction of Large Scale Reconfigurable
Parallel Computing Systems (The Architecture of the
{SC320})",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "3",
pages = "347--??",
month = sep,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Krishnan:1997:PAA,
author = "Padmanabhan Krishnan",
title = "A Process Algebraic Approach to Time Granularity
Semantics",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "4",
pages = "363--??",
month = dec,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Basten:1997:PPO,
author = "Twan Basten",
title = "Parsing Partially Ordered Multisets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "4",
pages = "379--??",
month = dec,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Changizi:1997:LNI,
author = "Mark A. Changizi",
title = "Learning with Natural Imprecision",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "4",
pages = "409--??",
month = dec,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Martin:1997:ETA,
author = "Bruno Martin",
title = "Embedding Torus Automata into a Ring of Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "4",
pages = "425--??",
month = dec,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Arvind:1997:CMP,
author = "V. Arvind",
title = "Constructivizing Membership Proofs in Complexity
Classes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "4",
pages = "433--??",
month = dec,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Manacher:1997:FMC,
author = "Glenn K. Manacher and Terrance A. Mankus",
title = "Finding a Maximum Clique in a Set of Proper Circular
Arcs in Time {$ O(n) $} with Applications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "4",
pages = "443--??",
month = dec,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:1997:AIV,
author = "Anonymous",
title = "Author Index Volume 8 (1997)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "8",
number = "4",
pages = "469--??",
month = dec,
year = "1997",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hsu:1998:SII,
author = "D. Frank Hsu",
title = "Special Issue on Interconnection Networks ---
{Editors}' Foreword",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "1",
pages = "1--??",
month = mar,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Okawa:1998:PGN,
author = "Satoshi Okawa",
title = "The Permutational Graph: a New Network Topology",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "1",
pages = "3--??",
month = mar,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nochefranca:1998:DHC,
author = "Luz R. Nochefranca",
title = "The diameter and {Hamiltonian} cycle of the
generalized {de Bruijn} graphs {$ \mbox {UG}_b(n, n(n +
1)) $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "1",
pages = "13--??",
month = mar,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nochefrance:1998:DHC,
author = "L. R. Nochefrance and P. W. Sy",
title = "The Diameter and {Hamiltonian} Cycle of the
Generalized {de Bruijn} Graphs {UGB$ (n, n(n + 1)) $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "1",
pages = "13--??",
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:34 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cortina:1998:CRI,
author = "Thomas J. Cortina and Zhi-Wei Xu",
title = "The Cube-Of-Rings Interconnection Network",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "1",
pages = "25--??",
month = mar,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Banerjee:1998:DSC,
author = "Ayan Banerjee and Emmanouel (Manos) Varvarigos",
title = "A Dynamic Scheduling Communication Protocol and Its
Analysis for Hypercube Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "1",
pages = "39--??",
month = mar,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Liestman:1998:NPD,
author = "A. L. Liestman and J. Opatrny and M. Zaragoza",
title = "Network Properties of Double and Triple Fixed Step
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "1",
pages = "57--??",
month = mar,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chen:1998:SRN,
author = "Guihai Chen and Francis C. M. Lau",
title = "Shuffle-Ring: a New Constant-Degree Network",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "1",
pages = "77--??",
month = mar,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pavel:1998:ISR,
author = "Sandy Pavel and Selim G. Akl",
title = "Integer Sorting and Routing in Arrays with
Reconfigurable Optical Buses",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "1",
pages = "99--??",
month = mar,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:46 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Grammatikakis:1998:CRP,
author = "Miltos D. Grammatikakis and Eric Fleury and Miro
Kraetzl",
title = "Continuous Routing in Packet Switches",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "2",
pages = "121--??",
month = jun,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Garcia:1998:SOR,
author = "Roman Garcia and Jose Duato",
title = "Suboptimal-Optimal Routing for {LAN} Internetworking
Using Transparent Bridges",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "2",
pages = "139--??",
month = jun,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Petrini:1998:PAW,
author = "Fabrizio Petrini and Marco Vanneschi",
title = "Performance Analysis of Wormhole Routed {$K$}-Ary
{$N$}-Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "2",
pages = "157--??",
month = jun,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Flocchini:1998:TCS,
author = "Paola Flocchini and Nicola Santoro",
title = "Topological Constraints for Sense of Direction",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "2",
pages = "179--??",
month = jun,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rajasekaran:1998:PRS,
author = "Sanguthevar Rajasekaran and Theodore McKendall",
title = "Permutation Routing and Sorting on the Reconfigurable
Mesh",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "2",
pages = "199--??",
month = jun,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Diderich:1998:EDO,
author = "Claude G. Diderich and Marc Gengler",
title = "An Extended Dimension Order Token Distribution
Algorithm on $k$-Ary $d$-Cubes and Its Complexity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "2",
pages = "213--??",
month = jun,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chiang:1998:TPS,
author = "Wei-Kuo Chiang and Rong-Jaye Chen",
title = "Topological Properties of the $ (n, k)$-Star Graph",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "2",
pages = "235--??",
month = jun,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{LeVerge:1998:NRC,
author = "Herv{\'e} {Le Verge} and Yannic Saouter",
title = "New Results on Computability of Recurrence Equations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "3",
pages = "249--??",
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:32 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Burtschick:1998:LQL,
author = "Hans-J{\"o}rg Burtschick and H. Vollmer",
title = "{Lindstr{\"o}m} Quantifiers and Leaf Language
Definability",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "3",
pages = "277--??",
month = sep,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Droste:1998:RLD,
author = "Manfred Droste and Dietrich Kuske",
title = "Recognizable and Logically Definable Languages of
Infinite Computations In Concurrent Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "3",
pages = "295--??",
month = sep,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jain:1998:MCI,
author = "Sanjay Jain",
title = "Minimal Concept Identification and Reliability",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "3",
pages = "315--??",
month = sep,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kamareddine:1998:SES,
author = "Fairouz Kamareddine",
title = "The Soundness of Explicit Substitution with Nameless
Variables",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "3",
pages = "321--??",
month = sep,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cappello:1998:PLB,
author = "Peter Cappello and {\"O}mer Egecio{\u{g}}lu",
title = "Processor Lower Bound Formulas for Array Computations
and Parametric {Diophantine} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "4",
pages = "351--??",
month = dec,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Paik:1998:VSD,
author = "Doowon Paik and Sudhakar Reddy and Sartaj Sahni",
title = "Vertex Splitting in {DAGs} and Applications to Partial
Scan Designs and Lossy Circuits",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "4",
pages = "377--??",
month = dec,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Larsen:1998:SOP,
author = "Kim S. Larsen",
title = "Sort Order Problems in Relational Databases",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "4",
pages = "399--??",
month = dec,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sellink:1998:CLE,
author = "M. P. A. Sellink",
title = "On the Conservativity of {Leibniz} Equality",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "4",
pages = "431--??",
month = dec,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:1998:AIV,
author = "Anonymous",
title = "Author Index Volume 9 (1998)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "9",
number = "4",
pages = "455--??",
month = dec,
year = "1998",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:47 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cho:1999:MDE,
author = "S. Cho and S. Sahni",
title = "Mergeable Double-Ended Priority Queues",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "1",
pages = "1--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sajith:1999:PVC,
author = "G. Sajith and S. Saxena",
title = "Parallel Vertex Colouring of Interval Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "1",
pages = "19--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Karaata:1999:SSA,
author = "M. H. Karaata",
title = "A Self-Stabilizing Algorithm for Finding Articulation
Points",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "1",
pages = "33--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chung:1999:PMM,
author = "Y. Chung and K. Park and Y. Cho",
title = "Parallel Maximum Matching Algorithms in Interval
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "1",
pages = "47--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dassow:1999:LDM,
author = "J. Dassow and H. Fernau and G. P{\u{a}}un",
title = "On the Leftmost Derivation in Matrix Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "1",
pages = "61--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sarac:1999:DTS,
author = "K. Sara{\c{c}} and {\"O}. Egecio{\u{g}}lu and A. {El
Abbadi}",
title = "{DFT} Techniques for Size Estimation of Database Join
Operations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "1",
pages = "81--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Roussel:1999:GLN,
author = "F. Roussel and I. Rusu and H. Thuillier",
title = "On Graphs with Limited Number of {$ P_4 $}-Partners",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "1",
pages = "103--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nakano:1999:GEI,
author = "K. Nakano and S. Olariu",
title = "{Guest Editors}' Introduction",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "2",
pages = "123--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Roussel:1999:HDM,
author = "Florian Roussel and Irena Rusu",
title = "Holes and Dominoes in {Meyniel} Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "2",
pages = "127--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Habib:1999:PRT,
author = "M. Habib and C. Paul and L. Viennot",
title = "Partition Refinement Techniques: An Interesting
Algorithmic Tool Kit",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "2",
pages = "147--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Isobe:1999:PTA,
author = "S. Isobe and X. Zhou and T. Nishizeki",
title = "A Polynomial-Time Algorithm for Finding Total
Colorings of Partial $k$-Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "2",
pages = "171--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Miura:1999:LTA,
author = "K. Miura and D. Takahashi and S. I. Nakano and T.
Nishizeki",
title = "A Linear-Time Algorithm to Find Four Independent
Spanning Trees in Four Connected Planar Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "2",
pages = "195--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tse:1999:CSA,
author = "S. S. H. Tse and F. C. M. Lau",
title = "On the Complexity of Some Adaptive Polling Algorithms
in General Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "2",
pages = "211--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holzrichter:1999:GBD,
author = "M. Holzrichter and S. Oliveira",
title = "A Graph Based {Davidson} Algorithm for the Graph
Partitioning Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "2",
pages = "223--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{DeQueirosVieiraMartins:1999:DAR,
author = "E. {De Queiros Vieira Martins} and M. M. B. Pascoal
and J. L. E. Dos Santos",
title = "Deviation Algorithms for Ranking Shortest Paths",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "3",
pages = "247--262",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:31 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Martins:1999:DAR,
author = "E. D. Q. V. Martins and M. M. B. Pascoal and J. L. E.
D. Santos",
title = "Deviation Algorithms for Ranking Shortest Paths",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "3",
pages = "247--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hemaspaandra:1999:SSM,
author = "L. A. Hemaspaandra and H. Hempel and G. Wechsung",
title = "Self-Specifying Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "3",
pages = "263--276",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Calamoneri:1999:OLT,
author = "T. Calamoneri and R. Petreschi",
title = "Optimal Layout of Trivalent {Cayley} Interconnection
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "3",
pages = "277--288",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Azizoglu:1999:IND,
author = "M. C. Azizoglu and {\"O}. E{\u{g}}ecio{\u{g}}lu",
title = "The Isoperimetric Number of $d$-Dimensional $k$-Ary
Arrays",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "3",
pages = "289--300",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Larsen:1999:GRA,
author = "K. S. Larsen",
title = "On Grouping in Relational Algebra",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "3",
pages = "301--312",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Krings:1999:RTD,
author = "A. W. Krings and M. Dror",
title = "Real-Time Dispatching: Scheduling Stability and
Precedence",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "3",
pages = "313--328",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Makowsky:1999:CWG,
author = "J. A. Makowsky and U. Rotics",
title = "On the Clique-Width of Graphs with Few {$ P_4 $}'s",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "3",
pages = "329--348",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Greco:1999:GAO,
author = "S. Greco and D. Sacc{\`a} and C. Zaniolo",
title = "Grammars and Automata to Optimize Chain Logic
Queries",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "3",
pages = "349--372",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:48 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Andresen:1999:P,
author = "D. Andresen and T. Yang",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "373--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mongelli:1999:PRM,
author = "H. Mongelli and S. W. Song",
title = "Parallel Range Minima on Coarse Grained
Multicomputers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "375--390",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:30 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mongelli:1999:PI,
author = "H. Mongelli and S. W. Song",
title = "Part 1 {(Irregular '99)}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "375--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Herley:1999:DBB,
author = "K. T. Herley and A. Pietracaprina and G. Pucci",
title = "Deterministic Branch-and-Bound on Distributed Memory
Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "391--404",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Boeres:1999:CBT,
author = "C. Boeres and A. Nascimento and V. E. F. Rebello",
title = "Cluster-Based Task Scheduling for the {{\em LogP\/}}
Model",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "405--424",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Voisin:1999:SCP,
author = "F. Voisin and G. R. Perrin",
title = "Sparse Computation with {PEI}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "425--442",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Krithivasan:1999:DPA,
author = "K. Krithivasan and M. S. Balan and P. Harsha",
title = "Distributed Processing in Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "443--464",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:30 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Krithivasan:1999:PRP,
author = "K. Krithivasan and N. S. Balan and P. Harsha",
title = "Part 2 (Regular Papers)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "443--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sprague:1999:QTA,
author = "A. P. Sprague and T. Takaoka",
title = "{$ O(1) $} Query Time Algorithm for All Pairs Shortest
Distances on Interval Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "465--472",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Uehara:1999:MLF,
author = "R. Uehara",
title = "A Measure for the {Lexicographically First Maximal
Independent Set Problem} and its Limits",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "473--482",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Okadome:1999:SFL,
author = "T. Okadome",
title = "Simple Flat Languages: a Learnable Class in the Limit
from Positive Data",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "483--502",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gasieniec:1999:MCL,
author = "L. G{\k{a}}sieniec and E. Kranakis and D. Krizanc and
A. Pelc",
title = "Minimizing Congestion of Layouts for {ATM} Networks
with Faulty Links",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "503--512",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fouquet:1999:BGT,
author = "J. L. Fouquet and V. Giakoumakis and J. M. Vanherpe",
title = "Bipartite Graphs Totally Decomposable by Canonical
Decomposition",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "513--534",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Beigel:1999:NPR,
author = "R. Beigel and A. Bernasconi",
title = "A Note on the Polynomial Representation of {Boolean}
Functions Over {$ \mbox {GF}(2) $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "535--542",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:1999:AI,
author = "Anonymous",
title = "Author Index",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "10",
number = "4",
pages = "545--??",
year = "1999",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hsiang:2000:SIA,
author = "J. Hsiang and A. Ohori",
title = "Special Issue on {Advances in Computing Science ---
Asian '98}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "1",
pages = "1--??",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ganzinger:2000:RRN,
author = "H. Ganzinger and F. Jacquemard and M. Veanes",
title = "Rigid Reachability, The Non-Symmetric Form of Rigid
{E}-Unification",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "1",
pages = "3--28",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:29 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ganzinger:2000:PA,
author = "H. Ganzinger and F. Jacquemard and M. Veanes",
title = "Part 1 ({Asian '98})",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "1",
pages = "3--??",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Muller:2000:TIF,
author = "M. M{\"u}ller and S. Nishimura",
title = "Type Inference for First-Class Messages with Feature
Constraints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "1",
pages = "29--64",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hashimoto:2000:FCC,
author = "M. Hashimoto",
title = "First-Class Contexts in {ML}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "1",
pages = "65--88",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ogata:2000:CCL,
author = "I. Ogata",
title = "Constructive Classical Logic as {CPS}-Calculus",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "1",
pages = "89--112",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Roversi:2000:LAL,
author = "L. Roversi",
title = "Light Affine Logic as a Programming Language: a First
Contribution",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "1",
pages = "113--152",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yang:2000:GMC,
author = "Z.-H. Yang and C.-Z. Sun and Y. Miao and A. Sattar and
Y. Y. Yang",
title = "Guaranteed Mutually Consistent Checkpointing in
Distributed Computations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "1",
pages = "153--166",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:29 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yang:2000:PRP,
author = "Z.-H. Yang and C.-Z. Sun and Y. Miao and A. Sattar and
Y. Y. Yang",
title = "Part 2 (Regular Papers)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "1",
pages = "153--??",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Paun:2000:CMS,
author = "G. P{\u{a}}un",
title = "Computing with Membranes ({$P$} Systems): a Variant",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "1",
pages = "167--182",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rosenberg:2000:GDP,
author = "A. L. Rosenberg",
title = "Guidelines for Data-Parallel Cycle-Stealing in
Networks of Workstations {II}: On Maximizing Guaranteed
Output",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "1",
pages = "183--204",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rajasekaran:2000:SIR,
author = "S. Rajasekaran and S. K. Sahni",
title = "Special Issue on Randomized Computing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "2",
pages = "205--206",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2000:MEE,
author = "K. Li",
title = "A Method for Evaluating the Expected Load of Dynamic
Tree Embeddings in Hypercubes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "2",
pages = "207--230",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:29 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2000:PRC,
author = "K. Li",
title = "Part 1 (Randomized Computing)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "2",
pages = "207--??",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mahapatra:2000:RSG,
author = "N. R. Mahapatra and S. Dutt",
title = "Random Seeking: a General, Efficient, and Informed
Randomized Scheme for Dynamic Load Balancing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "2",
pages = "231--246",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nikoletseas:2000:CPR,
author = "S. Nikoletseas and K. Palem and P. Spirakis and M.
Yung",
title = "Connectivity Properties in Random Regular Graphs with
Edge Faults",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "2",
pages = "247--262",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sun:2000:DRR,
author = "Hung-Min Sun",
title = "On the Dealer's Randomness Required in Perfect Secret
Sharing Schemes with Access Structures of Constant
Rank",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "2",
pages = "263--282",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shyamasundar:2000:LRS,
author = "R. K. Shyamasundar and S. Ramesh",
title = "Languages for Reactive Specifications: Synchrony Vs
Asynchrony",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "2",
pages = "283--314",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:29 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shyamasundar:2000:PRP,
author = "R. K. Shyamasundar and S. Ramesh",
title = "Part 2 (Regular Papers)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "2",
pages = "283--??",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hempel:2000:OMM,
author = "H. Hempel and G. Wechsung",
title = "The Operators {\tt min} and {\tt max} on the
Polynomial Hierarchy",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "2",
pages = "315--342",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zantema:2000:FSE,
author = "H. Zantema and H. L. Bodlaender",
title = "Finding Small Equivalent Decision Trees is Hard",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "2",
pages = "343--354",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Halldorsson:2000:MID,
author = "M. M. Halld{\'o}rsson and J. Kratochv{\'\i}l and J. A.
Telle",
title = "Mod-$2$ Independence and Domination in Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "3",
pages = "355--364",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Perkovic:2000:IAF,
author = "L. Perkovic and B. Reed",
title = "An Improved Algorithm for Finding Tree Decompositions
of Small Width",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "3",
pages = "365--372",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Johansson:2000:NDP,
author = "{\"O}. Johansson",
title = "{NLC$_2$}-Decomposition in Polynomial Time",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "3",
pages = "373--396",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Berry:2000:GAM,
author = "Anne Berry and Jean-Paul Bordat and Olivier Cogis",
title = "Generating All the Minimal Separators of a Graph",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "3",
pages = "397--404",
year = "2000",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054100000211",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Accornero:2000:AST,
author = "A. Accornero and M. Ancona and S. Varini",
title = "All Separating Triangles in a Plane Graph Can Be
Optimally ``Broken'' in Polynomial Time",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "3",
pages = "405--422",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Golumbic:2000:CWS,
author = "M. C. Golumbic and U. Rotics",
title = "On the Clique-Width of Some Perfect Graph Classes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "3",
pages = "423--444",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nishimura:2000:FSS,
author = "N. Nishimura and P. Ragde and D. M. Thilikos",
title = "Finding Smallest Supertrees Under Minor Containment",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "3",
pages = "445--466",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Liebers:2000:HRB,
author = "A. Liebers and D. Wagner and K. Weihe",
title = "On the Hardness of Recognizing Bundles in Time Table
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "3",
pages = "467--484",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cho:2000:NWB,
author = "S. Cho and S. Sahni",
title = "A New Weight Balanced Binary Search Tree",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "3",
pages = "485--514",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:28 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cho:2000:PRP,
author = "S. Cho and S. Sahni",
title = "Part 2 (Regular Papers)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "3",
pages = "485--??",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Okadome:2000:SSC,
author = "T. Okadome",
title = "Some Sufficient Conditions of Learnability in the
Limit From Positive Data",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "3",
pages = "515--524",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kosub:2000:UCC,
author = "S. Kosub and H. Schmitz and H. Vollmer",
title = "Uniform Characterizations of Complexity Classes of
Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "4",
pages = "525--552",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bourgeois:2000:RTD,
author = "A. G. Bourgeois and J. L. Trahan",
title = "Relating Two-Dimensional Reconfigurable Meshes with
Optically Pipelined Buses",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "4",
pages = "553--572",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dong:2000:SAA,
author = "G. Dong and L. Zhang",
title = "Separating Auxiliary Arity Hierarchy of First-Order
Incremental Evaluation Systems Using $ (3 k + 1)$-ary
Input Relations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "4",
pages = "573--578",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bonizzoni:2000:AMI,
author = "P. Bonizzoni and G. D. Vedova and G. Mauri",
title = "Approximating the Maximum Isomorphic Agreement Subtree
is Hard",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "4",
pages = "579--590",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{vanderMeyden:2000:PBL,
author = "R. van der Meyden",
title = "Predicate Boundedness of Linear Monadic Datalog is in
{PSPACE}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "4",
pages = "591--614",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kobler:2000:OSE,
author = "J. K{\"o}bler and W. Lindner",
title = "Oracles in {$ \Sigma^p_2 $} are Sufficient for Exact
Learning",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "4",
pages = "615--632",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Csuhaj-Varju:2000:PCP,
author = "E. Csuhaj-Varj{\'u} and C. Mart{\'\i}n-Vide and V.
Mitrana and G. Vaszil",
title = "Parallel Communicating Pushdown Automata Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "4",
pages = "633--650",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2000:AI,
author = "Anonymous",
title = "Author Index",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "4",
pages = "651--??",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2001:SIF,
author = "Anonymous",
title = "Special Issue on Functional and Logic Programming ---
Part 1",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "1",
pages = "1--??",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 07:11:39 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Preface:2001:SIF,
author = "Preface",
title = "Special Issue on Functional and Logic Programming ---
Part 1",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "1",
pages = "1--??",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Takahashi:2001:LRF,
author = "Masako Takahashi and M. Sato and Y. Toyama",
title = "Lambda-Representable Functions Over Term Algebras",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "1",
pages = "3--30 (or 3--29??)",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tsukada:2001:MLT,
author = "Yasuyuki Tsukada and M. Sato and Y. Toyama",
title = "{Martin-L{\"o}f}'s Type Theory as an Open-Ended
Framework",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "1",
pages = "31--67 (or 31--68??)",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
note = "See errata \cite{Tsukada:2001:EPM}.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Borovansky:2001:RSE,
author = "Peter Borovansk{\'y} and Claude Kirchner and
H{\'e}l{\`e}ne Kirchner and C. Ringeissen",
title = "Rewriting with Strategies in {ELAN}: a Functional
Semantics",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "1",
pages = "69--95 (or 69--96??)",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lederer:2001:ARV,
author = "Edgar F. A. Lederer and Romeo A. Dumitrescu",
title = "Automatic Result Verification by Complete Run-Time
Checking of Computations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "1",
pages = "97--124",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2001:P,
author = "Anonymous",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "1",
pages = "??--??",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:27 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hinze:2001:PCC,
author = "Ralf Hinze and M. Sato and Y. Toyama",
title = "{Prolog}'s Control Constructs in a Functional Setting
--- Axioms and Implementation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "2",
pages = "125--170",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:27 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hinze:2001:SIF,
author = "R. Hinze",
title = "Special Issue on Functional and Logic Programming ---
Part 2",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "2",
pages = "125--??",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Abramov:2001:SNS,
author = "Sergei Abramov and Robert Gl{\"u}ck",
title = "From Standard to Non-Standard Semantics by Semantics
Modifiers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "2",
pages = "171--211 (or 171--212??)",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sakurai:2001:CMC,
author = "Takafumi Sakurai",
title = "Categorical Model Construction for Proving Syntactic
Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "2",
pages = "213--244",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:50 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Palis:2001:SIP,
author = "Michael A. Palis",
title = "Special Issue on Parallel and Distributed Computing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "3",
pages = "245--247",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:23 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Palis:2001:PSP,
author = "M. A. Palis",
title = "Part 1 (Selected Papers From {ISPAN '99})",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "3",
pages = "245--??",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sahni:2001:MAO,
author = "Sartaj Sahni",
title = "Models and Algorithms for Optical and Optoelectronic
Parallel Computers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "3",
pages = "249--264",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{BarbosaDaSilva:2001:EPJ,
author = "Fabricio Alves {Barbosa Da Silva} and Isaac D.
Scherson",
title = "Efficient Parallel Job Scheduling Using Gang Service",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "3",
pages = "265--284",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fujimoto:2001:MPT,
author = "Noriyuki Fujimoto and Tomoki Baba and Takashi
Hashimoto and K. Hagihara",
title = "On Message Packaging in Task Scheduling for
Distributed Memory Parallel Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "3",
pages = "285--306",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shi:2001:LBH,
author = "Weisong Shi and Zhimin Tang",
title = "Load Balancing in Home-Based Software {DSMS}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "3",
pages = "307--324",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Touyama:2001:PEP,
author = "Takayoshi Touyama and Susumu Horiguchi",
title = "Performance Evaluation of Practical Parallel Computer
Model {LogPQ}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "3",
pages = "325--340",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Schopf:2001:USI,
author = "Jennifer M. Schopf and Francine Berman",
title = "Using Stochastic Information to Predict Application
Behavior on Contended Resources",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "3",
pages = "341--363 (or 341--364??)",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bui:2001:RMA,
author = "Marc Bui and Sajal K. Das and Ajoy K. Datta and D. T.
Nguyen",
title = "Randomized Mobile Agent Based Routing in Wireless
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "3",
pages = "365--384",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Elbl:2001:NDR,
author = "Birgit Elbl and Jiawen Su",
title = "A Non-Definability Result for a Predicational Language
with the Usual Control",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "3",
pages = "385--396",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:26 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Elbl:2001:PRP,
author = "B. Elbl",
title = "Part 2 (Regular Papers)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "3",
pages = "385--??",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Harvath:2001:CPP,
author = "G{\'e}za Harv{\'a}th and Katsushi Inoue and Akira Ito
and Y. Wang",
title = "Closure Property of Probabilistic {Turing} Machines
and Alternating {Turing} Machines with Sublogarithmic
Spaces",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "3",
pages = "397--409",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Roberts:2001:RNC,
author = "Alan Roberts and Antonios Symvonis",
title = "On the Routing Number of Complete $d$-ary Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "4",
pages = "411--434",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yamazaki:2001:CPP,
author = "Koich Yamazaki and Sei'ichi Tani and Tetsuro Nishino",
title = "A Characterization of $k$-th Powers {$ P_{n, k}$} of
Paths in Terms of $k$-Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "4",
pages = "435--443 (or 435--444??)",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wong:2001:AFL,
author = "Pak-Ken Wong",
title = "An Algorithm for Finding Longest Cycles in Certain
Bipartite Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "4",
pages = "445--454",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jacobsen:2001:VTR,
author = "Lars Jacobsen and Kim S. Larsen",
title = "Variants of {$ (A, B) $}-Trees with Relaxed Balance",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "4",
pages = "455--478",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Calude:2001:CMP,
author = "Christian S. Calude and Hajime Ishihara and Takeshi
Yamaguchi",
title = "Coding with Minimal Programs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "4",
pages = "479--489 (or 479--490??)",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sitharam:2001:DLB,
author = "M. Sitharam and Timothy Straney",
title = "Derandomized Learning of {Boolean} Functions over
Finite {Abelian} Groups",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "4",
pages = "491--516",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Verbitsky:2001:RQB,
author = "Oleg Verbitsky and Shafi Goldwasser",
title = "Remarks on a Query-Based Variant of the Parallel
Repetition Theorem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "4",
pages = "517--531 (or 517--532??)",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hon:2001:ANN,
author = "Wing-Kai Hon and Tak-Wah Lam",
title = "Approximating the Nearest Neighbor Interchange
Distance for Non-Uniform-Degree Evolutionary Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "4",
pages = "533--550",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Obtulowicz:2001:MCO,
author = "Adam Obtulowicz",
title = "Membrane Computing and One-Way Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "4",
pages = "551--558",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zomaya:2001:S,
author = "Albert Y. Zomaya",
title = "Scheduling",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "5",
pages = "559--564",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 10:41:22 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijfcs.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zomaya:2001:STA,
author = "Albert Y. Zomaya",
title = "Scheduling: Theory and Applications: {Guest Editor}'s
Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "5",
pages = "559--564",
month = oct,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zomaya:2001:SIP,
author = "A. Y. Zomaya",
title = "Special Issue: Part 1",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "5",
pages = "559--??",
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 25 07:11:40 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rhodes:2001:TCC,
author = "David L. Rhodes and Wayne Wolf and Albert Zomaya",
title = "Two {CoNP}-Complete Schedule Analysis Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "5",
pages = "565--580",
month = oct,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chantrapornchai:2001:REA,
author = "Chantana Chantrapornchai and Sissades Tongsima and
Albert Zomaya",
title = "Resource Estimation Algorithm Under Impreciseness
Using Inclusion Scheduling",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "5",
pages = "581--598",
month = oct,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Eshaghian:2001:MAH,
author = "Mary Mehrnoosh Eshaghian and Albert Zomaya",
title = "Mapping Arbitrary Heterogeneous Task Graphs Onto
Arbitrary Heterogeneous System Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "5",
pages = "599--628",
month = oct,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Santoso:2001:SHR,
author = "J. Santoso and G. D. {Van Albada} and P. M. A. Sloot
and B. A. A. Nazief",
title = "Simulation of Hierarchical Resource Management for
Meta-Computing Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "5",
pages = "629--643 (or 629--644??)",
month = oct,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Diessel:2001:DTS,
author = "Oliver Diessel and Hossam Elgindy and Albert Zomaya",
title = "On Dynamic Task Scheduling for {FPGA}-Based Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "5",
pages = "645--669 (or 645--670??)",
month = oct,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
xxtitle = "On Dynamic Task Scheduling for {EPGA}-Based Systems",
}
@Article{MeyerAufmHofe:2001:SRT,
author = "Harald {Meyer Auf'm Hofe} and Albert Zomaya",
title = "Solving Rostering Tasks By Generic Methods for
Constraint Optimization",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "5",
pages = "671--693",
month = oct,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
xxpages = "671--694",
}
@Article{Tsukada:2001:EPM,
author = "Yasuyuki Tsukada",
title = "Errata: The paper: {{\em Martin-L{\"o}f's Type Theory
as an Open-Ended Framework}}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "5",
pages = "695--??",
month = oct,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
note = "See \cite{Tsukada:2001:MLT}.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fimmel:2001:OSP,
author = "Dirk Fimmel and J. Muller",
title = "Optimal Software Pipelining Under Resource
Constraints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "6",
pages = "697--718",
month = dec,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Saidane:2001:MPE,
author = "Leila Azouz Saidane and F. Kamoun",
title = "Modelling and Performance Evaluation of the
Circulating Multisequencer, The Multi-Tokens and the
Consensus Algorithms in a Real Time Distributed
Transactional System",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "6",
pages = "719--750",
month = dec,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Priore:2001:DSM,
author = "Paolo Priore and D. D. L. Fuente and A. Gomez and
others",
title = "Dynamic Scheduling of Manufacturing Systems with
Machine Learning",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "6",
pages = "751--762",
month = dec,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2001:EJS,
author = "Keqin Li",
title = "An Efficient Job Scheduling Algorithm in Partitionable
Mesh Connected Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "6",
pages = "763--774",
month = dec,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Oida:2001:CDO,
author = "K. Oida and K. Shinjo",
title = "Characteristics of Deterministic Optimal Routing for
Two Heterogeneous Parallel Servers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "6",
pages = "775--790",
month = dec,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gonzalez:2001:SMM,
author = "Teofilo F. Gonzalez",
title = "On Solving Multimessage Multicasting Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "6",
pages = "791--808",
month = dec,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Blokh:2001:MTS,
author = "David Blokh and E. Levner",
title = "The Maximum Traveling Salesman Problem on Banded
Matrices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "6",
pages = "809--820",
month = dec,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2001:RSI,
author = "Oscar H. Ibarra and T. Bultan and J. Su",
title = "On Reachability and Safety in Infinite-State Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "6",
pages = "821--836",
month = dec,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Paun:2001:HL,
author = "Gheorghe P{\u{a}}un and G. Rozenberg and T. Yokomori",
title = "Hairpin Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "6",
pages = "837--848",
month = dec,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib; OCLC
Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2001:AIV,
author = "Anonymous",
title = "Author Index Volume 12 (2001)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "12",
number = "6",
pages = "849--??",
month = dec,
year = "2001",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yu:2002:SI,
author = "S. Yu",
title = "Special Issue",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "1",
pages = "1--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Harel:2002:SSB,
author = "D. Harel and H. Kugler",
title = "Synthesizing State-Based Object Systems from {LSC}
Specifications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "1",
pages = "5--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bergeron:2002:VAA,
author = "A. Bergeron and S. Hamel",
title = "Vector Algorithms for Approximate String Matching",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "1",
pages = "53--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bruggemann-Klein:2002:RTW,
author = "A. Br{\"u}ggemann-Klein and D. Wood",
title = "The Regularity of Two-Way Nondeterministic Tree
Automata Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "1",
pages = "67--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Campeanu:2002:EAC,
author = "C. Campeanu and A. P{\u{a}}un and S. Yu",
title = "An Efficient Algorithm for Constructing Minimal Cover
Automata for Finite Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "1",
pages = "83--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Champarnaud:2002:ETI,
author = "J.-M. Champarnaud",
title = "Evaluation of Three Implicit Structures to Implement
Nondeterministic Automata From Regular Expressions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "1",
pages = "99--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2002:VQC,
author = "O. H. Ibarra",
title = "Verification in Queue-Connected Multicounter
Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "1",
pages = "115--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mohri:2002:GRI,
author = "M. Mohri",
title = "Generic e-Removal and Input e-Normalization Algorithms
for Weighted Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "1",
pages = "129--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pighizzini:2002:ULO,
author = "G. Pighizzini and J. Shallit",
title = "Unary Language Operations, State Complexity and
{Jacobsthal}'s Function",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "1",
pages = "145--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:51 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cheng:2002:SI,
author = "S.-W. Cheng and T. Dey",
title = "Special Issue",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "2",
pages = "161--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Devillers:2002:DH,
author = "O. Devillers",
title = "The {Delaunay} Hierarchy",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "2",
pages = "163--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Devillers:2002:WT,
author = "O. Devillers and S. Pion and M. Teillaud",
title = "Walking in a Triangulation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "2",
pages = "181--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ungor:2002:PTS,
author = "A. {\"U}ng{\"o}r and A. Sheffer",
title = "Pitching Tents in Space-Time: Mesh Generation for
Discontinuous {Galerkin} Method",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "2",
pages = "201--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Edelsbrunner:2002:SIM,
author = "H. Edelsbrunner and D. Guoy",
title = "Sink Insertion for Mesh Improvement",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "2",
pages = "223--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2002:LSB,
author = "W. Xu and R. Hammersley and K. Lu and D. Fussell",
title = "Lossless Subdivision-Based Multiresolution
Representation of Arbitrary Triangle Meshes Using Kite
Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "2",
pages = "243--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2002:MHM,
author = "G. Xu and C. L. Bajaj and S. Evans",
title = "{$ C^1 $} Modeling with Hybrid Multiple-Sided
{$A$}-Patches",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "2",
pages = "261--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Frey:2002:BTA,
author = "W. H. Frey",
title = "Boundary Triangulations Approximating Developable
Surfaces that Interpolate a Close Space Curve",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "2",
pages = "285--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aichholzer:2002:FPS,
author = "O. Aichholzer and L. S. Alboul and F. Hurtado",
title = "On Flips in Polyhedral Surfaces",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "2",
pages = "303--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Thiagarajan:2002:SI,
author = "P. S. Thiagarajan and R. Yap",
title = "Special Issue",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "3",
pages = "313--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hartog:2002:VPP,
author = "J. I. D. Hartog and E. P. D. Vink",
title = "Verifying Probabilistic Programs Using a {Hoare} Like
Logic",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "3",
pages = "315--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Henriksen:2002:EET,
author = "J. G. Henriksen",
title = "An Expressive Extension of {TLC}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "3",
pages = "341--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kamareddine:2002:EAT,
author = "F. Kamareddine and F. Monin",
title = "An Extension of an Automated Termination Method of
Recursive Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "3",
pages = "361--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Roychoudhury:2002:BTS,
author = "A. Roychoudhury and K. N. Kumar and C. R. Ramakrishnan
and I. V. Ramakrishnan",
title = "Beyond {Tamaki--Sato} Style Unfold\slash Fold
Transformations for Normal Logic Programs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "3",
pages = "387--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cheng:2002:RP,
author = "E. Y. C. Cheng and S. Sahni",
title = "Regular Papers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "3",
pages = "405--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hutter:2002:FSA,
author = "M. Hutter",
title = "The Fastest and Shortest Algorithm for All
Well-Defined Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "3",
pages = "431--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zantema:2002:SOD,
author = "H. Zantema and H. L. Bodlaender",
title = "Sizes of Ordered Decision Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "3",
pages = "445--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Culik:2002:NSA,
author = "K. {Culik II} and J. Karhum{\"a}ki and J. Kari",
title = "A Note on Synchronized Automata and Road Coloring
Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "3",
pages = "459--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ling:2002:SI,
author = "C. X. Ling and N. Cercone",
title = "Special Issue",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "4",
pages = "473--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lorincz:2002:IHP,
author = "A. L{\"o}rincz and I. K{\'o}kai and A. Meretei",
title = "Intelligent High-Performance Crawlers Used to Reveal
Topic-Specific Structure of {WWW}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "4",
pages = "477--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Estivill-Castro:2002:CWV,
author = "V. Estivill-Castro and J. Yang",
title = "Clustering {Web} Visitors by Fast, Robust and
Convergent Algorithms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "4",
pages = "497--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gao:2002:DRS,
author = "W. Gao and S. Wang and B. Liu",
title = "A Dynamic Recommendation System Based on Log Mining",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "4",
pages = "521--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ng:2002:IAW,
author = "V. Ng and M. K. Ho",
title = "An Intelligent Agent for {Web} Advertisements",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "4",
pages = "531--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhong:2002:RCO,
author = "N. Zhong",
title = "Representation and Construction of Ontologies for
{Web} Intelligence",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "4",
pages = "555--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Klarlund:2002:RP,
author = "N. Klarlund and A. M{\o}ller and M. I. Schwatzbach",
title = "Regular Papers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "4",
pages = "571--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Schmidhuber:2002:HGK,
author = "J. Schmidhuber",
title = "Hierarchies of Generalized {Kolmogorov} Complexities
and Nonenumerable Universal Measures Computable in the
Limit",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "4",
pages = "587--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lepere:2002:AAS,
author = "R. Lep{\`e}re and D. Trystram and G. J. Woeginger",
title = "Approximation Algorithms for Scheduling Malleable
Tasks Under Precedence Constraints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "4",
pages = "613--??",
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Deng:2002:P,
author = "Xiaotie Deng",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "5",
pages = "629--??",
month = oct,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bilbao:2002:CCV,
author = "J. M. Bilbao and J. R. Fern{\'a}ndez and J. J.
L{\'o}pez",
title = "On the Complexity of Computing Values of Restricted
Games",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "5",
pages = "633--??",
month = oct,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:09:09 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fang:2002:LIP,
author = "Qizhi Fang and Shanfeng Zhu",
title = "Linear and Integer Programming Techniques for
Cooperative Games",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "5",
pages = "653--??",
month = oct,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:09:15 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jia:2002:CCH,
author = "Weijia Jia and Zhibin Sun",
title = "On Computational Complexity of Hierarchical
Optimization",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "5",
pages = "667--??",
month = oct,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:09:20 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yang:2002:CSB,
author = "Xiaoguang Yang and Shuo Tao and Rongjun Liu and
Maocheng Cai",
title = "Complexity of Scenario-Based Portfolio Optimization
Problem with Var Objective",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "5",
pages = "671--??",
month = oct,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:09:25 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Deng:2002:CCA,
author = "Xiaotie Deng and Zhong-Fei Li and Shou-Yang Wang",
title = "Computational Complexity of Arbitrage in Frictional
Security Market",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "5",
pages = "681--??",
month = oct,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:09:29 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shu:2002:NNA,
author = "Jiwu Shu and Yonggeng Gu and Weimin Zheng",
title = "A Novel Numerical Approach of Computing {American}
Option",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "5",
pages = "685--??",
month = oct,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:09:33 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anceaume:2002:ESU,
author = "Emmanuelle Anceaume",
title = "Efficient Solution To Uniform Atomic Broadcast",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "5",
pages = "695--??",
month = oct,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{DeFrancesco:2002:FDM,
author = "Nicoletta {De Francesco} and Antonella Santone",
title = "A Formula-Driven Modular Attack on State Explosion",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "5",
pages = "719--??",
month = oct,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Martin-Vide:2002:PFA,
author = "Carlos Mart{\'i}n-Vide and Alexandru Mateescu and
Victor Mitrana",
title = "Parallel Finite Automata Systems Communicating By
States",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "5",
pages = "733--??",
month = oct,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:10:00 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Arslan:2002:AAL,
author = "Abdullah N. Arslan and {\"O}mer
E{\u{g}}ecio{\u{g}}lu",
title = "Approximation Algorithms for Local Alignment with
Length Constraints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "5",
pages = "751--??",
month = oct,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:10:57 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Honkala:2002:RCD,
author = "Juha Honkala",
title = "Remarks Concerning the {D0L} {$ \omega $}-Equivalence
Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "5",
pages = "769--??",
month = oct,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:31 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Paun:2002:CCN,
author = "Andrei P{\u{a}}un and Gheorghe P{\u{a}}un and Grzegorz
Rozenberg",
title = "Computing By Communication in Networks of Membranes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "6",
pages = "779--??",
month = dec,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:10:53 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Campeanu:2002:SDR,
author = "C. C{\^a}mpeanu and K. Salomaa and S.
V{\'a}gv{\"o}lgyi",
title = "Shuffle Decompositions of Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "6",
pages = "799--??",
month = dec,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:10:49 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Deng:2002:PMT,
author = "Xiaotie Deng and Haodi Feng and Guojun Li and Guizhen
Liu",
title = "A {PTAS} for Minimizing Total Completion Time of
Bounded Batch Scheduling",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "6",
pages = "817--??",
month = dec,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:10:46 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tran:2002:UPC,
author = "Nicholas Tran",
title = "On Universally Polynomial Context-Free Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "6",
pages = "829--??",
month = dec,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mantler:2002:CRB,
author = "Andrea Mantler and Helen Cameron",
title = "Constructing Red-Black Tree Shapes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "6",
pages = "837--??",
month = dec,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:11:30 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anceaume:2002:NDI,
author = "Emmanuelle Anceaume and Jean-Michel Helary and Michel
Raynal",
title = "A Note on the Determination of the Immediate
Predecessors in a Distributed Computation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "6",
pages = "865--??",
month = dec,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:11:26 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nedjah:2002:PMC,
author = "Nadia Nedjah and Luiza {De Macedo Mourelle}",
title = "Pattern Matching Code Minimization in Rewriting-Based
Programming Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "6",
pages = "873--??",
month = dec,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Faloutsos:2002:EAL,
author = "Michalis Faloutsos and Rajesh Pankaj and Kenneth C.
Sevcik",
title = "The Effect of Asymmetry on the On-Line Multicast
Routing Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "6",
pages = "889--??",
month = dec,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:11:54 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dang:2002:ECT,
author = "Zhe Dang and Oscar H. Ibarra",
title = "The Existence of {$ \omega $}-Chains for Transitive
Mixed Linear Relations and Its Applications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "6",
pages = "911--??",
month = dec,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2002:AIV,
author = "Anonymous",
title = "Author Index Volume 13 (2002)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "13",
number = "6",
pages = "937--??",
month = dec,
year = "2002",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nakano:2003:P,
author = "Koji Nakano and Jie Wu",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "1",
pages = "1--??",
month = feb,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rosenberg:2003:EPF,
author = "Arnold L. Rosenberg",
title = "Efficient Pairing Functions --- and Why You Should
Care",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "1",
pages = "3--??",
month = feb,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zomaya:2003:MCO,
author = "Albert Y. Zomaya",
title = "Mobile Computing: Opportunities for Parallel
Algorithms Research",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "1",
pages = "19--??",
month = feb,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Leopold:2003:CMA,
author = "Claudia Leopold",
title = "Cache Miss Analysis of {$2$D} Stencil Codes with Tiled
Time Loop",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "1",
pages = "39--??",
month = feb,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Schmollinger:2003:DPA,
author = "Martin Schmollinger and Michael Kaufmann",
title = "Designing Parallel Algorithms for Hierarchical {SMP}
Clusters",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "1",
pages = "59--??",
month = feb,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wu:2003:SOS,
author = "Chin-Hsiung Wu and Shi-Jinn Horng",
title = "Scalable and Optimal Speed-Up Parallel Algorithms for
Template Matching on Arrays with Reconfigurable Optical
Buses",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "1",
pages = "79--??",
month = feb,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wu:2003:COM,
author = "Jie Wu and Stephen Olariu",
title = "On Cost-Optimal Merge of Two Intransitive Sorted
Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "1",
pages = "99--??",
month = feb,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Giakoumakis:2003:LTR,
author = "V. Giakoumakis and J. M. Vanherpe",
title = "Linear Time Recognition and Optimizations for
Weak-Bisplit Graphs, Bi-Cographs and Bipartite {$ P_6
$}-Free Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "1",
pages = "107--??",
month = feb,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nakano:2003:LLG,
author = "Koji Nakano",
title = "Linear Layout of Generalized Hypercubes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "1",
pages = "137--??",
month = feb,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Madhu:2003:PRS,
author = "Mutyam Madhu",
title = "Probabilistic Rewriting {$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "1",
pages = "157--??",
month = feb,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:52 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2003:Pa,
author = "Anonymous",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "2",
pages = "167--??",
month = apr,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fan:2003:OCN,
author = "Guangbin Fan and Jingyuan Zhang",
title = "Optimal Cellular Network Deployment Reusing Existing
Base Stations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "2",
pages = "169--??",
month = apr,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:12:43 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2003:DSB,
author = "Yu Wang and Xiang-Yang Li and Ophir Frieder",
title = "Distributed Spanners with Bounded Degree for Wireless
Ad Hoc Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "2",
pages = "183--??",
month = apr,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:12:56 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wu:2003:BAH,
author = "Jie Wu and Fei Dai",
title = "Broadcasting in Ad Hoc Networks Based on
Self-Pruning",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "2",
pages = "201--??",
month = apr,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ferro:2003:FCM,
author = "A. Ferro and G. Pigola and A. Pulvirenti and D.
Shasha",
title = "Fast Clustering and Minimum Weight Matching Algorithms
for Very Large Mobile Backbone Wireless Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "2",
pages = "223--??",
month = apr,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:13:04 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lipman:2003:NAA,
author = "Justin Lipman and Paul Boustead and John Judge",
title = "{Neighbor Aware Adaptive Power} Flooding ({NAAP}) in
Mobile Ad Hoc Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "2",
pages = "237--??",
month = apr,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:13:07 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cartigny:2003:RRS,
author = "Julien Cartigny and Fran{\c{c}}ois Ingelrest and David
Simplot",
title = "{RNG} Relay Subset Flooding Protocols in Mobile Ad-Hoc
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "2",
pages = "253--??",
month = apr,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:13:10 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xuan:2003:CSF,
author = "B. Bui Xuan and A. Ferreira and A. Jarry",
title = "Computing Shortest, Fastest, and Foremost Journeys in
Dynamic Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "2",
pages = "267--??",
month = apr,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:13:16 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alzoubi:2003:MIS,
author = "Khaled M. Alzoubi and Peng-Jun Wan and Ophir Frieder",
title = "Maximal Independent Set, Weakly-Connected Dominating
Set, and Induced Spanners in Wireless Ad Hoc Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "2",
pages = "287--??",
month = apr,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:13:25 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chen:2003:ZAC,
author = "Yuanzhu Peter Chen and Arthur L. Liestman",
title = "A Zonal Algorithm for Clustering An Hoc Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "2",
pages = "305--??",
month = apr,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wan:2003:SHM,
author = "Peng-Jun Wan and Khaled M. Alzoubi and Ophir Frieder",
title = "A Simple Heuristic for Minimum Connected Dominating
Set in Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "2",
pages = "323--??",
month = apr,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:13:39 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2003:Pb,
author = "Anonymous",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "3",
pages = "335--??",
month = jun,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sahni:2003:DSO,
author = "Sartaj Sahni and Kun Suk Kim and Haibin Lu",
title = "Data Structures for One-Dimensional Packet
Classification Using Most-Specific-Rule Matching",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "3",
pages = "337--??",
month = jun,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Palis:2003:COR,
author = "Michael A. Palis",
title = "On the Competitiveness of Online Real-Time Scheduling
with Rate of Progress Guarantees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "3",
pages = "359--??",
month = jun,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Qiu:2003:INT,
author = "Ke Qiu and Sajal K. Das",
title = "Interconnection Networks and Their Eigenvalues",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "3",
pages = "371--??",
month = jun,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordim:2003:SSC,
author = "Jacir Luiz Bordim and Koji Nakano and Hong Shen",
title = "Sorting on Single-Channel Wireless Sensor Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "3",
pages = "391--??",
month = jun,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:13:50 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tang:2003:IIV,
author = "Peiyi Tang and Pen-Chung Yew",
title = "Interprocedural Induction Variable Analysis",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "3",
pages = "405--??",
month = jun,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:13:58 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bein:2003:BSH,
author = "Wolfgang W. Bein and Lawrence L. Larmore and Shahram
Latifi and I. Hal Sudborough",
title = "Block Sorting is Hard",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "3",
pages = "425--??",
month = jun,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:14:01 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ghosh:2003:NAE,
author = "Sasthi C. Ghosh and Bhabani P. Sinha and Nabanita
Das",
title = "A New Approach to Efficient Channel Assignment for
Hexagonal Cellular Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "3",
pages = "439--??",
month = jun,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:14:07 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jung:2003:SBS,
author = "Haejae Jung and Sartaj Sahni",
title = "Supernode Binary Search Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "3",
pages = "465--??",
month = jun,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:14:10 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bansal:2003:MHM,
author = "S. Bansal and S. Sreekanth and P. Gupta",
title = "{M}-Heap: a Modified Heap Data Structure",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "3",
pages = "491--??",
month = jun,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:14:13 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Grimmell:2003:SBR,
author = "William C. Grimmell and Nageswara S. V. Rao",
title = "On Source-Based Route Computation for Quickest Paths
under Dynamic Bandwidth Constraints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "3",
pages = "503--??",
month = jun,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:14:17 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2003:Pc,
author = "Anonymous",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "4",
pages = "525--??",
month = aug,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Emerson:2003:RAR,
author = "E. Allen Emerson and Kedar S. Namjoshi",
title = "On Reasoning about Rings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "4",
pages = "527--??",
month = aug,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:14:23 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bouajjani:2003:GAS,
author = "Ahmed Bouajjani and Javier Esparza and Tayssir
Touili",
title = "A Generic Approach to the Static Analysis of
Concurrent Programs with Procedures",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "4",
pages = "551--??",
month = aug,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:14:29 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Clarke:2003:ACG,
author = "Edmund Clarke and Ansgar Fehnker and Zhi Han and Bruce
Krogh and Jo{\"e}l Ouaknine and Olaf Stursberg and
Michael Theobald",
title = "Abstraction and Counterexample-Guided Refinement in
Model Checking of Hybrid Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "4",
pages = "583--??",
month = aug,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:14:33 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bartzis:2003:ESR,
author = "Constantinos Bartzis and Tevfik Bultan",
title = "Efficient Symbolic Representations for Arithmetic
Constraints in Verification",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "4",
pages = "605--??",
month = aug,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dsouza:2003:LCE,
author = "Deepak D'souza",
title = "A Logical Characterisation of Event Clock Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "4",
pages = "625--??",
month = aug,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jiao:2003:CLM,
author = "Li Jiao and To-Yat Cheung",
title = "Characterizing Liveness Monotonicity for Weighted
Petri Nets in Terms of Siphon-Based Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "4",
pages = "641--??",
month = aug,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:14:49 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dold:2003:CVR,
author = "Axel Dold and Friedrich {Von Henke} and Wolfgang
Goerigk",
title = "A Completely Verified Realistic Bootstrap Compiler",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "4",
pages = "659--??",
month = aug,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:14:56 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Krithivasan:2003:DA,
author = "Kamala Krithivasan and K. Sharda and Sandeep V.
Varma",
title = "Distributed {$ \omega $}-Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "4",
pages = "681--??",
month = aug,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:14:59 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Karhumaki:2003:EPF,
author = "J. Karhum{\"a}ki and L. P. Lisovik",
title = "The Equivalence Problem of Finite Substitutions on $ a
b*c $, with Applications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "4",
pages = "699--??",
month = aug,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:15:04 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2003:Pd,
author = "Anonymous",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "711--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:32:39 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Grover:2003:IQS,
author = "Lov K. Grover",
title = "An Improved Quantum Scheduling Algorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "715--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:32:40 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ivanyos:2003:EQA,
author = "G{\'a}bor Ivanyos and Fr{\'e}d{\'e}ric Magniez and
Miklos Santha",
title = "Efficient Quantum Algorithms for Some Instances of the
Non-{Abelian} Hidden Subgroup Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "723--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:27:16 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bouda:2003:EQI,
author = "Jan Bouda and Vladim{\'\i}r R. Bu{\v{z}}ek",
title = "Encryption of Quantum Information",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "741--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Grassl:2003:EQC,
author = "Markus Grassl and Martin R{\"o}tteler and Thomas
Beth",
title = "Efficient Quantum Circuits for Non-Qubit Quantum
Error-Correcting Codes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "757--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:26:53 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Klappenecker:2003:QSR,
author = "Andreas Klappenecker and Martin R{\"o}tteler",
title = "Quantum Software Reusability",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "777--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:32:51 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jorrand:2003:SPQ,
author = "Philippe Jorrand and Mehdi Mhalla",
title = "Separability of Pure {$N$}-Qubit States: Two
Characterizations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "797--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yamakami:2003:AQF,
author = "Tomoyuki Yamakami",
title = "Analysis of Quantum Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "815--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nishimura:2003:QCR,
author = "Harumichi Nishimura",
title = "Quantum Computation with Restricted Amplitudes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "853--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bertoni:2003:GRD,
author = "Alberto Bertoni and Carlo Mereghetti and Beatrice
Palano",
title = "{Golomb} Rulers and Difference Sets for Succinct
Quantum Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "871--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Janzing:2003:CPP,
author = "Dominik Janzing and Pawe{\l} Wocjan and Thomas Beth",
title = "On the Computational Power of Physical Interactions:
Bounds on the Number of Time Steps for Simulating
Arbitrary Interaction Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "889--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jain:2003:PPH,
author = "Anuj Jain and Sartaj Sahni and Jatinder Palta and
James Dempsey",
title = "Partitioning {$3$D} Phantoms into Homogeneous
Cuboids",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "905--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dantsin:2003:RDC,
author = "Evgeny Dantsin and Alexander Wolpert",
title = "A Robust {DNA} Computation Model that Captures
{Pspace}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "933--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:33:06 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Champarnaud:2003:P,
author = "Jean-Marc Champarnaud",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "953--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mohri:2003:EDW,
author = "Mehryar Mohri",
title = "Edit-Distance of Weighted Automata: General
Definitions and Algorithms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "957--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Allauzen:2003:FST,
author = "Cyril Allauzen and Mehryar Mohri",
title = "Finitely Subsequential Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "983--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:16:22 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Campeanu:2003:CNM,
author = "Cezar C{\^a}mpeanu and Andrei P{\u{a}}un",
title = "Counting the Number of Minimal {DFCA} Obtained By
Merging States",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "995--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:16:27 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Campeanu:2003:FSP,
author = "Cezar C{\^a}mpeanu and Kai Salomaa and Sheng Yu",
title = "A Formal Study of Practical Regular Expressions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "1007--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:16:34 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Czyzowicz:2003:LTP,
author = "Jurek Czyzowicz and Wojciech Fraczak and Andrzej Pelc
and Wojciech Rytter",
title = "Linear-Time Prime Decomposition of Regular Prefix
Codes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "1019--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:16:57 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gheorghiu:2003:SFF,
author = "Mihaela Gheorghiu and Janusz Brzozowski",
title = "Simulation of Feedback-Free Circuits in the Algebra of
Transients",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "1033--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:16:55 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Guingne:2003:VOV,
author = "Franck Guingne and Florent Nicart and Jean-Marc
Champarnaud and Lauri Karttunen and Tam{\'a}s Ga{\'a}l
and Andr{\'e} Kempe",
title = "Virtual Operations on Virtual Networks: the Priority
Union",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "1055--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Korner:2003:TSE,
author = "Heiko K{\"o}rner",
title = "A Time and Space Efficient Algorithm for Minimizing
Cover Automata for Finite Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "1071--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holzer:2003:NDC,
author = "Markus Holzer and Martin Kutrib",
title = "Nondeterministic Descriptional Complexity of Regular
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "1087--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:17:27 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Okhotin:2003:EAB,
author = "Alexander Okhotin",
title = "Efficient Automaton-Based Recognition for Linear
Conjunctive Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "1103--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sutner:2003:RPA,
author = "Klaus Sutner",
title = "Reduced Power Automata and Sofic Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "1117--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wei:2003:EAS,
author = "David S. L. Wei and Sanguthevar Rajasekaran and
Kshirasagar Naik and Sy-Yen Kuo",
title = "Efficient Algorithms for Selection and Sorting of
Large Distributed Files on {de Bruijn} and Hypercube
Structures",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "1129--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fantozzi:2003:GPS,
author = "Carlo Fantozzi and Andrea Pietracaprina and Geppino
Pucci",
title = "A General {PRAM} Simulation Scheme for Clustered
Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "1147--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:17:40 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Martini:2003:DHM,
author = "Paul M. Martini and Walter A. Burkhard",
title = "Double Hashing with Multiple Passbits",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "1165--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2003:AIV,
author = "Anonymous",
title = "Author Index Volume 14 (2003)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "6",
pages = "1183--??",
month = dec,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2004:CCC,
author = "Oscar H. Ibarra and Louxin Zhang",
title = "Computing and Combinatorics Conference ---
{COCOON'02}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "1--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:17:56 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cai:2004:HAM,
author = "Jin-Yi Cai and Denis Charles and A. Pavan and Samik
Sengupta",
title = "On Higher {Arthur--Merlin} Classes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "3--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:17:59 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Skulrattanakulchai:2004:CAS,
author = "San Skulrattanakulchai and Harold N. Gabow",
title = "Coloring Algorithms on Subcubic Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "21--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ilie:2004:WCR,
author = "Lucian Ilie and Sheng Yu and Kaizhong Zhang",
title = "Word Complexity and Repetitions in Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "41--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Arslan:2004:DLW,
author = "Abdullah N. Arslan and {\"O}mer
E{\u{g}}ecio{\u{g}}lu",
title = "Dictionary Look-Up Within Small Edit Distance",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "57--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nakano:2004:TEO,
author = "Koji Nakano",
title = "Time and Energy Optimal List Ranking Algorithms on the
$k$-Channel Broadcast Communication Model with No
Collision Detection",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "73--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hoang:2004:MPM,
author = "Thanh Minh Hoang and Thomas Thierauf",
title = "On the Minimal Polynomial of a Matrix",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "89--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:18:29 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
note = "See erratum \cite{Hoang:2004:EMP}.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Desmedt:2004:AVC,
author = "Yvo Desmedt and Yongge Wang",
title = "Analyzing Vulnerabilities of Critical Infrastructures
Using Flows and Critical Vertices in {And\slash Or}
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "107--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:18:32 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ma:2004:TSP,
author = "Weimin Ma and Yinfeng Xu and Jane You and James Liu
and Kanliang Wang",
title = "On the $k$-Truck Scheduling Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "127--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:18:35 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Domaratzki:2004:IBN,
author = "Michael Domaratzki",
title = "Improved Bounds on the Number of Automata Accepting
Finite Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "143--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brandstadt:2004:GCG,
author = "Andreas Brandst{\"a}dt and Ho{\`a}ng-Oanh Le and
Raffaele Mosca",
title = "Gem- and Co-Gem-Free Graphs Have Bounded
Clique-Width",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "163--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:18:55 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2004:MBU,
author = "Yinlong Xu and Li Lin and Guoliang Chen and Yingyu Wan
and Weijun Guo",
title = "Multicasting and Broadcasting in Undirected {WDM}
Networks and {QoS} Extensions of Multicasting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "187--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:19:00 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alberich:2004:SPT,
author = "Ricardo Alberich and Merc{\`e} Llabr{\'e}s and
Francesc Rossell{\'o}",
title = "Single-Pushout Transformation of Total Algebras",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "1",
pages = "205--??",
month = feb,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2004:P,
author = "Anonymous",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "223--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rivals:2004:SAA,
author = "Eric Rivals",
title = "A Survey on Algorithmic Aspects of Tandem Repeats
Evolution",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "225--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Margolis:2004:WGM,
author = "S. W. Margolis and J.-E. Pin and M. V. Volkov",
title = "Words Guaranteeing Minimum Image",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "259--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:19:19 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mateescu:2004:MIS,
author = "Alexandru Mateescu and Arto Salomaa",
title = "Matrix Indicators for Subword Occurrences and
Ambiguity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "277--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brlek:2004:PCI,
author = "S. Brlek and S. Hamel and M. Nivat and C. Reutenauer",
title = "On the Palindromic Complexity of Infinite Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "293--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:19:26 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Richomme:2004:CRM,
author = "Gw{\'e}na{\"e}l Richomme and Patrice S{\'e}{\'e}bold",
title = "Conjectures and Results on Morphisms Generating
$k$-Power-Free Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "307--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shallit:2004:SAL,
author = "Jeffrey Shallit",
title = "Simultaneous Avoidance of Large Squares and Fractional
Powers in Infinite Binary Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "317--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Justin:2004:EWS,
author = "Jacques Justin and Giuseppe Pirillo",
title = "Episturmian Words: Shifts, Morphisms and Numeration
Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "329--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:19:54 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Harju:2004:MDE,
author = "Tero Harju and Dirk Nowotka",
title = "Minimal {Duval} Extensions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "349--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:20:00 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Carpi:2004:RFU,
author = "Arturo Carpi and Aldo de Luca",
title = "Repetitions, Fullness, and Uniformity in
Two-Dimensional Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "355--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:20:06 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mastrolilli:2004:SMM,
author = "Monaldo Mastrolilli",
title = "Scheduling To Minimize Max Flow Time: Off-Line and
On-Line Algorithms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "385--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:32 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordim:2004:ISS,
author = "Jacir L. Bordim and Oscar H. Ibarra and Yasuaki Ito
and Koji Nakano",
title = "Instance-Specific Solutions for Accelerating the {CKY}
Parsing of Large Context-Free Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "403--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:20:11 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gergatsoulis:2004:PPT,
author = "Manolis Gergatsoulis and Christos Nomikos",
title = "A Proof Procedure for Temporal Logic Programming",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "417--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:20:15 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lai:2004:SGS,
author = "Chun-Pong Lai and Cunsheng Ding",
title = "Several Generalizations of {Shamir's} Secret Sharing
Scheme",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "445--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:20:19 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nakano:2004:P,
author = "Koji Nakano and Jie Wu",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "3",
pages = "459--??",
month = jun,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:20:34 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fujiwara:2004:PLA,
author = "Akihiro Fujiwara and Ken'Ichi Matsumoto and Wei Chen",
title = "Procedures for Logic and Arithmetic Operations with
{DNA} Molecules",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "3",
pages = "461--??",
month = jun,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Matsumae:2004:SMS,
author = "Susumu Matsumae",
title = "Simulation of Meshes with Separable Buses By Meshes
with Multiple Partitioned Buses",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "3",
pages = "475--??",
month = jun,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Singh:2004:HMD,
author = "Mitali Singh and Viktor K. Prasanna",
title = "A Hierarchical Model for Distributed Collaborative
Computation in Wireless Sensor Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "3",
pages = "485--??",
month = jun,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Blin:2004:FAD,
author = "L{\'e}lia Blin and Franck Butelle",
title = "The First Approximated Distributed Algorithm for the
Minimum Degree Spanning Tree Problem on General
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "3",
pages = "507--??",
month = jun,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:20:53 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2004:HCD,
author = "Dajin Wang and Jiannong Cao",
title = "On Hierarchical Configuration of Distributed Systems
on Mesh and Hypercube",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "3",
pages = "517--??",
month = jun,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:20:57 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rauber:2004:PBL,
author = "Thomas Rauber and Gudula R{\"u}nger",
title = "Program-Based Locality Measures for Scientific
Computing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "3",
pages = "535--??",
month = jun,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:21:04 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ciglaric:2004:CND,
author = "Mojca Ciglari{\v{c}}",
title = "Content Networks: Distributed Routing Decisions in
Presence of Repeated Queries",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "3",
pages = "555--??",
month = jun,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sahni:2004:EDL,
author = "Sartaj Sahni and Kun Suk Kim",
title = "Efficient Dynamic Lookup for Bursty Access Patterns",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "4",
pages = "567--??",
month = aug,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:21:11 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Poon:2004:MTC,
author = "Chung Keung Poon and Wenci Yu",
title = "On Minimizing Total Completion Time in Batch Machine
Scheduling",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "4",
pages = "593--??",
month = aug,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:21:15 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2004:QAU,
author = "Xiaoyu Li and Howard Barnum",
title = "Quantum Authentication Using Entangled States",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "4",
pages = "609--??",
month = aug,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Egecioglu:2004:CGW,
author = "{\"O}mer E{\u{g}}ecio{\u{g}}lu and Jeffrey B. Remmel
and S. Gill Williamson",
title = "A Class of Graphs Which Has Efficient Ranking and
Unranking Algorithms for Spanning Trees and Forests",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "4",
pages = "619--??",
month = aug,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:21:30 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hong:2004:AWS,
author = "Dawei Hong and Shushuang Man",
title = "Analysis of {Web} Search Algorithm Hits",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "4",
pages = "649--??",
month = aug,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dassow:2004:DCL,
author = "J{\"u}rgen Dassow",
title = "On the Descriptional Complexity of {Lindenmayer}
Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "4",
pages = "663--??",
month = aug,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shi:2004:FAD,
author = "Qingmin Shi and Joseph J{\'a}j{\'a}",
title = "Fast Algorithms for {$3$-D} Dominance Reporting and
Counting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "4",
pages = "673--??",
month = aug,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hoang:2004:EMP,
author = "Thanh Minh Hoang and Thomas Thierauf",
title = "Erratum: on the Minimal Polynomial of a Matrix",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "4",
pages = "685--??",
month = aug,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
note = "See \cite{Hoang:2004:MPM}.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Champarnaud:2004:RWE,
author = "Jean-Marc Champarnaud and {\'E}ric Laugerotte and
Faissal Ouardi and Djelloul Ziadi",
title = "From Regular Weighted Expressions To Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "5",
pages = "687--??",
month = oct,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:22:08 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ferrante:2004:VCP,
author = "Alessandro Ferrante and Mimmo Parente",
title = "On the Vertex-Connectivity Problem for Graphs with
Sharpened Triangle Inequality",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "5",
pages = "701--??",
month = oct,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ho:2004:DCP,
author = "Kevin I.-J. Ho and Joseph Y.-T. Leung",
title = "A Dual Criteria Preemptive Scheduling Problem for
Minimax Error of Imprecise Computation Tasks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "5",
pages = "717--??",
month = oct,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Leung:2004:ICA,
author = "Joseph Y.-T. Leung",
title = "Improved Competitive Algorithms for Two-Processor
Real-Time Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "5",
pages = "733--??",
month = oct,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Idwan:2004:FPM,
author = "Sahar Idwan and Dinesh P. Mehta and Mario A. Lopez",
title = "Fast Pursuit of Mobile Nodes Using {TPR} Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "5",
pages = "753--??",
month = oct,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:22:22 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Poon:2004:ORM,
author = "Chung Keung Poon",
title = "Optimal Range Max Datacube for Fixed Dimensions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "5",
pages = "773--??",
month = oct,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Inoue:2004:NRT,
author = "Katsushi Inoue and Akira Ito and Takashi Kamiura and
Holger Petersen and Lan Zhang",
title = "A Note on Rebound {Turing} Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "5",
pages = "791--??",
month = oct,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:22:28 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Luo:2004:PDE,
author = "Jun Luo and Sanguthevar Rajasekaran",
title = "Parallelizing $1$-Dimensional Estuarine Model",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "6",
pages = "809--??",
month = dec,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Finkel:2004:RLI,
author = "Olivier Finkel",
title = "On Recognizable Languages of Infinite Pictures",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "6",
pages = "823--??",
month = dec,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Casasnovas:2004:AMC,
author = "Jaume Casasnovas and Joe Mir{\'o} and Manuel Moy{\`a}
and Francesc Rossell{\'o}",
title = "An Approach To Membrane Computing Under Inexactitude",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "6",
pages = "841--??",
month = dec,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2004:ICN,
author = "Farn Wang",
title = "Inductive Composition of Numbers with Maximum,
Minimum, and Addition: a New Theory for Program
Execution-Time Analysis",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "6",
pages = "865--??",
month = dec,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hon:2004:STD,
author = "Wing-Kai Hon and Tak-Wah Lam and Siu-Ming Yiu and
Ming-Yang Kao and Wing-Kin Sung",
title = "Subtree Transfer Distance for Degree-{$D$}
Phylogenies",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "6",
pages = "893--??",
month = dec,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2004:AIV,
author = "Anonymous",
title = "Author Index Volume 15 (2004)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "6",
pages = "911--??",
month = dec,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordim:2005:Fa,
author = "Jacir L. Bordim and Koji Nakano and Arnold L.
Rosenberg",
title = "Foreword",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "1",
pages = "1--??",
month = feb,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 24 15:13:48 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wu:2005:EEN,
author = "Jie Wu and Shuhui Yang",
title = "Energy-Efficient Node Scheduling Models in Sensor
Networks with Adjustable Ranges",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "1",
pages = "3--??",
month = feb,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 24 15:13:48 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Goddard:2005:SSA,
author = "Wayne Goddard and Stephen T. Hedetniemi and David P.
Jacobs and Pradip K. Srimani",
title = "Self-Stabilizing Algorithms for Orderings and
Colorings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "1",
pages = "19--??",
month = feb,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 24 15:13:48 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fujiwara:2005:PMI,
author = "Akihiro Fujiwara and Satoshi Kamio",
title = "Procedures for Multiple Input Functions with {DNA}
Molecules",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "1",
pages = "37--??",
month = feb,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 24 15:13:48 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fernandez-Zepeda:2005:ESA,
author = "Jos{\'e} Alberto Fern{\'a}ndez-Zepeda and Daniel
Fajardo-Delgado and Jos{\'e} Antonio C{\'a}rdenas-Haro
and Anu G. Bourgeois",
title = "Efficient Simulation of an Acyclic Directed
Reconfigurable Model on an Undirected Reconfigurable
Model",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "1",
pages = "55--??",
month = feb,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 24 15:13:48 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fernandez-Zepeda:2005:DFT,
author = "Jos{\'e} Alberto Fern{\'a}ndez-Zepeda and Alejandro
Estrella-Balderrama and Anu G. Bourgeois",
title = "Designing Fault Tolerant Algorithms for Reconfigurable
Meshes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "1",
pages = "71--??",
month = feb,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 24 15:13:48 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ito:2005:FSL,
author = "Yasuaki Ito and Koji Nakano",
title = "{FM} screening by the Local Exhaustive Search, with
Hardware Acceleration",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "1",
pages = "89--??",
month = feb,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 24 15:13:48 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Davila:2005:RSP,
author = "Jaime Davila and Sanguthevar Rajasekaran",
title = "Randomized Sorting on the {POPS} Network",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "1",
pages = "105--??",
month = feb,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 24 15:13:48 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Miura:2005:CDR,
author = "Kazuyuki Miura and Machiko Azuma and Takao Nishizeki",
title = "Canonical Decomposition, Realizer, {Schnyder} Labeling
and Orderly Spanning Trees of Plane Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "1",
pages = "117--??",
month = feb,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 24 15:13:48 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordim:2005:Fb,
author = "Jacir L. Bordim and Koji Nakano and Arnold L.
Rosenberg",
title = "Foreword",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "143--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Casanova:2005:NMI,
author = "Henri Casanova",
title = "Network Modeling Issues for {Grid} Application
Scheduling",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "145--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Beaumont:2005:SSS,
author = "Olivier Beaumont and Arnaud Legrand and Loris Marchal
and Yves Robert",
title = "Steady-State Scheduling on Heterogeneous Clusters",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "163--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cappello:2005:AMH,
author = "Franck Cappello and Pierre Fraigniaud and Bernard Mans
and Arnold L. Rosenberg",
title = "An Algorithmic Model for Heterogeneous Hyper-Clusters:
Rationale And Experience",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "195--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dutot:2005:SLS,
author = "Pierre-Fran{\c{c}}ois Dutot and Lionel Eyraud and
Gr{\'e}gory Mouni{\'e} and Denis Trystram",
title = "Scheduling on Large Scale Distributed Platforms: From
Models To Implementations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "217--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alba:2005:GEN,
author = "Enrique Alba and Fikret Ercal and El-Ghazali Talbi and
Albert Y. Zomaya",
title = "Guest Editorial: Nature-Inspired Distributed
Computing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "239--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Vermeulen-Jourdan:2005:LDS,
author = "L. Vermeulen-Jourdan and C. Dhaenens and E-G. Talbi",
title = "Linkage Disequilibrium Study with a Parallel Adaptive
{GA}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "241--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wilson:2005:CPP,
author = "Lucas A. Wilson and Michelle D. Moore",
title = "Cross-Pollinating Parallel Genetic Algorithms for
Multi-Objective Search And Optimization",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "261--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zomaya:2005:ECP,
author = "Albert Y. Zomaya and Gerard Chan",
title = "Efficient Clustering for Parallel Tasks Execution in
Distributed Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "281--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Katangur:2005:ROM,
author = "Ajay K. Katangur and Somasheker Akkaladevi and Yi Pan
and Martin D. Fraser",
title = "Routing in Optical Multistage Networks with Limited
Crosstalk Using Ant Colony Optimization",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "301--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Merkle:2005:DPC,
author = "Daniel Merkle and Martin Middendorf and Alexander
Scheidler",
title = "Decentralized Packet Clustering in Router-Based
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "321--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alba:2005:BPG,
author = "E. Alba and F. Chicano",
title = "On the Behavior of Parallel Genetic Algorithms for
Optimal Placement of Antennae in Telecommunications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "343--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jansen:2005:AAF,
author = "Klaus Jansen and Monaldo Mastrolilli and Roberto
Solis-Oba",
title = "Approximation Algorithms for Flexible Job Shop
Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "361--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kohrt:2005:LSR,
author = "Jens S. Kohrt and Kim S. Larsen",
title = "On-Line Seat Reservations Via Off-Line Seating
Arrangements",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "2",
pages = "381--??",
month = apr,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue May 3 09:03:12 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Salomaa:2005:P,
author = "Kai Salomaa and Sheng Yu",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "399--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Allauzen:2005:DPA,
author = "Cyril Allauzen and Mehryar Mohri and Brian Roark",
title = "The Design Principles and Algorithms of a Weighted
Grammar Library",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "403--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordihn:2005:ULO,
author = "Henning Bordihn and Markus Holzer and Martin Kutrib",
title = "Unsolvability Levels of Operation Problems for
Subclasses of Context-Free Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "423--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Champarnaud:2005:BFD,
author = "J.-M. Champarnaud and F. Coulon and T.
Parantho{\"e}n",
title = "Brute Force Determinization of {NFAs} by Means of
State Covers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "441--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Daley:2005:FMV,
author = "Mark Daley and Ian Mcquillan",
title = "Formal Modelling of Viral Gene Compression",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "453--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Geser:2005:FFA,
author = "Alfons Geser and Dieter Hofbauer and Johannes Waldmann
and Hans Zantema",
title = "Finding Finite Automata That Certify Termination of
String Rewriting Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "471--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Han:2005:AAM,
author = "Yonghua Han and Bin Ma and Kaizhong Zhang",
title = "An Automata Approach to Match Gapped Sequence Tags
Against Protein Database",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "487--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Han:2005:GGA,
author = "Yo-Sub Han and Derick Wood",
title = "The Generalization of Generalized Automata: Expression
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "499--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jirasek:2005:SCC,
author = "Jozef Jir{\'a}sek and Galina Jir{\'a}skov{\'a} and
Alexander Szabari",
title = "State Complexity of Concatenation and
Complementation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "511--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kari:2005:OTA,
author = "Lila Kari and Stavros Konstantinidis and Petr
Sos{\'i}k",
title = "Operations on Trajectories with Applications to Coding
and Bioinformatics",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "531--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Krawetz:2005:SCM,
author = "Bryan Krawetz and John Lawrence and Jeffrey Shallit",
title = "State Complexity and the Monoid of Transformations of
a Finite Set",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "547--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yli-Jyra:2005:ADG,
author = "Anssi Yli-Jyr{\"a}",
title = "Approximating Dependency Grammars Through Intersection
of Star-Free Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "565--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fung:2005:OSU,
author = "Stanley P. Y. Fung and Francis Y. L. Chin and Hong
Shen",
title = "Online Scheduling of Unit Jobs with Bounded Importance
Ratio",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "581--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Subramani:2005:CRW,
author = "K. Subramani",
title = "Cascading Random Walks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "3",
pages = "599--??",
month = jun,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Calude:2005:P,
author = "Cristian S. Calude",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "4",
pages = "623--??",
month = aug,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Borchert:2005:DDP,
author = "Bernd Borchert and Klaus-J{\"o}rn Lange and Frank
Stephan and Pascal Tesson and Denis Th{\'e}rien",
title = "The Dot-Depth and the Polynomial Hierarchies
Correspond on the Delta Levels",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "4",
pages = "625--??",
month = aug,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dassow:2005:LFD,
author = "J{\"u}rgen Dassow and Markus Holzer",
title = "Language Families Defined by a Ciliate Bio-Operation:
Hierarchies and Decision Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "4",
pages = "645--??",
month = aug,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Freund:2005:SWS,
author = "Rudolf Freund",
title = "{$P$} Systems Working in the Sequential Mode on Arrays
and Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "4",
pages = "663--??",
month = aug,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2005:VNP,
author = "Oscar H. Ibarra and Hsu-Chun Yen and Zhe Dang",
title = "On Various Notions of Parallelism in {$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "4",
pages = "683--??",
month = aug,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lohrey:2005:DCA,
author = "Markus Lohrey",
title = "Decidability and Complexity in Automatic Monoids",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "4",
pages = "707--??",
month = aug,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Maletti:2005:RTS,
author = "Andreas Maletti",
title = "Relating Tree Series Transducers and Weighted Tree
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "4",
pages = "723--??",
month = aug,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Muscholl:2005:NCF,
author = "Anca Muscholl and Igor Walukiewicz",
title = "An {NP}-Complete Fragment of {LTL}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "4",
pages = "743--??",
month = aug,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
keywords = "linear time temporal logic (LTL)",
}
@Article{Rampersad:2005:WAP,
author = "Narad Rampersad",
title = "Words Avoiding $ \frac {7}{3}$-powers and the
{Thue--Morse} Morphism",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "4",
pages = "755--??",
month = aug,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rispal:2005:CRS,
author = "Chlo{\'e} Rispal and Olivier Carton",
title = "Complementation of Rational Sets on Countable
Scattered Linear Orderings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "4",
pages = "767--??",
month = aug,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Staiger:2005:IIF,
author = "Ludwig Staiger",
title = "Infinite Iterated Function Systems in {Cantor} Space
and the {Hausdorff} Measure of {$ \omega $}-Power
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "4",
pages = "787--??",
month = aug,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ito:2005:PTS,
author = "Takehiro Ito and Xiao Zhou and Takao Nishizeki",
title = "Partitioning Trees of Supply and Demand",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "4",
pages = "803--??",
month = aug,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jul 7 07:21:34 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2005:P,
author = "Anonymous",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "829--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brzozowski:2005:RSC,
author = "Janusz Brzozowski and Helmut J{\"u}rgensen",
title = "Representation of Semiautomata by Canonical Words and
Equivalences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "831--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
note = "See errata \cite{Brzozowski:2006:ERS}.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Champarnaud:2005:CTF,
author = "Jean-Marc Champarnaud and Franck Guingne and Georges
Hansel",
title = "Cover Transducers for Functions with Finite Domain",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "851--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dang:2005:OMS,
author = "Zhe Dang and Oscar H. Ibarra",
title = "On One-Membrane {$P$} Systems Operating in Sequential
Mode",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "867--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Domaratzki:2005:NUR,
author = "Michael Domaratzki and Keith Ellul and Jeffrey Shallit
and Ming-Wei Wang",
title = "Non-Uniqueness and Radius of Cyclic Unary {NFAs}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "883--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Domaratzki:2005:RST,
author = "Michael Domaratzki and Kai Salomaa",
title = "Restricted Sets of Trajectories and Decidability of
Shuffle Decompositions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "897--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Faliszewski:2005:ASS,
author = "Piotr Faliszewski and Lane A. Hemaspaandra",
title = "Advice for Semifeasible Sets and the
Complexity-Theoretic Cost(Lessness) of Algebraic
Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "913--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Freund:2005:ORC,
author = "Rudolf Freund and Marion Oswald and Andrei
P{\u{a}}un",
title = "Optimal Results for the Computational Completeness of
Gemmating (Tissue) {$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "929--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kapoutsis:2005:NRT,
author = "Christos Kapoutsis",
title = "Non-Recursive Trade-Offs for Two-Way Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "943--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kutrib:2005:PNR,
author = "Martin Kutrib",
title = "The Phenomenon of Non-Recursive Trade-Offs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "957--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Leung:2005:DCN,
author = "Hing Leung",
title = "Descriptional Complexity of {NFA} of Different
Ambiguity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "975--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Okhotin:2005:CAH,
author = "Alexander Okhotin",
title = "A Characterization of the Arithmetical Hierarchy by
Language Equations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "985--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Polak:2005:MNU,
author = "Libor Pol{\'a}k",
title = "Minimalizations of {NFA} Using the Universal
Automaton",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "999--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sunckel:2005:DCM,
author = "Bettina Sunckel",
title = "On the Descriptional Complexity of Metalinear {CD}
Grammar Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "1011--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{VanZijl:2005:MNS,
author = "Lynette {Van Zijl}",
title = "Magic Numbers for Symmetric Difference {NFAs}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "1027--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kari:2005:BFL,
author = "Lila Kari and Stavros Konstantinidis and Petr
Sos{\'i}k",
title = "Bond-Free Languages: Formalizations, Maximality and
Construction Methods",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "5",
pages = "1039--??",
month = oct,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 14 09:06:25 MDT 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holub:2005:F,
author = "Jan Holub",
title = "Foreword",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1071--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Amir:2005:TIS,
author = "Amihood Amir",
title = "Theoretical Issues of Searching Aerial Photographs: a
Bird's Eye View",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1075--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Arslan:2005:ACL,
author = "Abdullah N. Arslan and {\"O}mer
E{\u{g}}ecio{\u{g}}lu",
title = "Algorithms for the Constrained Longest Common
Subsequence Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1099--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cinque:2005:SLC,
author = "Luigi Cinque and Sergio {De Agostino} and Franco
Liberati and Bart Westgeest",
title = "A Simple Lossless Compression Heuristic for Grey Scale
Images",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1111--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fontaine:2005:BBA,
author = "Marc Fontaine and Stefan Burkhardt and Juha
K{\"a}rkk{\"a}inen",
title = "{BDD}-based Analysis of Gapped $q$-Gram Filters",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1121--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Franek:2005:SST,
author = "Frantisek Franek and W. F. Smyth",
title = "Sorting Suffixes of Two-Pattern Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1135--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Iliopoulos:2005:FAF,
author = "Costas S. Iliopoulos and James Mchugh and Pierre
Peterlongo and Nadia Pisanti and Wojciech Rytter and
Marie-France Sagot",
title = "A First Approach to Finding Common Motifs with Gaps",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1145--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Inenaga:2005:FCP,
author = "Shunsuke Inenaga and Ayumi Shinohara and Masayuki
Takeda",
title = "A Fully Compressed Pattern Matching Algorithm for
Simple Collage Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1155--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kaufman:2005:SLT,
author = "Yair Kaufman and Shmuel T. Klein",
title = "Semi-Lossless Text Compression",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1167--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mancheron:2005:CCL,
author = "Alban Mancheron and Christophe Moan",
title = "Combinatorial Characterization of the Language
Recognized by Factor and Suffix Oracles",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1179--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ngassam:2005:FDI,
author = "Ernest Ketcha Ngassam and Bruce W. Watson and Derrick
G. Kourie",
title = "A Framework for the Dynamic Implementation of Finite
Automata for Performance Enhancement",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1193--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Supol:2005:ACP,
author = "Jan {\v{S}}upol and Bo{\v{r}}ivoj Melichar",
title = "Arithmetic Coding in Parallel",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1207--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Laube:2005:CIS,
author = "Uli Laube and Maik Weinard",
title = "Conditional Inequalities and the Shortest Common
Superstring Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1219--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
note = "See erratum \cite{Laube:2006:ECI}.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2005:AAC,
author = "Lili Zhang and F. Blanchet-Sadri",
title = "Algorithms for Approximate {$K$}-Covering of Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1231--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Champarnaud:2005:ENA,
author = "J.-M. Champarnaud and F. Coulon",
title = "Enumerating Nondeterministic Automata for a Given
Language Without Constructing the Canonical Automaton",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1253--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ausiello:2005:CDA,
author = "Giorgio Ausiello and Cristina Bazgan and Marc Demange
and Vangelis Th. Paschos",
title = "Completeness in Differential Approximation Classes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1267--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Vinodchandran:2005:NCM,
author = "N. V. Vinodchandran",
title = "Nondeterministic Circuit Minimization Problem and
Derandomizing {Arthur--Merlin} Games",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1297--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2005:AIV,
author = "Anonymous",
title = "Author Index Volume 16 (2005)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1309--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Paun:2006:P,
author = "Gheorghe P{\u{a}}un and Mario J.
P{\'e}rez-Jim{\'e}nez",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "1--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alhazov:2006:CSC,
author = "Artiom Alhazov and Rudolf Freund and Marion Oswald",
title = "Cell\slash Symbol Complexity of Tissue {$P$} Systems
with Symport\slash Antiport Rules",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "3--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bianco:2006:SRM,
author = "Luca Bianco and Federico Fontana and Vincenzo Manca",
title = "{$P$} Systems with Reaction Maps",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "27--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cardelli:2006:URM,
author = "Luca Cardelli and Gheorghe P{\u{a}}un",
title = "An Universality Result for a (Mem)Brane Calculus Based
on Mate\slash Drip Operations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "49--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cavaliere:2006:FRT,
author = "Matteo Cavaliere and Vincenzo Deufemia",
title = "Further Results on Time-Free {$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "69--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ceterchi:2006:SCP,
author = "Rodica Ceterchi and Mario J. P{\'e}rez-Jim{\'e}nez",
title = "On Simulating a Class of Parallel Architectures",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "91--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ciobanu:2006:MMA,
author = "Gabriel Ciobanu and Mihai Gontineac",
title = "Mealy Multiset Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "111--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Leporati:2006:SIB,
author = "Alberto Leporati and Claudio Zandron and Miguel A.
Guti{\'e}rrez-Naranjo",
title = "{$P$} Systems with Input in Binary Form",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "127--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Muskulus:2006:CBC,
author = "Michael Muskulus and Robert Brijder",
title = "Complexity of Bio-Computation: Symbolic Dynamics in
Membrane Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "147--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Obtulowicz:2006:GPM,
author = "Adam Obtu{\l}owicz",
title = "{Gandy}'s Principles for Mechanisms and Membrane
Computing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "167--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pescini:2006:DPS,
author = "Dario Pescini and Daniela Besozzi and Giancarlo Mauri
and Claudio Zandron",
title = "Dynamical Probabilistic {$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "183--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sburlan:2006:FRS,
author = "Drago{\c{s}} Sburlan",
title = "Further Results on {$P$} Systems with Promoters\slash
Inhibitors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "205--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lu:2006:CRC,
author = "Shiyong Lu and Arthur J. Bernstein and Philip M.
Lewis",
title = "Completeness and Realizability: Conditions for
Automatic Generation of Workflows",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "223--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Laube:2006:ECI,
author = "U. Laube and M. Weinard",
title = "Erratum: {``Conditional Inequalities and the Shortest
Common Superstring Problem''}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "1",
pages = "247--??",
month = feb,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
note = "See \cite{Laube:2005:CIS}.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nakano:2006:P,
author = "Koji Nakano and Jacir L. Bordim",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "249--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rauber:2006:DRD,
author = "Thomas Rauber and Gudula R{\"u}nger",
title = "A Data Re-Distribution Library for Multi-Processor
Task Programming",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "251--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Roy:2006:RMW,
author = "Krishnendu Roy and Ramachandran Vaidyanathan and Jerry
L. Trahan",
title = "Routing Multiple Width Communications on the Circuit
Switched Tree",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "271--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hakem:2006:CPS,
author = "Mourad Hakem and Franck Butelle",
title = "Critical Path Scheduling Parallel Programs on an
Unbounded Number of Processors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "287--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Babvey:2006:SEI,
author = "Sharareh Babvey and Anu G. Bourgeois and Jos{\'e}
Alberto Fern{\'a}ndez-Zepeda and Steven W. Mclaughlin",
title = "Scalable and Efficient Implementations of the {LDPC}
Decoder Using Reconfigurable Models",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "303--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2006:SSA,
author = "Zhenyu Xu and Pradip K. Srimani",
title = "Self-Stabilizing Anonymous Leader Election in a Tree",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "323--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mahajan:2006:ABS,
author = "Meena Mahajan and Raghavan Rama and Venkatesh Raman
and S. Vijaykumar",
title = "Approximate Block Sorting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "337--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lu:2006:PFS,
author = "Shiyong Lu and Feng Cao and Yi Lu",
title = "{PAMA}: a Fast String Matching Algorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "357--378",
month = apr,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106003875",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "String matching is a fundamental operation in computer
science, and its performance has great impact on many
applications including database query, text processing,
DNA and protein sequence analysis. In this paper, we
propose a fast string matching algorithm, PAMA (PAttern
MAtching). The shift rule used by PAMA not only
subsumes both the bad character rule and the good
suffix rule employed by the well-known Boyer--Moore
algorithm, but also employs an additional key
observation to enable faster shifting during the string
matching process. Theoretically, we prove that from the
same alignment, the next shift of PAMA will be at least
as much as that of the Boyer--Moore algorithm.
Experimentally, we show that PAMA indeed significantly
outperforms the original Boyer--Moore algorithm in
almost all cases, and outperforms other Boyer--Moore
variants such as Tuned-BM, Turbo-BM and Horspool for
long patterns (length $ \geq 128$) or for small
alphabets (size $ < 8$).",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Han:2006:IFR,
author = "Yo-Sub Han and Yajun Wang and Derick Wood",
title = "Infix-Free Regular Expressions and Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "379--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gazdag:2006:DSP,
author = "Zsolt Gazdag",
title = "Decidability of the Shape Preserving Property of
Bottom-Up Tree Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "395--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hsu:2006:SCS,
author = "Hong-Chun Hsu and Cheng-Kuan Lin and Hua-Min Hung and
Lih-Hsing Hsu",
title = "The Spanning Connectivity of the $ (n, k)$-Star
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "415--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jonoska:2006:TTD,
author = "Nata{\v{s}}a Jonoska and Joni Burnette Pirnot",
title = "Transitivity in Two-Dimensional Local Languages
Defined by Dot Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "435--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Honkala:2006:BPD,
author = "Juha Honkala",
title = "The Base Problem for {D0L} {Parikh} Sets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "465--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ehrenfeucht:2006:CT,
author = "A. Ehrenfeucht and G. Rozenberg",
title = "Covers from Templates",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "2",
pages = "475--??",
month = apr,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{DeFelice:2006:P,
author = "Clelia {De Felice} and Antonio Restivo",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "3",
pages = "489--??",
month = jun,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Afonin:2006:MFP,
author = "Sergey Afonin and Elena Khazova",
title = "Membership and Finiteness Problems for Rational Sets
of Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "3",
pages = "493--??",
month = jun,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ananichev:2006:CWP,
author = "D. S. Ananichev and I. V. Petrov and M. V. Volkov",
title = "Collapsing Words: a Progress Report",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "3",
pages = "507--??",
month = jun,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bes:2006:KTL,
author = "Alexis B{\`e}s and Olivier Carton",
title = "A {Kleene} Theorem for Languages of Words Indexed by
Linear Orderings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "3",
pages = "519--??",
month = jun,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brlek:2006:PCP,
author = "S. Brlek and G. Labelle and A. Lacasse",
title = "Properties of the Contour Path of Discrete Sets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "3",
pages = "543--??",
month = jun,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{DeLuca:2006:CPS,
author = "Aldo {De Luca} and Alessandro {De Luca}",
title = "Combinatorial Properties of {Sturmian} Palindromes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "3",
pages = "557--??",
month = jun,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Thomas:2006:MSS,
author = "Fernique Thomas",
title = "Multidimensional {Sturmian} Sequences and Generalized
Substitutions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "3",
pages = "575--??",
month = jun,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Freydenberger:2006:UMI,
author = "Dominik D. Freydenberger and Daniel Reidenbach and
Johannes C. Schneider",
title = "Unambiguous Morphic Images of Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "3",
pages = "601--??",
month = jun,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Okhotin:2006:GLP,
author = "Alexander Okhotin",
title = "Generalized {LR} Parsing Algorithm for {Boolean}
Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "3",
pages = "629--??",
month = jun,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pribavkina:2006:SPL,
author = "Elena V. Pribavkina",
title = "On Some Properties of the Language of $2$-Collapsing
Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "3",
pages = "665--??",
month = jun,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tsin:2006:EDA,
author = "Yung H. Tsin",
title = "An Efficient Distributed Algorithm for
$3$-Edge-Connectivity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "3",
pages = "677--??",
month = jun,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fukagawa:2006:FAC,
author = "Daiji Fukagawa and Tatsuya Akutsu",
title = "Fast Algorithms for Comparison of Similar Unordered
Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "3",
pages = "703--??",
month = jun,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2006:P,
author = "Farn Wang",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "731--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Emerson:2006:MMC,
author = "E. Allen Emerson and Kristina D. Hager and Jay H.
Konieczka",
title = "Molecular Model Checking",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "733--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Peled:2006:ECT,
author = "Doron Peled and Hongyang Qu",
title = "Enforcing Concurrent Temporal Behaviors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "743--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mang:2006:CCA,
author = "Freddy Y. C. Mang and Pei-Hsin Ho",
title = "Controllability and Cooperativeness Analysis for
Automatic Abstraction Refinement",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "763--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yu:2006:SBM,
author = "Fang Yu and Bow-Yaw Wang",
title = "{SAT}-Based Model Checking for Region Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "775--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Malik:2006:CFT,
author = "Robi Malik and David Streader and Steve Reeves",
title = "Conflicts and Fair Testing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "797--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bertolotti:2006:EST,
author = "Ivan Cibrario Bertolotti and Luca Durante and Riccardo
Sisto and Adriano Valenzano",
title = "Exploiting Symmetries for Testing Equivalence
Verification in the {Spi} Calculus",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "815--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nakata:2006:TFE,
author = "Akio Nakata and Tadaaki Tanimoto and Suguru Sasaki and
Teruo Higashino",
title = "A Timed Failure Equivalence Preserving Abstraction for
Parametric Time-Interval Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "833--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Friedgut:2006:BCM,
author = "Ehud Friedgut and Orna Kupferman and Moshe Y. Vardi",
title = "{B{\"u}chi} Complementation Made Tighter",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "851--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kupferman:2006:TRA,
author = "Orna Kupferman and Gila Morgenstern and Aniello
Murano",
title = "Typeness for {$ \omega $}-Regular Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "869--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fehnker:2006:HSV,
author = "Ansgar Fehnker and Bruce Krogh",
title = "Hybrid System Verification is Not a Sinecure --- The
Electronic Throttle Control Case Study",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "885--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Akutsu:2006:APS,
author = "Tatsuya Akutsu",
title = "Algorithms for Point Set Matching with
$k$-Differences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "903--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gravier:2006:QOG,
author = "Sylvain Gravier and Philippe Jorrand and Mehdi Mhalla
and Charles Payan",
title = "Quantum Octal Games",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "919--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Qi:2006:SSP,
author = "Xingqin Qi and Guojun Li and Jichang Wu and Bingqiang
Liu",
title = "Sorting Signed Permutations by Fixed-Length
Reversals",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "933--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ye:2006:CTS,
author = "Yuli Ye and Janusz Brzozowski",
title = "Covering of Transient Simulation of Feedback-Free
Circuits by Binary Analysis",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "949--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Paun:2006:STS,
author = "Gheorghe P{\u{a}}un and Mario J. P{\'e}rez-Jim{\'e}nez
and Grzegorz Rozenberg",
title = "Spike Trains in Spiking Neural {$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "4",
pages = "975--??",
month = aug,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:18 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hong:2006:P,
author = "Seok-Hee Hong and Hsu-Chun Yen",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1003--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Borozky:2006:PCN,
author = "K{\'a}roly J. B{\"o}r{\"o}zky and J{\'a}nos Pach and
G{\'e}za T{\'o}th",
title = "Planar Crossing Numbers of Graphs Embeddable in
Another Surface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1005--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{DeFraysseix:2006:TTP,
author = "Hubert {De Fraysseix} and Patrice {Ossona De Mendez}
and Pierre Rosenstiehl",
title = "{Tr{\'e}maux} Trees and Planarity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1017--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Miura:2006:CGD,
author = "Kazuyuki Miura and Shin-Ichi Nakano and Takao
Nishizeki",
title = "Convex Grid Drawings of Four-Connected Plane Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1031--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Patrignani:2006:EPS,
author = "Maurizio Patrignani",
title = "On Extending a Partial Straight-Line Drawing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1061--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{DiGiacomo:2006:EGT,
author = "Emilio {Di Giacomo} and Giuseppe Liotta and Francesco
Trotta",
title = "On Embedding a Graph on Two Sets of Points",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1071--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Healy:2006:TFP,
author = "Patrick Healy and Karol Lynch",
title = "Two Fixed-Parameter Tractable Algorithms for Testing
Upward Planarity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1095--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Miura:2006:CDP,
author = "Kazuyuki Miura and Machiko Azuma and Takao Nishizeki",
title = "Convex Drawings of Plane Graphs of Minimum Outer
Apices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1115--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2006:AWO,
author = "Huaming Zhang and Xin He",
title = "An Application of Well-Orderly Trees in Graph
Drawing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1129--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Duncan:2006:DFE,
author = "Christian A. Duncan and Alon Efrat and Stephen
Kobourov and Carola Wenk",
title = "Drawing with Fat Edges",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1143--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nagamochi:2006:PSR,
author = "Hiroshi Nagamochi",
title = "Packing Soft Rectangles",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1165--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tosic:2006:CCF,
author = "Predrag T. To{\v{s}}i{\'c}",
title = "On the Complexity of Counting Fixed Points and
{Gardens of Eden} in Sequential Dynamical Systems on
Planar Bipartite Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1179--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Safavi-Naini:2006:RLS,
author = "Reihaneh Safavi-Naini and Huaxiong Wang and Duncan S.
Wong",
title = "Resilient {LKH}: Secure Multicast Key Distribution
Schemes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1205--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
keywords = "LKH (Logical Key Hierarchy)",
}
@Article{Krivka:2006:GLR,
author = "Zbyn{\v{e}}k K{\v{r}}ivka and Alexander Meduna and
Rudolf Sch{\"o}necker",
title = "Generation of Languages by Rewriting Systems That
Resemble Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1223--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brzozowski:2006:ERS,
author = "Janusz Brzozowski and Helmut J{\"u}rgensen",
title = "Errata: {{\em Representation of Semiautomata by
Canonical Words and Equivalences}}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "5",
pages = "1231--??",
month = oct,
year = "2006",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 20 10:46:27 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
note = "See \cite{Brzozowski:2005:RSC}.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holub:2006:F,
author = "Jan Holub",
title = "Foreword",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1233--1234",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004376",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "31 August 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cantone:2006:SEB,
author = "Domenico Cantone and Simone Faro",
title = "A Space Efficient Bit-Parallel Algorithm for the
Multiple String Matching Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1235--1251",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004388",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cleophas:2006:TRA,
author = "Loek Cleophas and Kees Hemerik and Gerard Zwaan",
title = "Two Related Algorithms for Root-To-Frontier Tree
Pattern Matching",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1253--1272",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410600439X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{DeAgostino:2006:BSD,
author = "Sergio {De Agostino}",
title = "Bounded Size Dictionary Compression: Relaxing the
{LRU} Deletion Heuristic",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1273--1280",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004406",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Franek:2006:RSA,
author = "Frantisek Franek and William F. Smyth",
title = "Reconstructing a Suffix Array",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1281--1295",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004418",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Klein:2006:CPM,
author = "Shmuel T. Klein and Dana Shapira",
title = "Compressed Pattern Matching in {JPEG} Images",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1297--1306",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410600442X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ngassam:2006:DAF,
author = "Ernest Ketcha Ngassam and Bruce W. Watson and Derrick
G. Kourie",
title = "Dynamic Allocation of Finite Automata States for Fast
String Recognition",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1307--1323",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004431",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hyyro:2006:BPC,
author = "Heikki Hyyr{\"o} and Gonzalo Navarro",
title = "Bit-Parallel Computation of Local Similarity Score
Matrices with Unitary Weights",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1325--1344",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004443",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fredriksson:2006:FMR,
author = "Kimmo Fredriksson and Veli M{\"a}kinen and Gonzalo
Navarro",
title = "Flexible Music Retrieval in Sublinear Time",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1345--1364",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004455",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Grabowski:2006:SAI,
author = "Szymon Grabowski and Gonzalo Navarro and Rafa{\L}
Przywarski and Alejandro Salinger and Veli
M{\"a}kinen",
title = "A Simple Alphabet-Independent {FM}-Index",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1365--1384",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004467",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Prieur:2006:STS,
author = "{\'E}lise Prieur and Thierry Lecroq",
title = "From Suffix Trees to Suffix Vectors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1385--1402",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004479",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Liu:2006:ESM,
author = "Joseph K. Liu and Duncan S. Wong",
title = "Enhanced Security Models and a Generic Construction
Approach for Linkable Ring Signature",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1403--1422",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004480",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Paquette:2006:FBB,
author = "Michel Paquette and Andrzej Pelc",
title = "Fast Broadcasting with {Byzantine} Faults",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1423--1439",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004492",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2006:MTW,
author = "Shuguang Li and Guojun Li and Xingqin Qi",
title = "Minimizing Total Weighted Completion Time on Identical
Parallel Batch Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1441--1453",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004509",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Elmasry:2006:PQW,
author = "Amr Elmasry",
title = "A Priority Queue with the Working-Set Property",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1455--1465",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004510",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wernicke:2006:CCA,
author = "Sebastian Wernicke and Jochen Alber and Jens Gramm and
Jiong Guo and Rolf Niedermeier",
title = "The Computational Complexity of Avoiding Forbidden
Submatrices by Row Deletions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1467--1484",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004522",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2006:AIV,
author = "Anonymous",
title = "Author Index Volume 17 (2006)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1485--1490",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054106004522",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Peled:2007:P,
author = "Doron A. Peled and Yih-Kuen Tsay",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "1",
pages = "1--3",
month = feb,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004541",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Balaban:2007:MRA,
author = "Ittai Balaban and Amir Pnueli and Lenore D. Zuck",
title = "Modular Ranking Abstraction",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "1",
pages = "5--44",
month = feb,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004553",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fix:2007:VVL,
author = "Limor Fix and Orna Grumberg and Amnon Heyman and Tamir
Heyman and Assaf Schuster",
title = "Verifying Very Large Industrial Circuits Using 100
Processes and Beyond",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "1",
pages = "45--61",
month = feb,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004565",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Damm:2007:GTV,
author = "Werner Damm and Guilherme Pinto and Stefan Ratschan",
title = "Guaranteed Termination in the Verification of {LTL}
Properties of Non-Linear Robust Discrete Time Hybrid
Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "1",
pages = "63--86",
month = feb,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004577",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Demri:2007:RAT,
author = "St{\'e}phane Demri and David Nowak",
title = "Reasoning About Transfinite Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "1",
pages = "87--112",
month = feb,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004589",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Schewe:2007:SAD,
author = "Sven Schewe and Bernd Finkbeiner",
title = "Semi-Automatic Distributed Synthesis",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "1",
pages = "113--138",
month = feb,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004590",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lauer:2007:UEDa,
author = "Tobias Lauer and Thomas Ottmann and Amitava Datta",
title = "Update-Efficient Data Structures for Dynamic {IP}
Router Tables",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "1",
pages = "139--161",
month = feb,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004607",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alhazov:2007:MCS,
author = "Artiom Alhazov and Yurii Rogozhin and Sergey Verlan",
title = "Minimal Cooperation in Symport\slash Antiport Tissue
{$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "1",
pages = "163--179",
month = feb,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004619",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Honkala:2007:DEP,
author = "Juha Honkala",
title = "The {D0L} $ \omega $-Equivalence Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "1",
pages = "181--194",
month = feb,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004620",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gudmundsson:2007:P,
author = "Joachim Gudmundsson and Barry Jay",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "195--196",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004632",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Asahiro:2007:GOA,
author = "Yuichi Asahiro and Eiji Miyano and Hirotaka Ono and
Kouhei Zenmyo",
title = "Graph Orientation Algorithms to Minimize the Maximum
Outdegree",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "197--215",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004644",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dessmark:2007:AMM,
author = "Anders Dessmark and Jesper Jansson and Andrzej Lingas
and Eva-Marta Lundell and Mia Persson",
title = "On the Approximability of Maximum and Minimum Edge
Clique Partition Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "217--226",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004656",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Herlihy:2007:KBE,
author = "Brian Herlihy and Peter Schachte and Harald
S{\o}ndergaard",
title = "Un-{Kleene} {Boolean} Equation Solving",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "227--250",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004668",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Poon:2007:DBB,
author = "Chung Keung Poon and Feifeng Zheng and Yinfeng Xu",
title = "On-Demand Bounded Broadcast Scheduling with Tight
Deadlines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "251--262",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410700467X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Takaoka:2007:FLA,
author = "Tadao Takaoka and Stephen Violich",
title = "Fusing Loopless Algorithms for Combinatorial
Generation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "263--293",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004681",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lauer:2007:UEDb,
author = "Tobias Lauer and Thomas Ottmann and Amitava Datta",
title = "Update-Efficient Data Structures for Dynamic {IP}
Router Tables",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "295--317",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004693",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bae:2007:ADM,
author = "Sung Eun Bae and Tadao Takaoka",
title = "Algorithms for {$K$}-Disjoint Maximum Subarrays",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "319--339",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410700470X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Leung:2007:STM,
author = "Joseph Y.-T. Leung and Haibing Li and Hairong Zhao",
title = "Scheduling Two-Machine Flow Shops with Exact Delays",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "341--359",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004711",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jurdzinski:2007:SRA,
author = "Tomasz Jurdzi{\'n}ski and Friedrich Otto",
title = "Shrinking Restarting Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "361--385",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004723",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Atanasiu:2007:BAW,
author = "Adrian Atanasiu",
title = "Binary Amiable Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "387--400",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004735",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jansson:2007:ODR,
author = "Jesper Jansson and Zeshan Peng",
title = "Online and Dynamic Recognition of Squarefree Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "401--414",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004747",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cienciala:2007:PDS,
author = "Lud{\v{e}}k Cienciala and Lucie Ciencialov{\'a} and
Pierluigi Frisco and Petr Sos{\'i}k",
title = "On the Power of Deterministic and Sequential
Communicating {$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "2",
pages = "415--431",
month = apr,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004759",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordim:2007:P,
author = "Jacir L. Bordim and Koji Nakano",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "433--434",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004760",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Paun:2007:SNS,
author = "Gheorghe P{\u{a}}un and Mario J. P{\'e}rez-Jim{\'e}nez
and Arto Salomaa",
title = "Spiking Neural {$P$} Systems: an Early Survey",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "435--455",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004772",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Luccio:2007:NDP,
author = "Fabrizio Luccio and Linda Pagli and Nicola Santoro",
title = "Network Decontamination in Presence of Local
Immunity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "457--474",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004784",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fujiwara:2007:PCM,
author = "Akihiro Fujiwara and Satoshi Kamio and Akiko
Takehara",
title = "Procedures for Computing the Maximum with {DNA}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "475--493",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004796",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Quaglia:2007:SDB,
author = "Francesco Quaglia",
title = "Software Diversity-Based Active Replication As an
Approach for Enhancing the Performance of Advanced
Simulation Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "495--515",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004802",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ito:2007:EHA,
author = "Yasuaki Ito and Koji Nakano and Youhei Yamagishi",
title = "Efficient Hardware Algorithms for {$n$} Choose {$k$}
Counters Using the Bitonic Merger",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "517--528",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004814",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Becha:2007:OCS,
author = "Hanane Becha and Paola Flocchini",
title = "Optimal Construction of Sense of Direction in a Torus
by a Mobile Agent",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "529--546",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004826",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Flocchini:2007:DCR,
author = "Paola Flocchini and Miao Jun Huang and Flaminia L.
Luccio",
title = "Decontaminating Chordal Rings and Tori Using Mobile
Agents",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "547--563",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004838",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Soper:2007:IAA,
author = "Alan J. Soper and Vitaly A. Strusevich",
title = "An Improved Approximation Algorithm for the
Two-Machine Flow Shop Scheduling Problem with an
Interstage Transporter",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "565--591",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410700484X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aziz:2007:MAP,
author = "Benjamin Aziz and Geoff Hamilton",
title = "Modelling and Analysis of {PKI}-Based Systems Using
Process Calculi",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "593--618",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004851",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Das:2007:IAM,
author = "Gautam K. Das and Sasthi C. Ghosh and Subhas C.
Nandy",
title = "Improved Algorithm for Minimum Cost Range Assignment
Problem for Linear Radio Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "619--635",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004863",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gruska:2007:FSS,
author = "Jozef Gruska and Salvatore {La Torre} and Mimmo
Parente",
title = "The Firing Squad Synchronization Problem on Squares,
Toruses and Rings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "637--654",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004875",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shur:2007:RAP,
author = "Arseny M. Shur",
title = "Rational Approximations of Polynomial Factorial
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "3",
pages = "655--665",
month = jun,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004887",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2007:P,
author = "Oscar H. Ibarra and Hsu-Chun Yen",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "667--668",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004899",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2007:IDA,
author = "Ming Li",
title = "Information Distance and Its Applications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "669--681",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004905",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Salomaa:2007:SCC,
author = "Kai Salomaa and Sheng Yu",
title = "On the State Complexity of Combined Operations and
Their Estimation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "683--698",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004917",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Abdulla:2007:BMT,
author = "Parosh Aziz Abdulla and Johanna H{\"o}gberg and Lisa
Kaati",
title = "Bisimulation Minimization of Tree Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "699--713",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004929",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bastien:2007:RSG,
author = "C{\'e}dric Bastien and Jurek Czyzowicz and Wojciech
Fraczak and Wojciech Rytter",
title = "Reducing Simple Grammars: Exponential Against
Highly-Polynomial Time in Practice",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "715--725",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004930",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bloem:2007:SIA,
author = "Roderick Bloem and Alessandro Cimatti and Ingo Pill
and Marco Roveri",
title = "Symbolic Implementation of Alternating Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "727--743",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004942",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordihn:2007:HEF,
author = "Henning Bordihn and Markus Holzer and Martin Kutrib",
title = "Hybrid Extended Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "745--760",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004954",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cortes:2007:DEP,
author = "Corinna Cortes and Mehryar Mohri and Ashish Rastogi",
title = "{$ L_p $} Distance and Equivalence of Probabilistic
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "761--779",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004966",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Crochemore:2007:SFO,
author = "Maxime Crochemore and Lucian Ilie and Emine
Seid-Hilmi",
title = "The Structure of Factor Oracles",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "781--797",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004978",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Giraud:2007:PED,
author = "Mathieu Giraud and Phillipe Veber and Dominique
Lavenier",
title = "Path-Equivalent Developments in Acyclic Weighted
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "799--811",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410700498X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Glockler:2007:FAU,
author = "Jens Gl{\"o}ckler",
title = "Forgetting Automata and Unary Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "813--827",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107004991",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Maletti:2007:PS,
author = "Andreas Maletti",
title = "Pure and {$O$}-Substitution",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "829--845",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005005",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nicart:2007:LMT,
author = "Florent Nicart and Jean-Marc Champarnaud and Tibor
Cs{\'a}ki and Tam{\'a}s Ga{\'a}l and Andr{\'e} Kempe",
title = "Labelling Multi-Tape Automata with Constrained Symbol
Classes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "847--858",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005017",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Simunek:2007:BFA,
author = "Martin {\v{S}}im{\ocirc{u}}nek and Bo{\v{r}}ivoj
Melichar",
title = "Borders and Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "859--871",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005029",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Czeizler:2007:NPS,
author = "Elena Czeizler and Juhani Karhum{\"a}ki",
title = "On Non-Periodic Solutions of Independent Systems of
Word Equations Over Three Unknowns",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "873--897",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005030",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Balla:2007:EAD,
author = "Sudha Balla and Sanguthevar Rajasekaran and Ion I.
Mandoiu",
title = "Efficient Algorithms for Degenerate Primer Search",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "4",
pages = "899--910",
month = aug,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005042",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Uehara:2007:CLP,
author = "Ryuhei Uehara and Yushi Uno",
title = "On Computing Longest Paths in Small Graph Classes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "911--930",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005054",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Halava:2007:UBI,
author = "Vesa Halava and Tero Harju and Mika Hirvensalo",
title = "Undecidability Bounds for Integer Matrices Using
{Claus} Instances",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "931--948",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005066",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ravikumar:2007:ELD,
author = "Bala Ravikumar and Nicolae Santean",
title = "On the Existence of Lookahead Delegators for {NFA}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "949--973",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005078",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Couceiro:2007:EVI,
author = "Miguel Couceiro and Erkko Lehtonen",
title = "On the Effect of Variable Identification on the
Essential Arity of Functions on Finite Sets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "975--986",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410700508X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chai:2007:EIB,
author = "Zhenchuan Chai and Zhenfu Cao and Xiaolei Dong",
title = "Efficient {ID}-Based Multi-Receiver Threshold
Decryption",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "987--1004",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005091",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cheng:2007:FRC,
author = "Eddie Cheng and L{\'a}szl{\'o} Lipt{\'a}k",
title = "Fault Resiliency of {Cayley} Graphs Generated by
Transpositions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "1005--1022",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005108",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Urgaonkar:2007:APC,
author = "Bhuvan Urgaonkar and Arnold L. Rosenberg and Prashant
Shenoy",
title = "Application Placement on a Cluster of Servers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "1023--1041",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410700511X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lin:2007:FSS,
author = "Cho-Chin Lin",
title = "A Framework for Solving Sequence Problem of Multiple
Input Streams",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "1043--1064",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005121",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brzozowski:2007:RSC,
author = "Janusz Brzozowski and Helmut J{\"u}rgensen",
title = "Representation of Semiautomata by Canonical Words and
Equivalences, {Part II}: Specification of Software
Modules",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "1065--1087",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005133",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kari:2007:IBW,
author = "Lila Kari and Kalpana Mahalingam",
title = "Involutively Bordered Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "1089--1106",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005145",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mandal:2007:MAB,
author = "Partha Sarathi Mandal and Krishnendu Mukhopadhyaya",
title = "Mobile Agent Based Checkpointing with Concurrent
Initiations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "1107--1122",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005157",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ishdorj:2007:CPI,
author = "Tseren-Onolt Ishdorj and Ion Petre and Vladimir
Rogojin",
title = "Computational Power of Intramolecular Gene Assembly",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "1123--1136",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005169",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordihn:2007:PAL,
author = "Henning Bordihn and Bernd Reichel and Ralf Stiebe and
Bianca Truthe",
title = "Preface: Aspects in Language and Automata Theory:
Special Issue Dedicated to {J{\"u}rgen Dassow}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1137--1138",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005170",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Asveld:2007:GAC,
author = "Peter R. J. Asveld",
title = "Generating All Circular Shifts by Context-Free
Grammars in {Greibach Normal Form}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1139--1149",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005182",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bhika:2007:TDC,
author = "Charita Bhika and Sigrid Ewert and Ryan Schwartz and
Mutahi Waruhiu",
title = "Table-Driven Context-Free Picture Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1151--1160",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005194",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Boldt:2007:SLN,
author = "Oliver Boldt and Helmut J{\"u}rgensen",
title = "Soliton Languages Are Nearly an Anti-{AFL}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1161--1165",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005200",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Czeizler:2007:ISW,
author = "Elena Czeizler and {\v{S}}t{\v{e}}p{\'a}n Holub and
Juhani Karhum{\"a}ki and Markku Laine",
title = "Intricacies of Simple Word Equations: an Example",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1167--1175",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005212",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Daley:2007:IMT,
author = "Mark Daley and Michael Domaratzki and Alexis Morris",
title = "Intra-Molecular Template-Guided Recombination",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1177--1186",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005224",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Drewes:2007:L,
author = "Frank Drewes",
title = "Links",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1187--1196",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005236",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Esik:2007:BFS,
author = "Zolt{\'a}n {\'E}sik and Werner Kuich",
title = "{Boolean} Fuzzy Sets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1197--1207",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005248",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fernau:2007:PGR,
author = "Henning Fernau",
title = "Programmed Grammars with Rule Queues",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1209--1213",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410700525X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Freund:2007:PHS,
author = "Rudolf Freund and Marion Oswald",
title = "Partial Halting in {$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1215--1225",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005261",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gao:2007:SSP,
author = "Yan Gao and Hendrik Jan Hoogeboom",
title = "{$P$} Systems with Single Passenger Carriers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1227--1235",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005273",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gecseg:2007:CTL,
author = "Ferenc G{\'e}cseg",
title = "Classes of Tree Languages Determined by Classes of
Monoids",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1237--1246",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005285",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2007:CRL,
author = "Oscar H. Ibarra and Sara Woodworth",
title = "Characterizing Regular Languages by Spiking Neural
{$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1247--1256",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005297",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jurgensen:2007:SAB,
author = "Helmut J{\"u}rgensen and Pauline Kraak",
title = "Soliton Automata Based on Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1257--1270",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005303",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Klein:2007:CFG,
author = "Andreas Klein and Martin Kutrib",
title = "Context-Free Grammars with Linked Nonterminals",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1271--1282",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005315",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kudlek:2007:SRQ,
author = "Manfred Kudlek",
title = "Some Remarks on Quantum Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1283--1292",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005327",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kutrib:2007:WCR,
author = "Martin Kutrib and Andreas Malcher",
title = "When {Church--Rosser} Becomes Context Free",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1293--1302",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005339",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Magalini:2007:PCU,
author = "Enzo Magalini and Giovanni Pighizzini",
title = "A Pumping Condition for Ultralinear Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1303--1312",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005340",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Malcher:2007:MPC,
author = "Andreas Malcher and Bettina Sunckel",
title = "On Metalinear Parallel Communicating Grammar Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1313--1322",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005352",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Martin-Vide:2007:DPP,
author = "Carlos Martin-Vide and Victor Mitrana",
title = "Decision Problems on Path-Controlled Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1323--1332",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005364",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Messerschmidt:2007:CDS,
author = "Hartmut Messerschmidt and Friedrich Otto",
title = "Cooperating Distributed Systems of Restarting
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1333--1342",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005376",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mraz:2007:ARA,
author = "Franti{\v{s}}ek Mr{\'a}z and Martin Pl{\'a}tek and
Tomasz Jurdzi{\'n}ski",
title = "Ambiguity by Restarting Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1343--1352",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005388",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nishida:2007:MAB,
author = "Taishin Y. Nishida",
title = "Membrane Algorithm with {Brownian} Subalgorithm and
Genetic Subalgorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1353--1360",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410700539X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Okhotin:2007:NDC,
author = "Alexander Okhotin",
title = "Notes on Dual Concatenation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1361--1370",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005406",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Paun:2007:CMS,
author = "Gheorghe P{\u{a}}un and Mario J. P{\'e}rez-Jim{\'e}nez
and Grzegorz Rozenberg",
title = "Computing Morphisms by Spiking Neural {$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1371--1382",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005418",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Reinhardt:2007:THH,
author = "Klaus Reinhardt",
title = "A Tree-Height Hierarchy of Context-Free Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1383--1394",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410700542X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Salomaa:2007:CSO,
author = "Arto Salomaa",
title = "Comparing Subword Occurrences in Binary {D0L}
Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1395--1406",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005431",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Salomaa:2007:SCA,
author = "Kai Salomaa and Paul Schofield",
title = "State Complexity of Additive Weighted Finite
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1407--1416",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005443",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Staiger:2007:PFL,
author = "Ludwig Staiger",
title = "Prefix-Free {{\L}ukasiewicz} Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1417--1423",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005455",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Beek:2007:CCG,
author = "Maurice H. Ter Beek and Erzs{\'e}bet Csuhaj-Varj{\'u}
and Gy{\"o}rgy Vaszil and Markus Holzer",
title = "On Competence in {CD} Grammar Systems with Parallel
Rewriting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1425--1439",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005467",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yu:2007:SEO,
author = "Sheng Yu and Qing Zhao",
title = "{SC}-Expressions in Object-Oriented Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1441--1452",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005479",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2007:AIV,
author = "Anonymous",
title = "Author Index Volume 18 (2007)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "6",
pages = "1453--1459",
month = dec,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005479",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holub:2008:F,
author = "Jan Holub",
title = "Foreword",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "1--3",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005498",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lancia:2008:FLM,
author = "Giuseppe Lancia and Franca Rinaldi and Romeo Rizzi",
title = "Flipping Letters to Minimize the Support of a String",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "5--17",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005504",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Melodelima:2008:MAA,
author = "Christelle Melodelima and Laurent Gueguen and
Christian Gautier and Didier Piau",
title = "A {Markovian} Approach for the Analysis of the Gene
Structure",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "19--35",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005516",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Christodoulakis:2008:IRM,
author = "Manolis Christodoulakis and Costas S. Iliopoulos and
M. Sohel Rahman and William F. Smyth",
title = "Identifying Rhythms in Musical Texts",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "37--51",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005528",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ngassam:2008:IPT,
author = "Ernest Ketcha Ngassam and Derrick G. Kourie and Bruce
W. Watson",
title = "On Implementation and Performance of Table-Driven
{DFA}-Based String Processors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "53--70",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410800553X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Peterlongo:2008:IGF,
author = "Pierre Peterlongo and Julien Allali and Marie-France
Sagot",
title = "Indexing Gapped-Factors Using a Tree",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "71--87",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005541",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Conley:2008:UAM,
author = "Ehud S. Conley and Shmuel T. Klein",
title = "Using Alignment for Multilingual Text Compression",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "89--101",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005553",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cantone:2008:SCP,
author = "Domenico Cantone and Salvatore Cristofaro and Simone
Faro",
title = "On Some Combinatorial Problems Concerning the Harmonic
Structure of Musical Chord Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "103--124",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005565",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Strauss:2008:CSB,
author = "Tinus Strauss and Derrick G. Kourie and Bruce W.
Watson",
title = "A Concurrent Specification of {Brzozowski}'s {DFA}
Construction Algorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "125--135",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005577",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Klein:2008:MDE,
author = "Shmuel T. Klein and Tamar C. Serebro and Dana
Shapira",
title = "Modeling Delta Encoding of Compressed Files",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "137--146",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005589",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Higa:2008:RST,
author = "Yasuto Higa and Hideo Bannai and Shunsuke Inenaga and
Masayuki Takeda",
title = "Reachability on Suffix Tree Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "147--162",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005590",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fredriksson:2008:EAM,
author = "Kimmo Fredriksson and Szymon Grabowski",
title = "Efficient algorithms for $ (\delta, \gamma, \alpha) $
and $ (\delta, \kappa_\delta, \alpha)$-matching",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "163--183",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005607",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Watson:2008:EAC,
author = "Bruce W. Watson and Derrick G. Kourie and Tinus
Strauss and Ernest Ketcha and Loek Cleophas",
title = "Efficient Automata Constructions and Approximate
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "185--193",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005619",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Franek:2008:ALB,
author = "Frantisek Franek and Qian Yang",
title = "An Asymptotic Lower Bound for the Maximal Number of
Runs in a String",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "195--203",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005620",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lindell:2008:NFF,
author = "Steven Lindell",
title = "A Normal Form for First-Order Logic Over Doubly-Linked
Data Structures",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "205--217",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005632",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cortes:2008:CRE,
author = "Corinna Cortes and Mehryar Mohri and Ashish Rastogi
and Michael Riley",
title = "On the Computation of the Relative Entropy of
Probabilistic Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "219--242",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005644",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cerny:2008:SSW,
author = "Anton {\v{C}}ern{\'y}",
title = "On Subword Symmetry of Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "1",
pages = "243--250",
month = feb,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005656",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yahia:2008:P,
author = "Sadok Ben Yahia and Engelbert Mephu Nguifo",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "2",
pages = "251--254",
month = apr,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005668",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Belohlavek:2008:FFS,
author = "Radim B{\v{e}}lohl{\'a}vek and Jan Outrata and Vilem
Vychodil",
title = "Fast Factorization by Similarity of Fuzzy Concept
Lattices with Hedges",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "2",
pages = "255--269",
month = apr,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410800567X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hamrouni:2008:SMG,
author = "Tarek Hamrouni and Sadok {Ben Yahia} and Engelbert
Mephu Nguifo",
title = "Succinct Minimal Generators: Theoretical Foundations
and Applications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "2",
pages = "271--296",
month = apr,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005681",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Belohlavek:2008:BAA,
author = "Radim B{\v{e}}lohl{\'a}vek and Vilem Vychodil",
title = "Basic Algorithm for Attribute Implications and
Functional Dependencies in Graded Setting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "2",
pages = "297--317",
month = apr,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005693",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cellier:2008:PAE,
author = "Peggy Cellier and S{\'e}bastien Ferr{\'e} and Olivier
Ridoux and Mireille Ducass{\'e}",
title = "A Parameterized Algorithm to Explore Formal Contexts
with a Taxonomy",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "2",
pages = "319--343",
month = apr,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410800570X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kaiser:2008:AAT,
author = "Tim B. Kaiser and Stefan E. Schmidt and Cliff A.
Joslyn",
title = "Adjusting Annotated Taxonomies",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "2",
pages = "345--358",
month = apr,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005711",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ducrou:2008:IUI,
author = "Jon Ducrou and Peter Eklund",
title = "An Intelligent User Interface for Browsing and
Searching {MPEG-7} Images Using Concept Lattices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "2",
pages = "359--381",
month = apr,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005723",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Roth:2008:SRK,
author = "Camille Roth and Sergei Obiedkov and Derrick G.
Kourie",
title = "On Succinct Representation of Knowledge Community
Taxonomies with Formal Concept Analysis",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "2",
pages = "383--404",
month = apr,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005735",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Das:2008:VBS,
author = "Gautam K. Das and Sasanka Roy and Sandip Das and
Subhas C. Nandy",
title = "Variations of Base-Station Placement Problem on the
Boundary of a Convex Region",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "2",
pages = "405--427",
month = apr,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005747",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Berardi:2008:ASC,
author = "Daniela Berardi and Fahima Cheikh and Giuseppe {De
Giacomo} and Fabio Patrizi",
title = "Automatic Service Composition Via Simulation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "2",
pages = "429--451",
month = apr,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005759",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Champarnaud:2008:AJA,
author = "Jean-Marc Champarnaud and Franck Guingne and Andr{\'e}
Kempe and Florent Nicart",
title = "Algorithms for the Join and Auto-Intersection of
Multi-Tape Weighted Finite-State Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "2",
pages = "453--476",
month = apr,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005760",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lozin:2008:CWB,
author = "Vadim V. Lozin and Jordan Volz",
title = "The Clique-Width of Bipartite Graphs in Monogenic
Classes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "2",
pages = "477--494",
month = apr,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005772",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Harju:2008:P,
author = "Tero Harju and Juhani Karhum{\"a}ki",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "495--496",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005784",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bertoni:2008:AMS,
author = "Alberto Bertoni and Roberto Radicioni",
title = "Approximating the Mean Speedup in Trace Monoids",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "497--511",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005796",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Diekert:2008:SSF,
author = "Volker Diekert and Paul Gastin and Manfred
Kufleitner",
title = "A Survey on Small Fragments of First-Order Logic Over
Finite Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "513--548",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005802",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Doyen:2008:ELM,
author = "Laurent Doyen and Thomas A. Henzinger and
Jean-Fran{\c{c}}ois Raskin",
title = "Equivalence of Labeled {Markov} Chains",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "549--563",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005814",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Freivalds:2008:NCM,
author = "R{\=u}si{\c{n}}{\v{s}} Freivalds",
title = "Non-Constructive Methods for Finite Probabilistic
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "565--580",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005826",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Han:2008:SCU,
author = "Yo-Sub Han and Kai Salomaa",
title = "State Complexity of Union and Intersection of Finite
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "581--595",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005838",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jez:2008:CGG,
author = "Artur Je{\.z}",
title = "Conjunctive Grammars Generate Non-Regular Unary
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "597--615",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410800584X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jirasek:2008:DBU,
author = "Jozef Jir{\'a}sek and Galina Jir{\'a}skov{\'a} and
Alexander Szabari",
title = "Deterministic Blow-Ups of Minimal Nondeterministic
Finite Automata Over a Fixed Alphabet",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "617--631",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005851",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ochem:2008:AAS,
author = "Pascal Ochem and Narad Rampersad and Jeffrey Shallit",
title = "Avoiding Approximate Squares",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "633--648",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005863",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Selivanov:2008:FHR,
author = "Victor Selivanov",
title = "Fine Hierarchy of Regular Aperiodic $ \omega
$-Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "649--675",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005875",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tamm:2008:TMB,
author = "Hellis Tamm",
title = "On Transition Minimality of Bideterministic Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "677--690",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005887",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Link:2008:IMD,
author = "Sebastian Link",
title = "On the Implication of Multivalued Dependencies in
Partial Database Relations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "691--715",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005899",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ravikumar:2008:BND,
author = "Bala Ravikumar",
title = "The {Benford--Newcomb} Distribution and Unambiguous
Context-Free Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "717--727",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005905",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Csuhaj-Varju:2008:TLS,
author = "Erzs{\'e}bet Csuhaj-Varj{\'u} and Gheorghe P{\u{a}}un
and Gy{\"o}rgy Vaszil",
title = "Tissue-Like {$P$} Systems with Dynamically Emerging
Requests",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "3",
pages = "729--745",
month = jun,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005917",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Geffert:2008:P,
author = "Viliam Geffert and Giovanni Pighizzini",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "747--749",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005929",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Almeida:2008:EGM,
author = "Marco Almeida and Nelma Moreira and Rog{\'e}rio Reis",
title = "Exact Generation of Minimal Acyclic Deterministic
Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "751--765",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005930",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Freund:2008:CGS,
author = "Rudolf Freund and Marion Oswald",
title = "Cd Grammar Systems with Regular Start Conditions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "767--779",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005942",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jurgensen:2008:CIE,
author = "H. J{\"u}rgensen",
title = "Complexity, Information, Energy",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "781--793",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005954",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kutrib:2008:OSW,
author = "Martin Kutrib and Jens Reimann",
title = "Optimal Simulations of Weak Restarting Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "795--811",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005966",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Loos:2008:DCS,
author = "Remco Loos and Andreas Malcher and Detlef Wotschke",
title = "Descriptional Complexity of Splicing Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "813--826",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005978",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mereghetti:2008:TDP,
author = "Carlo Mereghetti",
title = "Testing the Descriptional Power of Small {Turing}
Machines on Nonregular Language Acceptance",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "827--843",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410800598X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Palano:2008:RCC,
author = "Beatrice Palano",
title = "A Regularity Condition for Context-Free Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "845--857",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108005991",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Paun:2008:RCL,
author = "Gheorghe P{\u{a}}un and Mario J. P{\'e}rez-Jim{\'e}nez
and Takashi Yokomori",
title = "Representations and Characterizations of Languages in
{Chomsky} Hierarchy by Means of Insertion-Deletion
Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "859--871",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006005",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Truthe:2008:RCF,
author = "Bianca Truthe",
title = "Remarks on Context-Free Parallel Communicating Grammar
Systems Generating Crossed Agreements",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "873--886",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006017",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wiedermann:2008:WMC,
author = "Ji{\v{r}}{\'i} Wiedermann and Dana Pardubsk{\'a}",
title = "Wireless Mobile Computing and Its Links to Descriptive
Complexity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "887--913",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006029",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Halava:2008:P,
author = "Vesa Halava and Igor Potapov",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "915--917",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006030",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2008:CMR,
author = "Oscar H. Ibarra and Zhe Dang and Linmin Yang",
title = "On Counter Machines, Reachability Problems, and
{Diophantine} Equations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "919--934",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006042",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kurganskyy:2008:RPL,
author = "Oleksiy Kurganskyy and Igor Potapov and Fernando
Sancho-Caparrini",
title = "Reachability Problems in Low-Dimensional Iterative
Maps",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "935--951",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006054",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lisitsa:2008:RAV,
author = "Alexei Lisitsa and Andrei P. Nemytykh",
title = "Reachability Analysis in Verification Via
Supercompilation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "953--969",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006066",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Margenstern:2008:FTP,
author = "Maurice Margenstern",
title = "The Finite Tiling Problem Is Undecidable in the
Hyperbolic Plane",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "971--982",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006078",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Seth:2008:ACS,
author = "Anil Seth",
title = "An Alternative Construction in Symbolic Reachability
Analysis of Second Order Pushdown Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "983--998",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410800608X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yen:2008:DCA,
author = "Hsu-Chun Yen",
title = "Decidability and Complexity Analysis of Forbidden
State Problems for Discrete Event Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "999--1013",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006091",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gupta:2008:MPC,
author = "Sunil Kumar Gupta and R. K. Chauhan and Parveen
Kumar",
title = "A Minimum-Process Coordinated Checkpointing Protocol
for Mobile Computing Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "1015--1038",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006108",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fazekas:2008:IBS,
author = "Szil{\'a}rd Zsolt Fazekas",
title = "On Inequalities Between Subword Histories",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "1039--1047",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410800611X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Imani:2008:ICM,
author = "N. Imani and H. Sarbazi-Azad and A. Zomaya",
title = "Intruder Capturing in Mesh and Torus Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "1049--1071",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006121",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Daykin:2008:PCU,
author = "David E. Daykin and Jacqueline W. Daykin",
title = "Properties and Construction of Unique Maximal
Factorization Families for Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "4",
pages = "1073--1084",
month = aug,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006133",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Domaratzki:2008:P,
author = "Michael Domaratzki and Kai Salomaa",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1085--1086",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006145",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Biegler:2008:CAM,
author = "Franziska Biegler and Mark Daley and M. Elizabeth O.
Locke",
title = "Computation by Annotation: Modelling Epigenetic
Regulation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1087--1098",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006157",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Campeanu:2008:SCS,
author = "Cezar C{\^a}mpeanu and Stavros Konstantinidis",
title = "State Complexity of the Subword Closure Operation with
Applications to {DNA} Coding",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1099--1112",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006169",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dragoi:2008:DCA,
author = "Cezara Dr{\u{a}}goi and Florin Manea",
title = "On the Descriptional Complexity of Accepting Networks
of Evolutionary Processors with Filtered Connections",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1113--1132",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006170",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ishdorj:2008:GAM,
author = "Tseren-Onolt Ishdorj and Ion Petre",
title = "Gene Assembly Models and {Boolean} Circuits",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1133--1145",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006182",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jack:2008:DNM,
author = "John Jack and Alfonso Rodr{\'i}guez-Pat{\'o}n and
Oscar H. Ibarra and Andrei P{\u{a}}un",
title = "Discrete Nondeterministic Modeling of the {FAS}
Pathway",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1147--1162",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006194",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kari:2008:WCB,
author = "Lila Kari and Kalpana Mahalingam",
title = "{Watson--Crick} Bordered Words and Their Syntactic
Monoid",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1163--1179",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006200",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Csuhaj-Varju:2008:P,
author = "Erzs{\'e}bet Csuhaj-Varj{\'u} and Gy{\"o}rgy Vaszil",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1181--1182",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006212",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bernardini:2008:HSA,
author = "Francesco Bernardini and Marian Gheorghe and Maurice
Margenstern and Sergey Verlan",
title = "How to Synchronize the Activity of All Components of a
{$P$} System?",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1183--1198",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006224",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mardare:2008:LCR,
author = "Radu Mardare and Matteo Cavaliere and Sean Sedwards",
title = "A Logical Characterization of Robustness, Mutants and
Species in Colonies of Agents",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1199--1221",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006236",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Freund:2008:ESN,
author = "Rudolf Freund and Mihai Ionescu and Marion Oswald",
title = "Extended Spiking Neural {$P$} Systems with Decaying
Spikes And\slash Or Total Spiking",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1223--1234",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006248",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Margenstern:2008:CCA,
author = "Maurice Margenstern",
title = "On a Characterization of Cellular Automata in Tilings
of the Hyperbolic Plane",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1235--1257",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410800625X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yang:2008:SAS,
author = "Linmin Yang and Zhe Dang and Oscar H. Ibarra",
title = "On Stateless Automata and {$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "5",
pages = "1259--1276",
month = oct,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006261",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordim:2008:P,
author = "Jacir L. Bordim and Koji Nakano",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1277--1278",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006273",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jiang:2008:ASP,
author = "Zhen Jiang and Jie Wu",
title = "On Achieving the Shortest-Path Routing in {$2$-D}
Meshes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1279--1297",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006285",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jendrsczok:2008:IHP,
author = "Johannes Jendrsczok and Rolf Hoffmann and J{\"o}rg
Keller",
title = "Implementing {Hirschberg}'s {PRAM}-Algorithm for
Connected Components on a Global Cellular Automaton",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1299--1316",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006297",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dongarra:2008:RMP,
author = "Jack Dongarra and Jean-Fran{\c{c}}ois Pineau and Yves
Robert and Zhiao Shi and Fr{\'e}d{\'e}ric Vivien",
title = "Revisiting Matrix Product on Master-Worker Platforms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1317--1336",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006303",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fernandez-Zepeda:2008:SML,
author = "Jos{\'e} Alberto Fern{\'a}ndez-Zepeda and Carlos
Alberto C{\'o}rdova-Flores and Anu G. Bourgeois",
title = "Simulating an {$R$}-Mesh on an {LR}-Mesh in Constant
Time",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1337--1354",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006315",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dobrev:2008:USM,
author = "Stefan Dobrev and Nicola Santoro and Wei Shi",
title = "Using Scattered Mobile Agents to Locate a Black Hole
in an Un-Oriented Ring with Tokens",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1355--1372",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006327",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ito:2008:NFS,
author = "Yasuaki Ito and Koji Nakano",
title = "A New {FM} Screening Method to Generate Cluster-Dot
Binary Images Using the Local Exhaustive Search with
{FPGA} Acceleration",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1373--1386",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006339",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fernandez-Zepeda:2008:AAE,
author = "Jos{\'e} Alberto Fern{\'a}ndez-Zepeda and Juan Paulo
Alvarado-Maga{\~n}a",
title = "Analysis of the Average Execution Time for a
Self-Stabilizing Leader Election Algorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1387--1402",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006340",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rao:2008:GCR,
author = "M. V. Panduranga Rao",
title = "Generalized Counters and Reversal Complexity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1403--1412",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006352",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cheng:2008:MPA,
author = "Eddie Cheng and Linda Lesniak and Marc J. Lipman and
L{\'a}szl{\'o} Lipt{\'a}k",
title = "Matching Preclusion for Alternating Group Graphs and
Their Generalizations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1413--1437",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006364",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Blanchet-Sadri:2008:RTN,
author = "F. Blanchet-Sadri and L. Bromberg and K. Zipple",
title = "Remarks on Two Nonstandard Versions of Periodicity in
Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1439--1448",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006376",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fialik:2008:SBC,
author = "Ivan Fial{\'i}k",
title = "Separation Between Classical and Quantum Winning
Strategies for the Matching Game",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1449--1459",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054108006388",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jalsenius:2008:SSC,
author = "Markus Jalsenius and Kasper Pedersen",
title = "A Systematic Scan for 7-Colourings of the Grid",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1461--1477",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410800639X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2008:AIV,
author = "Anonymous",
title = "Author Index Volume 19 (2008)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "19",
number = "6",
pages = "1479--1485",
month = dec,
year = "2008",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410800639X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gudmundsson:2009:P,
author = "Joachim Gudmundsson and James Harland",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "1",
pages = "1--2",
month = feb,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006413",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ahn:2009:COH,
author = "Hee-Kap Ahn and Helmut Alt and Tetsuo Asano and Sang
Won Bae and Peter Brass and Otfried Cheong and
Christian Knauer and Hyeon-Suk Na and Chan-Su Shin and
Alexander Wolff",
title = "Constructing Optimal Highways",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "1",
pages = "3--23",
month = feb,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006425",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gebauer:2009:FET,
author = "Heidi Gebauer and Yoshio Okamoto",
title = "Fast Exponential-Time Algorithms for the Forest
Counting and the {Tutte} Polynomial Computation in
Graph Classes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "1",
pages = "25--44",
month = feb,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006437",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hung:2009:NOB,
author = "Regant Y. S. Hung and H. F. Ting",
title = "A Near-Optimal Broadcasting Protocol for Mobile
Video-On-Demand",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "1",
pages = "45--55",
month = feb,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006449",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dawson:2009:TAR,
author = "Jeremy E. Dawson and Rajeev Gor{\'e}",
title = "Termination of Abstract Reduction Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "1",
pages = "57--82",
month = feb,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006450",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Morris:2009:USP,
author = "Peter Morris and Thorsten Altenkirch and Neil Ghani",
title = "A Universe of Strictly Positive Families",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "1",
pages = "83--107",
month = feb,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006462",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Vergnaud:2009:NEP,
author = "Damien Vergnaud",
title = "New Extensions of Pairing-Based Signatures into
Universal (Multi) Designated Verifier Signatures",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "1",
pages = "109--133",
month = feb,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006474",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gudmundsson:2009:SGG,
author = "Joachim Gudmundsson and Michiel Smid",
title = "On Spanners of Geometric Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "1",
pages = "135--149",
month = feb,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006486",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Serbanuta:2009:PMA,
author = "Virgil Nicolae {\c{S}}erb{\u{a}}nu{\c{t}}{\u{a}}",
title = "On {Parikh} Matrices, Ambiguity, and Prints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "1",
pages = "151--165",
month = feb,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006498",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bein:2009:KSC,
author = "Wolfgang Bein and Lawrence L. Larmore and R{\"u}diger
Reischuk",
title = "Knowledge States for the Caching Problem in Shared
Memory Multiprocessor Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "1",
pages = "167--183",
month = feb,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006504",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Messerschmidt:2009:DCS,
author = "Hartmut Messerschmidt and Friedrich Otto",
title = "On Deterministic {CD}-Systems of Restarting Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "1",
pages = "185--209",
month = feb,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006516",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Subramanian:2009:PM,
author = "K. G. Subramanian and Ang Miin Huey and Atulya K.
Nagar",
title = "On {Parikh} Matrices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "2",
pages = "211--219",
month = apr,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006528",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Stuber:2009:DWM,
author = "Torsten St{\"u}ber and Heiko Vogler and Zolt{\'a}n
F{\"u}l{\"o}p",
title = "Decomposition of Weighted Multioperator Tree
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "2",
pages = "221--245",
month = apr,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410900653X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shakhlevich:2009:SMS,
author = "Natalia V. Shakhlevich and Akiyoshi Shioura and Vitaly
A. Strusevich",
title = "Single Machine Scheduling with Controllable Processing
Times by Submodular Optimization",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "2",
pages = "247--269",
month = apr,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006541",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brijder:2009:RGO,
author = "Robert Brijder and Hendrik Jan Hoogeboom and Grzegorz
Rozenberg",
title = "Reduction Graphs from Overlap Graphs for Gene Assembly
in Ciliates",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "2",
pages = "271--291",
month = apr,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006553",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lazar:2009:DFC,
author = "Katalin Anna L{\'a}z{\'a}r and Erzs{\'e}bet
Csuhaj-Varj{\'u} and Andr{\'a}s L{\H{o}}rincz and
Gy{\"o}rgy Vaszil",
title = "Dynamically Formed Clusters of Agents in Eco-Grammar
Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "2",
pages = "293--311",
month = apr,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006565",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chang:2009:TEB,
author = "Ching-Lueh Chang and Yuh-Dauh Lyuu and Yen-Wu Ti",
title = "Testing Embeddability Between Metric Spaces",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "2",
pages = "313--329",
month = apr,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006577",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Masopust:2009:TDM,
author = "Tom{\'a}{\v{s}} Masopust",
title = "On the Terminating Derivation Mode in Cooperating
Distributed Grammar Systems with Forbidding
Components",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "2",
pages = "331--340",
month = apr,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006589",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zajicek:2009:NSP,
author = "Ond{\v{r}}ej Zaj{\'i}{\v{c}}ek",
title = "A Note on Scheduling Parallel Unit Jobs on
Hypercubes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "2",
pages = "341--349",
month = apr,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006590",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lee:2009:NCA,
author = "Cheng-Chi Lee and Min-Shiang Hwang and Shiang-Feng
Tzeng",
title = "A New Convertible Authenticated Encryption Scheme
Based on the {ElGamal} Cryptosystem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "2",
pages = "351--359",
month = apr,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006607",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chen:2009:GAC,
author = "Danny Z. Chen and Mark A. Healy and Chao Wang and Bin
Xu",
title = "Geometric Algorithms for the Constrained {$1$-D}
{$K$}-Means Clustering Problems and {IMRT}
Applications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "2",
pages = "361--377",
month = apr,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006619",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sosik:2009:P,
author = "Petr Sos{\'i}k",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "3",
pages = "379--380",
month = jun,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006620",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ciobanu:2009:EM,
author = "Gabriel Ciobanu and Mihai Gontineac",
title = "Encodings of Multisets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "3",
pages = "381--393",
month = jun,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006632",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lucanu:2009:RLB,
author = "Dorel Lucanu",
title = "Rewriting Logic-Based Semantics of {$P$} Systems and
the Maximal Concurrency",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "3",
pages = "395--410",
month = jun,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006644",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hinze:2009:RMC,
author = "Thomas Hinze and Raffael Fassler and Thorsten Lenser
and Peter Dittrich",
title = "Register Machine Computations on Binary Numbers by
Oscillating and Catalytic Chemical Reactions Modelled
Using Mass-Action Kinetics",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "3",
pages = "411--426",
month = jun,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006656",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Romero-Campero:2009:MAC,
author = "Francisco J. Romero-Campero and Jamie Twycross and
Miguel C{\'a}mara and Malcolm Bennett and Marian
Gheorghe and Natalio Krasnogor",
title = "Modular Assembly of Cell Systems Biology Models Using
{$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "3",
pages = "427--442",
month = jun,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006668",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Heuberger:2009:ACM,
author = "Clemens Heuberger and Helmut Prodinger",
title = "Analysis of Complements in Multi-Exponentiation
Algorithms Using Signed Digit Representations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "3",
pages = "443--453",
month = jun,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410900667X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rogojin:2009:SEG,
author = "Vladimir Rogojin",
title = "Successful Elementary Gene Assembly Strategies",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "3",
pages = "455--477",
month = jun,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006681",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rajasekaran:2009:SBT,
author = "Sanguthevar Rajasekaran and Vamsi Kundeti",
title = "Spectrum Based Techniques for Graph Isomorphism",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "3",
pages = "479--499",
month = jun,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006693",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Glasser:2009:ICC,
author = "Christian Gla{\ss}er and Alan L. Selman and Liyu
Zhang",
title = "The Informational Content of Canonical Disjoint
{NP}-Pairs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "3",
pages = "501--522",
month = jun,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410900670X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sprojcar:2009:PSM,
author = "Josef {\v{S}}projcar",
title = "Proposal of a Semiformal Model of Anonymous
Communication",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "3",
pages = "523--548",
month = jun,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006711",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ahrabian:2009:CTA,
author = "H. Ahrabian and A. Nowzari-Dalini and F.
Zare-Mirakabad",
title = "A Constant Time Algorithm for {DNA} Add",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "3",
pages = "549--558",
month = jun,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006723",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2009:P,
author = "Oscar H. Ibarra and Bala Ravikumar",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "559--561",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006735",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holzer:2009:NFA,
author = "Markus Holzer and Martin Kutrib",
title = "Nondeterministic Finite Automata --- Recent Results on
the Descriptional and Computational Complexity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "563--580",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006747",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yen:2009:PDS,
author = "Hsu-Chun Yen",
title = "Path Decomposition and Semilinearity of {Petri} Nets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "581--596",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006759",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dixon:2009:ABS,
author = "Ryan Dixon and {\"O}mer E{\=g}ecio{\=g}lu and Timothy
Sherwood",
title = "Analysis of Bit-Split Languages for Packet Scanning
and Experiments with Wildcard Matching",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "597--612",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006760",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Allauzen:2009:WCW,
author = "Cyril Allauzen and Mehryar Mohri",
title = "{$N$}-Way Composition of Weighted Finite-State
Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "613--627",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006772",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pighizzini:2009:DPA,
author = "Giovanni Pighizzini",
title = "Deterministic Pushdown Automata and Unary Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "629--645",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006784",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cantin:2009:CCH,
author = "Fran{\c{c}}ois Cantin and Axel Legay and Pierre
Wolper",
title = "Computing Convex Hulls by Automata Iteration",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "647--667",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006796",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Almeida:2009:AMR,
author = "Marco Almeida and Nelma Moreira and Rog{\'e}rio Reis",
title = "{Antimirov} and {Mosses}'s Rewrite System Revisited",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "669--684",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006802",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Abdulla:2009:CBT,
author = "Parosh Aziz Abdulla and Ahmed Bouajjani and
Luk{\'a}{\v{s}} Hol{\'i}k and Lisa Kaati and
Tom{\'a}{\v{s}} Vojnar",
title = "Composed Bisimulation for Tree Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "685--700",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006814",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hempel:2009:APC,
author = "Harald Hempel and Madlen Kimmritz",
title = "Aspects of Persistent Computations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "701--715",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006826",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Matsumoto:2009:RTE,
author = "Tetsuya Matsumoto and Kazuhito Hagio and Masayuki
Takeda",
title = "A Run-Time Efficient Implementation of Compressed
Pattern Matching Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "717--733",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006838",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Badr:2009:HM,
author = "Andrew Badr",
title = "Hyper-minimization in {$ O(n^2) $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "735--746",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410900684X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tsay:2009:ACR,
author = "Yih-Kuen Tsay and Bow-Yaw Wang",
title = "Automated Compositional Reasoning of
Intuitionistically Closed Regular Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "747--762",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006851",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Champarnaud:2009:EAT,
author = "Jean-Marc Champarnaud and Jean Philippe Dubernard and
Hadrien Jeanne",
title = "An Efficient Algorithm to Test Whether a Binary and
Prolongeable Regular Language Is Geometrical",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "4",
pages = "763--774",
month = aug,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006863",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Halava:2009:P,
author = "Vesa Halava and Igor Potapov",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "5",
pages = "775--777",
month = oct,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006875",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Abdulla:2009:MAE,
author = "Parosh Aziz Abdulla and Giorgio Delzanno and Noomene
Ben Henda and Ahmed Rezine",
title = "Monotonic Abstraction: on Efficient Verification of
Parameterized Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "5",
pages = "779--801",
month = oct,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006887",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Karhumaki:2009:PCM,
author = "Juhani Karhum{\"a}ki",
title = "On the Power of Cooperating Morphisms Via Reachability
Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "5",
pages = "803--818",
month = oct,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006899",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Andre:2009:IMP,
author = "{\'E}tienne Andr{\'e} and Thomas Chatain and Laurent
Fribourg and Emmanuelle Encrenaz",
title = "An Inverse Method for Parametric Timed Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "5",
pages = "819--836",
month = oct,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006905",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Boichut:2009:HNL,
author = "Yohan Boichut and Romeo Courbis and Pierre-Cyrille
Heam and Olga Kouchnarenko",
title = "Handling Non Left-Linear Rules When Completing Tree
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "5",
pages = "837--849",
month = oct,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006917",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Felscher:2009:CRC,
author = "Ingo Felscher and Wolfgang Thomas",
title = "Compositionality and Reachability with Conditions on
Path Lengths",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "5",
pages = "851--868",
month = oct,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006929",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Groote:2009:SG,
author = "Jan Friso Groote and Bas Ploeger",
title = "Switching Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "5",
pages = "869--886",
month = oct,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006930",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Martyugin:2009:LSR,
author = "Pavel Martyugin",
title = "The Length of Subset Reachability in Nondeterministic
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "5",
pages = "887--900",
month = oct,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006942",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Meier:2009:CSF,
author = "Arne Meier and Michael Thomas and Heribert Vollmer and
Martin Mundhenk",
title = "The Complexity of Satisfiability for Fragments of {$
{\cal CTL} $} and {$ {\cal CTL}* $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "5",
pages = "901--918",
month = oct,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006954",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nicolas:2009:URM,
author = "Francois Nicolas and Yuri Pritykin",
title = "On Uniformly Recurrent Morphic Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "5",
pages = "919--940",
month = oct,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006966",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cvetkovic:2009:MIN,
author = "Drago{\v{s}} Cvetkovi{\'c} and Tatjana Davidovi{\'c}",
title = "Multiprocessor Interconnection Networks with Small
Tightness",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "5",
pages = "941--963",
month = oct,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006978",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holub:2009:F,
author = "Jan Holub",
title = "Foreword",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "6",
pages = "965--966",
month = dec,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410900698X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Faro:2009:EVB,
author = "Simone Faro and Thierry Lecroq",
title = "Efficient Variants of the Backward-Oracle-Matching
Algorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "6",
pages = "967--984",
month = dec,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006991",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Smyth:2009:AHP,
author = "W. F. Smyth and Shu Wang",
title = "An Adaptive Hybrid Pattern-Matching Algorithm on
Indeterminate Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "6",
pages = "985--1004",
month = dec,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109007005",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Baturo:2009:UDA,
author = "Pawe{\l} Baturo and Marcin Piatkowski and Wojciech
Rytter",
title = "Usefulness of Directed Acyclic Subword Graphs in
Problems Related to Standard {Sturmian} Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "6",
pages = "1005--1023",
month = dec,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109007017",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Galle:2009:PUS,
author = "Matthias Gall{\'e} and Pierre Peterlongo and
Fran{\c{c}}ois Coste",
title = "In-Place Update of Suffix Array While Recoding Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "6",
pages = "1025--1045",
month = dec,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109007029",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Christodoulakis:2009:EDC,
author = "Manolis Christodoulakis and Gerhard Brey",
title = "Edit Distance with Combinations and Splits and Its
Applications in {OCR} Name Matching",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "6",
pages = "1047--1068",
month = dec,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109007030",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Coetser:2009:REH,
author = "Wikus Coetser and Derrick G. Kourie and Bruce W.
Watson",
title = "On Regular Expression Hashing to Reduce {FA} Size",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "6",
pages = "1069--1086",
month = dec,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109007042",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cantone:2009:NEB,
author = "Domenico Cantone and Salvatore Cristofaro and Simone
Faro",
title = "New Efficient Bit-Parallel Algorithms for the $
(\delta, \alpha)$-Matching Problem with Applications in
Music Information Retrieval",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "6",
pages = "1087--1108",
month = dec,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109007054",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lin:2009:VST,
author = "Jie Lin and Yue Jiang and Don Adjeroh",
title = "The Virtual Suffix Tree",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "6",
pages = "1109--1133",
month = dec,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109007066",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kusano:2009:AVS,
author = "Kazuhiko Kusano and Wataru Matsubara and Akira Ishino
and Ayumi Shinohara",
title = "Average Value of Sum of Exponents of Runs in a
String",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "6",
pages = "1135--1146",
month = dec,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109007078",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Huo:2009:PSA,
author = "Yumei Huo and Joseph Y.-T. Leung and Xin Wang",
title = "Preemptive Scheduling Algorithms with Nested
Processing Set Restriction",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "6",
pages = "1147--1160",
month = dec,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410900708X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2009:AIV,
author = "Anonymous",
title = "Author Index Volume 20 (2009)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "6",
pages = "1161--1166",
month = dec,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410900708X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Moriya:2010:APS,
author = "Etsuro Moriya and Friedrich Otto",
title = "On Alternating Phrase-Structure Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "1",
pages = "1--25",
month = feb,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007106",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jansen:2010:ASS,
author = "Klaus Jansen and Roberto Solis-Oba",
title = "Approximation Schemes for Scheduling Jobs with Chain
Precedence Constraints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "1",
pages = "27--49",
month = feb,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007118",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Peng:2010:AAS,
author = "Yung-Hsing Peng and Chang-Biau Yang and Kuo-Tsung
Tseng and Kuo-Si Huang",
title = "An Algorithm and Applications to Sequence Alignment
with Weighted Constraints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "1",
pages = "51--59",
month = feb,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411000712X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chang:2010:ETF,
author = "Ching-Lueh Chang and Yuh-Dauh Lyuu",
title = "Efficient Testing of Forecasts",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "1",
pages = "61--72",
month = feb,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007131",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yang:2010:CMI,
author = "Jinn-Shyong Yang and Jou-Ming Chang and Shyue-Ming
Tang and Yue-Li Wang",
title = "Constructing Multiple Independent Spanning Trees on
Recursive Circulant Graphs {$ G(2^m, 2) $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "1",
pages = "73--90",
month = feb,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007143",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Salomaa:2010:SOP,
author = "Arto Salomaa and Sheng Yu",
title = "Subword Occurrences, {Parikh} Matrices and {Lyndon}
Images",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "1",
pages = "91--111",
month = feb,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007155",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Namjoshi:2010:P,
author = "Kedar Namjoshi and Tomohiro Yoneda",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "2",
pages = "113--114",
month = apr,
year = "2010",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Huang:2010:CSB,
author = "Geng-Dian Huang and Bow-Yaw Wang",
title = "Complete {SAT}-Based Model Checking for Context-Free
Processes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "2",
pages = "115--134",
month = apr,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007179",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Geeraerts:2010:ECM,
author = "Gilles Geeraerts and Jean-Fran{\c{c}}ois Raskin and
Laurent {Van Begin}",
title = "On the Efficient Computation of the Minimal
Coverability Set of {Petri} Nets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "2",
pages = "135--165",
month = apr,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007180",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kupferman:2010:LSR,
author = "Orna Kupferman and Yoad Lustig",
title = "Latticed Simulation Relations and Games",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "2",
pages = "167--189",
month = apr,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007192",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Little:2010:AMS,
author = "Scott Little and David Walter and Kevin Jones and
Chris Myers and Alper Sen",
title = "Analog\slash Mixed-Signal Circuit Verification Using
Models Generated from Simulation Traces",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "2",
pages = "191--210",
month = apr,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007209",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Elkind:2010:QDO,
author = "Edith Elkind and Blaise Genest and Doron Peled and
Paola Spoletini",
title = "Quantifying the Discord: Order Discrepancies in
Message Sequence Charts",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "2",
pages = "211--233",
month = apr,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007210",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Recalde:2010:CPN,
author = "Laura Recalde and Serge Haddad and Manuel Silva",
title = "Continuous {Petri} Nets: Expressive Power and
Decidability Issues",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "2",
pages = "235--256",
month = apr,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007222",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Maletti:2010:PQR,
author = "Andreas Maletti and C{\u{a}}t{\u{a}}lin Ionu{\c{t}}
T{\^i}rn{\u{a}}uc{\u{a}}",
title = "Properties of Quasi-Relabeling Tree Bimorphisms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "257--276",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007234",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Friedmann:2010:SSA,
author = "Oliver Friedmann",
title = "The Stevens-Stirling-Algorithm for Solving Parity
Games Locally Requires Exponential Time",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "277--287",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007246",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Schnoor:2010:CMC,
author = "Henning Schnoor",
title = "The Complexity of Model Checking for {Boolean}
Formulas",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "289--309",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007258",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aytac:2010:CRD,
author = "Aysun Aytac and Zeynep Nihan Odabas",
title = "Computing the Rupture Degree in Composite Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "311--319",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411000726X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ti:2010:SIS,
author = "Yen-Wu Ti and Ching-Lueh Chang and Yuh-Dauh Lyuu and
Alexander Shen",
title = "Sets of {$k$}-Independent Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "321--327",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007271",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Paun:2010:ICS,
author = "Mihaela P{\u{a}}un and Nichamon Naksinehaboon and Raja
Nassar and Chokchai Leangsuksun and Stephen L. Scott
and Narate Taerat",
title = "Incremental Checkpoint Schemes for {Weibull} Failure
Distribution",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "329--344",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007283",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ehrenfeucht:2010:CLD,
author = "Andrzej Ehrenfeucht and Michael Main and Grzegorz
Rozenberg",
title = "Combinatorics of Life and Death for Reaction Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "345--356",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007295",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kellerer:2010:MTW,
author = "Hans Kellerer and Vitaly A. Strusevich",
title = "Minimizing Total Weighted Earliness-Tardiness on a
Single Machine Around a Small Common Due Date: an
{FPTAS} Using Quadratic Knapsack",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "357--383",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007301",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordim:2010:P,
author = "Jacir L. Bordim and Akihiro Fujiwara and Koji Nakano",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "385--386",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007313",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Forsell:2010:PCS,
author = "Martti Forsell",
title = "On the Performance and Cost of Some {PRAM} Models on
{CMP} Hardware",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "387--404",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007325",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ito:2010:LLC,
author = "Yasuaki Ito and Koji Nakano",
title = "Low-Latency Connected Component Labeling Using an
{FPGA}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "405--425",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007337",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ando:2010:SCL,
author = "Ei Ando and Hirotaka Ono and Kunihiko Sadakane and
Masafumi Yamashita",
title = "The Space Complexity of Leader Election in Anonymous
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "427--440",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007349",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bruda:2010:CHP,
author = "Stefan D. Bruda and Yuanqiao Zhang",
title = "Collapsing the Hierarchy of Parallel Computational
Models",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "441--457",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007350",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kamei:2010:SSD,
author = "Sayaka Kamei and Hirotsugu Kakugawa",
title = "A Self-Stabilizing Distributed Approximation Algorithm
for the Minimum Connected Dominating Set",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "3",
pages = "459--476",
month = jun,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007362",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ito:2010:P,
author = "Masami Ito",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "4",
pages = "477--478",
month = aug,
year = "2010",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ada:2010:NDC,
author = "Anil Ada",
title = "On the Non-Deterministic Communication Complexity of
Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "4",
pages = "479--493",
month = aug,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007386",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bassino:2010:ASC,
author = "Fr{\'e}d{\'e}rique Bassino and Laura Giambruno and
Cyril Nicaud",
title = "The Average State Complexity of Rational Operations on
Finite Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "4",
pages = "495--516",
month = aug,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007398",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Klima:2010:HPT,
author = "Ond{\v{r}}ej Kl{\'i}ma and Libor Pol{\'a}k",
title = "Hierarchies of Piecewise Testable Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "4",
pages = "517--533",
month = aug,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007404",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Crochemore:2010:NOP,
author = "Maxime Crochemore and Szil{\'a}rd Zsolt Fazekas and
Costas S. Iliopoulos and Inuka Jayasekera",
title = "Number of Occurrences of Powers in Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "4",
pages = "535--547",
month = aug,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007416",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Csuhaj-Varju:2010:VCB,
author = "Erzs{\'e}bet Csuhaj-Varj{\'u} and J{\"u}rgen Dassow
and Gy{\"o}rgy Vaszil",
title = "Variants of Competence-Based Derivations in {CD}
Grammar Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "4",
pages = "549--569",
month = aug,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007428",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Filiot:2010:TAG,
author = "Emmanuel Filiot and Jean-Marc Talbot and Sophie
Tison",
title = "Tree Automata with Global Constraints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "4",
pages = "571--596",
month = aug,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411000743X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gawrychowski:2010:FGR,
author = "Pawe{\l} Gawrychowski and Dalia Krieger and Narad
Rampersad and Jeffrey Shallit",
title = "Finding the Growth Rate of a Regular Or Context-Free
Language in Polynomial Time",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "4",
pages = "597--618",
month = aug,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007441",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Glockler:2010:TDF,
author = "Jens Gl{\"o}ckler",
title = "A Taxonomy of Deterministic Forgetting Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "4",
pages = "619--631",
month = aug,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007453",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holub:2010:RBP,
author = "{\v{S}}t{\v{e}}p{\'a}n Holub and Dirk Nowotka",
title = "On the Relation Between Periodicity and Unbordered
Factors of Finite Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "4",
pages = "633--645",
month = aug,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007465",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mantaci:2010:BPD,
author = "Roberto Mantaci and Sabrina Mantaci and Antonio
Restivo",
title = "Balance Properties and Distribution of Squares in
Circular Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "4",
pages = "647--664",
month = aug,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007477",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Morin:2010:USM,
author = "R{\'e}mi Morin",
title = "Unambiguous Shared-Memory Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "4",
pages = "665--685",
month = aug,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007489",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:15 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Csuhaj-Varju:2010:P,
author = "Erzs{\'e}bet Csuhaj-Varj{\'u} and Zolt{\'a}n
{\'E}sik",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "5",
pages = "687--688",
month = oct,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007490",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 18 14:53:21 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Afonin:2010:SFG,
author = "Sergey Afonin and Elena Khazova",
title = "On the Structure of Finitely Generated Semigroups of
Unary Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "5",
pages = "689--704",
month = oct,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007507",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 18 14:53:21 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Blanchet-Sadri:2010:FWT,
author = "F. Blanchet-Sadri and Taktin Oey and Timothy D.
Rankin",
title = "{Fine} and {Wilf}'s Theorem for Partial Words with
Arbitrarily Many Weak Periods",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "5",
pages = "705--722",
month = oct,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007519",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 18 14:53:21 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dassow:2010:GCS,
author = "J{\"u}rgen Dassow and Ralf Stiebe and Bianca Truthe",
title = "Generative Capacity of Subregularly Tree Controlled
Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "5",
pages = "723--740",
month = oct,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007520",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 18 14:53:21 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kaminski:2010:FMA,
author = "Michael Kaminski and Daniel Zeitlin",
title = "Finite-Memory Automata with Non-Deterministic
Reassignment",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "5",
pages = "741--760",
month = oct,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007532",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 18 14:53:21 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Klima:2010:LIL,
author = "Ond{\v{r}}ej Kl{\'i}ma and Libor Pol{\'a}k",
title = "Literally Idempotent Languages and Their Varieties ---
Two Letter Case",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "5",
pages = "761--780",
month = oct,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007544",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 18 14:53:21 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kutrib:2010:STP,
author = "Martin Kutrib and Hartmut Messerschmidt and Friedrich
Otto",
title = "On Stateless Two-Pushdown Automata and Restarting
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "5",
pages = "781--798",
month = oct,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007556",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 18 14:53:21 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lehtinen:2010:BGG,
author = "Tommi Lehtinen and Alexander Okhotin",
title = "{Boolean} Grammars and {GSM} Mappings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "5",
pages = "799--815",
month = oct,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007568",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 18 14:53:21 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lohrey:2010:CMP,
author = "Markus Lohrey",
title = "Compressed Membership Problems for Regular Expressions
and Hierarchical Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "5",
pages = "817--841",
month = oct,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411000757X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 18 14:53:21 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Malcher:2010:SSB,
author = "Andreas Malcher and Carlo Mereghetti and Beatrice
Palano",
title = "Sublinearly Space Bounded Iterative Arrays",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "5",
pages = "843--858",
month = oct,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007581",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 18 14:53:21 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Manea:2010:SRH,
author = "Florin Manea and Victor Mitrana and Takashi Yokomori",
title = "Some Remarks on the Hairpin Completion",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "21",
number = "5",
pages = "859--872",
month = oct,
year = "2010",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054110007593",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 18 14:53:21 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Freund:2011:P,
author = "Rudolf Freund and Marian Gheorghe and Solomon Marcus
and Victor Mitrana and Mario J. P{\'e}rez-Jim{\'e}nez",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "1--6",
month = jan,
year = "2011",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2011:SRS,
author = "Oscar H. Ibarra",
title = "On Strong Reversibility in {$P$} Systems and Related
Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "7--14",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007782",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Krithivasan:2011:SLG,
author = "Kamala Krithivasan and Venkata Padmavati Metta and
Deepak Garg",
title = "On String Languages Generated by Spiking Neural {P}
Systems with Anti-Spikes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "15--27",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007794",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pan:2011:CRN,
author = "Linqiang Pan and Daniel D{\'i}az-Pernil and Mario J.
P{\'e}rez-Jim{\'e}nez",
title = "Computation of {Ramsey} Numbers by {$P$} Systems with
Active Membranes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "29--38",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007800",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Paun:2011:SPM,
author = "Andrei P{\u{a}}un and Mihaela P{\u{a}}un and Alfonso
Rodr{\'i}guez-Pat{\'o}n and Manuela Sidoroff",
title = "{$P$} Systems with Proteins on Membranes: a Survey",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "39--53",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007812",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Perez-Hurtado:2011:PAA,
author = "Ignacio P{\'e}rez-Hurtado and Mario J.
P{\'e}rez-Jim{\'e}nez and Agust{\'i}n
Riscos-N{\'u}{\~n}ez and Miguel A.
Guti{\'e}rrez-Naranjo and Miquel Rius-Font",
title = "On a Partial Affirmative Answer for a {P{\u{a}}un'{s}
Conjecture}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "55--64",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007824",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Porreca:2011:SAM,
author = "Antonio E. Porreca and Alberto Leporati and Giancarlo
Mauri and Claudio Zandron",
title = "{$P$} Systems with Active Membranes Working in
Polynomial Space",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "65--73",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007836",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sosik:2011:PFR,
author = "Petr Sos{\'i}k and Alfonso Rodr{\'i}guez-Pat{\'o}n and
Lud{\v{e}}k Cienciala",
title = "On the Power of Families of Recognizer Spiking Neural
{$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "75--88",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007848",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Besozzi:2011:MDS,
author = "Daniela Besozzi and Paolo Cazzaniga and Stefania
Cocolo and Giancarlo Mauri and Dario Pescini",
title = "Modeling Diffusion in a Signal Transduction Pathway:
the Use of Virtual Volumes in {$P$} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "89--96",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100785X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Manca:2011:LGS,
author = "Vincenzo Manca and Luca Marchetti",
title = "Log-Gain Stoichiometric Stepwise Regression for {MP}
Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "97--106",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007861",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Martinez-Del-Amor:2011:SAM,
author = "M. A. Mart{\'i}nez-Del-Amor and I. P{\'e}rez-Hurtado
and M. J. P{\'e}rez-Jim{\'e}nez and A.
Riscos-N{\'u}{\~n}ez and F. Sancho-Caparrini",
title = "A Simulation Algorithm for Multienvironment
Probabilistic {$P$} Systems: a Formal Verification",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "107--118",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007873",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Barbuti:2011:OOS,
author = "Roberto Barbuti and Andrea Maggiolo-Schettini and
Paolo Milazzo and Simone Tini",
title = "An Overview on Operational Semantics in Membrane
Computing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "119--131",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007885",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ipate:2011:FVS,
author = "Florentin Ipate and Raluca Lefticaru and Cristina
Tudose",
title = "Formal Verification of {$P$} Systems Using Spin",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "133--142",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007897",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alhazov:2011:SUT,
author = "Artiom Alhazov and Marian Kogler and Maurice
Margenstern and Yurii Rogozhin and Sergey Verlan",
title = "Small Universal {TVDH} and Test Tube Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "143--154",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007903",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Montoro:2011:FPN,
author = "Fernando Arroyo Montoro and Juan Castellanos and
Victor Mitrana and Eugenio Santos and Jose M. Sempere",
title = "Filter Position in Networks of Substitution Processors
Does Not Matter",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "155--165",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007915",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ehrenfeucht:2011:FDR,
author = "Andrzej Ehrenfeucht and Michael Main and Grzegorz
Rozenberg",
title = "Functions Defined by Reaction Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "167--178",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007927",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Frisco:2011:STS,
author = "Pierluigi Frisco and Hendrik Jan Hoogeboom",
title = "{$P$} Systems and Topology: Some Suggestions for
Research",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "179--190",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007939",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Calude:2011:OBQ,
author = "Cristian S. Calude and Matteo Cavaliere and Radu
Mardare",
title = "An Observer-Based De-Quantisation of {Deutsch's
Algorithm}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "191--201",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007940",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Csuhaj-Varju:2011:PGS,
author = "Erzs{\'e}bet Csuhaj-Varj{\'u} and Marion Oswald and
Gy{\"o}rgy Vaszil",
title = "{PC} Grammar Systems with Clusters of Components",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "203--212",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007952",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Daley:2011:OST,
author = "Mark Daley and Lila Kari and Shinnosuke Seki and Petr
Sos{\`i}k",
title = "Orthogonal Shuffle on Trajectories",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "213--222",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007964",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dassow:2011:NAS,
author = "J{\"u}rgen Dassow and Gy{\"o}rgy Vaszil",
title = "On the Number of Active Symbols in {Lindenmayer}
Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "223--235",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007976",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Langer:2011:PAE,
author = "Miroslav Langer and Alica Kelemenov{\'a}",
title = "Positioned Agents in Eco-Grammar Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "237--246",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111007988",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Okubo:2011:MCL,
author = "Fumiya Okubo and Takashi Yokomori",
title = "Morphic Characterizations of Language Families in
Terms of Insertion Systems and Star Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "247--260",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100799X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Salomaa:2011:PSA,
author = "Arto Salomaa",
title = "Power Sums Associated with Certain Recursive
Procedures on Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "261--272",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008003",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Atanasiu:2011:EPM,
author = "Radu-Florian Atanasiu",
title = "{Erratum}: {{\em Parikh Matrix Mapping and
Languages}}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "1",
pages = "273--273",
month = jan,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008015",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 3 15:16:40 MST 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Diekert:2011:P,
author = "Volker Diekert and Dirk Nowotka",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "275--276",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008027",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Beal:2011:QUB,
author = "Marie-Pierre B{\'e}al and Mikhail V. Berlinkov and
Dominique Perrin",
title = "A Quadratic Upper Bound on the Size of a Synchronizing
Word in One-Cluster Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "277--288",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008039",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bertoni:2011:IPC,
author = "Alberto Bertoni and Christian Choffrut and Roberto
Radicioni",
title = "The Inclusion Problem of Context-Free Languages: Some
Tractable Cases",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "289--299",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008040",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brzozowski:2011:CFL,
author = "Janusz Brzozowski and Elyot Grant and Jeffrey
Shallit",
title = "Closures in Formal Languages and {Kuratowski}'s
Theorem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "301--321",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008052",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fazekas:2011:PRL,
author = "Szil{\'a}rd Zsolt Fazekas",
title = "Powers of Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "323--330",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008064",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jiraskova:2011:MNT,
author = "Galina Jir{\'a}skov{\'a}",
title = "Magic Numbers and Ternary Alphabet",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "331--344",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008076",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Laine:2011:WEO,
author = "Markku Laine and Wojciech Plandowski",
title = "Word Equations with One Unknown",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "345--375",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008088",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lehtinen:2011:ESN,
author = "Tommi Lehtinen and Alexander Okhotin",
title = "On Equations Over Sets of Numbers and Their
Limitations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "377--393",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100809X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Petersen:2011:STB,
author = "Holger Petersen",
title = "Simulations by Time-Bounded Counter Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "395--409",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008106",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zetzsche:2011:TUG,
author = "Georg Zetzsche",
title = "Toward Understanding the Generative Capacity of
Erasing Rules in Matrix Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "411--426",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008118",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gazdag:2011:KTB,
author = "Zsolt Gazdag and Zolt{\'a}n L. N{\'e}meth",
title = "A {Kleene} Theorem for Bisemigroup and Binoid
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "427--446",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100812X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kari:2011:PPP,
author = "Lila Kari and Beno{\^i}t Masson and Shinnosuke Seki",
title = "Properties of Pseudo-Primitive Words and Their
Applications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "447--471",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008131",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Halava:2011:RTB,
author = "Vesa Halava and {\v{S}}t{\v{e}}p{\'a}n Holub",
title = "Reduction Tree of the Binary Generalized Post
Correspondence Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "473--490",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008143",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bloom:2011:ALO,
author = "S. L. Bloom and Z. {\'E}sik",
title = "Algebraic Linear Orderings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "2",
pages = "491--515",
month = feb,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008155",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:19 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordim:2011:P,
author = "Jacir L. Bordim and Koji Nakano and Akihiro Fujiwara",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "517--518",
month = apr,
year = "2011",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Taheri:2011:PSD,
author = "Javid Taheri and Albert Y. Zomaya",
title = "On the Performance of Static and Dynamic Location
Management Strategies in Mobile Computing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "519--546",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008210",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fujiwara:2011:LAO,
author = "Akihiro Fujiwara and Takeshi Tateishi",
title = "Logic and Arithmetic Operations with a Constant Number
of Steps in Membrane Computing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "547--564",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008222",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Miyazawa:2011:BCT,
author = "Fl{\'a}vio K. Miyazawa and Andr{\'e} L. Vignatti",
title = "Bounds on the Convergence Time of Distributed Selfish
Bin Packing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "565--582",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008234",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Asahiro:2011:GOM,
author = "Yuichi Asahiro and Jesper Jansson and Eiji Miyano and
Hirotaka Ono",
title = "Graph Orientation to Maximize the Minimum Weighted
Outdegree",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "583--601",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008246",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sun:2011:PSM,
author = "Wei Sun",
title = "Population Size Modeling for {Ga} in Time-Critical
Task Scheduling",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "603--620",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008258",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Benoit:2011:RAS,
author = "Anne Benoit and Veronika Rehn-Sonigo and Yves Robert
and Henri Casanova",
title = "Resource Allocation Strategies for Constructive
In-Network Stream Processing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "621--638",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100826X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bougeret:2011:ADR,
author = "Marin Bougeret and Pierre-Fran{\c{c}}ois Dutot and
Alfredo Goldman and Yanik Ngoko and Denis Trystram",
title = "Approximating the Discrete Resource Sharing Scheduling
Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "639--656",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008271",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Datta:2011:SSE,
author = "Ajoy K. Datta and St{\'e}phane Devismes and Florian
Horn and Lawrence L. Larmore",
title = "Self-stabilizing $k$-out-of-$ \ell $ exclusion in tree
networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "657--677",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008283",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Barriere:2011:USA,
author = "Lali Barri{\`e}re and Paola Flocchini and Eduardo
Mesa-Barrameda and Nicola Santoro",
title = "Uniform Scattering of Autonomous Mobile Robots in a
Grid",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "679--697",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008295",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holub:2011:BMS,
author = "{\v{S}}t{\v{e}}p{\'a}n Holub",
title = "Binary Morphisms with Stable Suffix Complexity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "699--712",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008301",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Karmakar:2011:ADM,
author = "Sushanta Karmakar and Arobinda Gupta",
title = "Adaptive Distributed Mutual Exclusion by Dynamic
Topology Switching",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "713--737",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008313",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lin:2011:NIB,
author = "Han-Yu Lin and Chien-Lung Hsu",
title = "A Novel Identity-Based Key-Insulated Convertible
Authenticated Encryption Scheme",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "3",
pages = "739--756",
month = apr,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008325",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 19 08:35:20 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bournez:2011:P,
author = "Olivier Bournez and Igor Potapov",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "757--760",
month = jun,
year = "2011",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Abdulla:2011:AVD,
author = "Parosh Aziz Abdulla and Giorgio Delzanno and Ahmed
Rezine",
title = "Automatic Verification of Directory-Based Consistency
Protocols with Graph Constraints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "761--782",
month = jun,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008416",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Atig:2011:YPL,
author = "Mohamed Faouzi Atig and Peter Habermehl",
title = "On {Yen}'s Path Logic for {Petri} Nets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "783--799",
month = jun,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008428",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Collins:2011:CSC,
author = "Pieter Collins and Ivan S. Zapreev",
title = "Computable Semantics for {Ctl*} on Discrete-Time and
Continuous-Space Dynamic Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "801--821",
month = jun,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100843X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Henzinger:2011:FSM,
author = "Thomas Henzinger and Barbara Jobstmann and Verena
Wolf",
title = "Formalisms for Specifying {Markovian} Population
Models",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "823--841",
month = jun,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008441",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lugiez:2011:FAD,
author = "Denis Lugiez",
title = "Forward Analysis of Dynamic Network of Pushdown
Systems Is Easier Without Order",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "843--862",
month = jun,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008453",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Manuel:2011:CCA,
author = "Amaldev Manuel and R. Ramanujam",
title = "Class Counting Automata on Datawords",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "863--882",
month = jun,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008465",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Allauzen:2011:GAT,
author = "Cyril Allauzen and Mehryar Mohri and Ashish Rastogi",
title = "General Algorithms for Testing the Ambiguity of Finite
Automata and the Double-Tape Ambiguity of Finite-State
Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "883--904",
month = jun,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008477",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cassaigne:2011:AAP,
author = "Julien Cassaigne and Gw{\'e}na{\"e}l Richomme and
Kalle Saari and Luca Q. Zamboni",
title = "Avoiding {Abelian} Powers in Binary Words with Bounded
{Abelian} Complexity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "905--920",
month = jun,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008489",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2011:WAF,
author = "Meng Zhang and Liang Hu and Yi Zhang",
title = "Weighted Automata for Full-Text Indexing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "921--943",
month = jun,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008490",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Navarro:2011:SQ,
author = "Gonzalo Navarro and Rodrigo Paredes and Patricio V.
Poblete and Peter Sanders",
title = "Stronger Quickheaps",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "945--969",
month = jun,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008507",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ye:2011:WCP,
author = "Deshi Ye and Qinming He",
title = "Worst-Case Performance Evaluation on Multiprocessor
Task Scheduling with Resource Augmentation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "971--982",
month = jun,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008519",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mondal:2011:MQS,
author = "Debashis Mondal and Abhay Kumar and Arijit Bishnu and
Krishnendu Mukhopadhyaya and Subhas C. Nandy",
title = "Measuring the Quality of Surveillance in a Wireless
Sensor Network",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "4",
pages = "983--998",
month = jun,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008520",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:34:01 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fujiwara:2011:P,
author = "Akihiro Fujiwara and Hirotsugu Kakugawa and Koji
Nakano",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "999--1000",
month = aug,
year = "2011",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2011:DPF,
author = "Yamin Li and Shietung Peng and Wanming Chu",
title = "Disjoint-Paths and Fault-Tolerant Routing on Recursive
Dual-Net",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1001--1018",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008532",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2011:DAA,
author = "Shihong Xu and Hong Shen",
title = "A Distributed Approximation Algorithm for
Fault-Tolerant Metric Facility Location",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1019--1034",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008544",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Maza:2011:BDP,
author = "Marc Moreno Maza and Yuzhen Xie",
title = "Balanced Dense Polynomial Multiplication on
Multi-Cores",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1035--1055",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008556",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Man:2011:EPS,
author = "Duhu Man and Yasuaki Ito and Koji Nakano",
title = "An Efficient Parallel Sorting Compatible with the
Standard Qsort",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1057--1071",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008568",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dolev:2011:TTU,
author = "Shlomi Dolev and Yuval Elovici and Alex Kesselman and
Polina Zilberman",
title = "Trawling Traffic Under Attack Overcoming {DDOS}
Attacks by Target-Controlled Traffic Filtering",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1073--1098",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100857X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yamauchi:2011:RCE,
author = "Yukiko Yamauchi and Doina Bein and Toshimitsu
Masuzawa",
title = "Reliable Communication on Emulated Channels Resilient
to Transient Faults",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1099--1122",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008581",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anceaume:2011:DEC,
author = "Emmanuelle Anceaume and Francisco Brasileiro and
Romaric Ludinard and Bruno Sericola and
Fr{\'e}d{\'e}ric Tronel",
title = "Dependability Evaluation of Cluster-Based Distributed
Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1123--1142",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008593",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Carrier:2011:AOD,
author = "Fabienne Carrier and St{\'e}phane Devismes and Franck
Petit and Yvan Rivierre",
title = "Asymptotically Optimal Deterministic Rendezvous",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1143--1159",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100860X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Saifullah:2011:SSC,
author = "Abusayeed Saifullah and Yung H. Tsin",
title = "Self-Stabilizing Computation of 3-Edge-Connected
Components",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1161--1185",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008623",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aytac:2011:VVP,
author = "Aysun Aytac and Tufan Turaci",
title = "Vertex Vulnerability Parameter of Gear Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1187--1195",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008635",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Han:2011:OFL,
author = "Yo-Sub Han and Kai Salomaa",
title = "Overlap-Free Languages and Solid Codes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1197--1209",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008647",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mizuki:2011:ASN,
author = "Takaaki Mizuki and Satoru Nakayama and Hideaki Sone",
title = "An Application of {ST}-Numbering to Secret Key
Agreement",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1211--1227",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008659",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aytac:2011:RCW,
author = "Aysun Ayta{\c{c}} and Zeynep Nihan Odaba{\c{s}}",
title = "Residual Closeness of Wheels and Related Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "5",
pages = "1229--1240",
month = aug,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008660",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 24 06:50:49 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ding:2011:P,
author = "Cunsheng Ding and Qi Wang",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1241--1241",
month = sep,
year = "2011",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Budaghyan:2011:ICP,
author = "Lilya Budaghyan and Tor Helleseth",
title = "On Isotopisms of Commutative Presemifields and
{CCZ}-Equivalence of Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1243--1258",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008684",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Carlet:2011:MVB,
author = "Claude Carlet",
title = "More Vectorial {Boolean} Functions with Unbounded
Nonlinearity Profile",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1259--1269",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008696",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Feng:2011:VBF,
author = "Keqin Feng and Jing Yang",
title = "Vectorial {Boolean} Functions with Good Cryptographic
Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1271--1282",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008702",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Feng:2011:GDA,
author = "Xiutao Feng and Zhenqing Shi and Chuankun Wu and
Dengguo Feng",
title = "On Guess and Determine Analysis of {Rabbit}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1283--1296",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008714",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "Rabbit is a stream cipher proposed by M. Boesgaard et
al., and has been selected into the final portfolio
after three evaluation phases of the ECRYPT Stream
Cipher Project (eSTREAM). So far only a few papers
studied its security besides a series of white papers
by the designers of Rabbit. Recently we presented a new
idea to evaluate the security of a word-oriented stream
cipher algorithm from a smaller data granularity
instead of its original data granularity and applied it
successfully to the stream cipher SOSEMANUK. In this
work we apply the same idea to the Rabbit algorithm and
analyze its security in resistance against the guess
and determine attack from the view point of byte units.
As a result, we present two new approaches of solving
all $ x_{j, t + 1} $'s and $ g_{j, t} $'s from the
next-state function and the extraction scheme of
Rabbit, whose complexities are $ 2^{166} $ and $
2^{140.68} $ respectively, which are dramatically lower
than those proposed by Lu et al. ($ 2^{192} $ and $
2^{174} $ resp.) at ISC 2008. Finally based on the
above new results we propose a byte-based guess and
determine attack on Rabbit, which only needs a small
segment of known keystream to recover the whole
internal state of Rabbit with time complexity $ 2^{242}
$. Though the complexity of our attack is far higher
than that of a brute force ($ 2^{128}$), we believe
that some new techniques adopted in this paper are of
interest for future work on Rabbit.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Goresky:2011:SPA,
author = "Mark Goresky and Andrew Klapper",
title = "Statistical Properties of the Arithmetic Correlation
of Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1297--1315",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008726",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hu:2011:PTK,
author = "Honggang Hu and Guang Gong",
title = "Periods on Two Kinds of Nonlinear Feedback Shift
Registers with Time Varying Feedback Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1317--1329",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008738",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "Grain and Trivium are the hardware-oriented finalists
of the eSTREAM. They are both based on nonlinear
feedback shift registers. In this paper, we study their
generalized classes of nonlinear feedback shift
registers with time varying feedback functions, namely,
Grain-like and Trivium-like structures. Some
interesting results regarding their periods are
obtained.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
keywords = "eSTREAM; Grain; LFSR; NFSR; period; Trivium",
}
@Article{Li:2011:LBS,
author = "Xuelian Li and Yupu Hu and Juntao Gao",
title = "Lower Bounds on the Second Order Nonlinearity of
{Boolean} Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1331--1349",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100874X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Poinsot:2011:NBA,
author = "Laurent Poinsot and Alexander Pott",
title = "Non-{Boolean} Almost Perfect Nonlinear Functions on
Non-{Abelian} Groups",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1351--1367",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008751",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Safavi-Naini:2011:USC,
author = "Reihaneh Safavi-Naini and Shaoquan Jiang",
title = "Unconditionally Secure Conference Key Distribution:
Security Notions, Bounds and Constructions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1369--1393",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008763",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tartary:2011:EIT,
author = "Christophe Tartary and Huaxiong Wang and Yun Zhang",
title = "An Efficient and Information Theoretically Secure
Rational Secret Sharing Scheme Based on Symmetric
Bivariate Polynomials",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1395--1416",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008775",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yang:2011:ACD,
author = "Yang Yang and Xiaohu Tang and Udaya Parampalli",
title = "Authentication Codes from Difference Balanced
Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1417--1429",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008787",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2011:NBF,
author = "Yin Zhang and Meicheng Liu and Dongdai Lin",
title = "On the Nonexistence of Bent Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1431--1438",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008799",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chen:2011:POI,
author = "Danny Z. Chen and Haitao Wang",
title = "Processing an Offline Insertion-Query Sequence with
Applications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1439--1456",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008805",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alazemi:2011:CSU,
author = "Hamed M. K. Alazemi and Anton {\v{C}}ern{\'y}",
title = "Counting Subwords Using a Trie Automaton",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1457--1469",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008817",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rosenberg:2011:HCI,
author = "Arnold L. Rosenberg and Ron C. Chiang",
title = "Heterogeneity in Computing: Insights from a
Worksharing Scheduling Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "6",
pages = "1471--1493",
month = sep,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008829",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Sep 22 12:07:39 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yu:2011:P,
author = "Sheng Yu",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1495--1498",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brijder:2011:TRS,
author = "Robert Brijder and Andrzej Ehrenfeucht and Michael
Main and Grzegorz Rozenberg",
title = "A Tour of Reaction Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1499--1517",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008842",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Giammarresi:2011:EIT,
author = "Dora Giammarresi",
title = "Exploring Inside Tiling Recognizable Picture Languages
to Find Deterministic Subclasses",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1519--1532",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008854",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holzer:2011:CRL,
author = "Markus Holzer and Martin Kutrib",
title = "The Complexity of Regular(-Like) Expressions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1533--1548",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008866",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rigo:2011:LCR,
author = "Michel Rigo and Laurent Waxweiler",
title = "Logical Characterization of Recognizable Sets of
Polynomials Over a Finite Field",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1549--1563",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008878",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Berlinkov:2011:CCD,
author = "Mikhail V. Berlinkov",
title = "On a Conjecture by {Carpi} and {D'Alessandro}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1565--1576",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100888X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordihn:2011:UHR,
author = "Henning Bordihn and Martin Kutrib and Andreas
Malcher",
title = "Undecidability and Hierarchy Results for Parallel
Communicating Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1577--1592",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008891",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Broda:2011:ASC,
author = "Sabine Broda and Ant{\'o}nio Machiavelo and Nelma
Moreira and Rog{\'e}rio Reis",
title = "On the Average State Complexity of Partial Derivative
Automata: an Analytic Combinatorics Approach",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1593--1606",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008908",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Friese:2011:ENF,
author = "Sylvia Friese and Helmut Seidl and Sebastian Maneth",
title = "Earliest Normal Form and Minimization for Bottom-Up
Tree Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1607--1623",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100891X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Head:2011:CLT,
author = "Tom Head",
title = "Computing with Light: Toward Parallel {Boolean}
Algebra",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1625--1637",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008921",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jiraskova:2011:CUF,
author = "Galina Jir{\'a}skov{\'a} and Tom{\'a}{\v{s}}
Masopust",
title = "Complexity in Union-Free Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1639--1653",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008933",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kari:2011:SPI,
author = "Lila Kari and Shinnosuke Seki",
title = "Schema for Parallel Insertion and Deletion:
Revisited",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1655--1668",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008945",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pribavkina:2011:SCC,
author = "Elena Pribavkina and Emanuele Rodaro",
title = "State Complexity of Code Operators",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1669--1681",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008957",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shur:2011:EMP,
author = "Arseny M. Shur",
title = "On the Existence of Minimal $ \beta $-Powers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1683--1696",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008969",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Steinberg:2011:ATC,
author = "Benjamin Steinberg",
title = "The Averaging Trick and the {{\v{C}}ern{\'y}
Conjecture}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1697--1706",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008970",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rahul:2011:DSR,
author = "Saladi Rahul and Prosenjit Gupta and K. S. Rajan",
title = "Data Structures for Range-Aggregation Over
Categories",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1707--1728",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008982",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yuan:2011:LMF,
author = "Allen Yuan and Eddie Cheng and L{\'a}szl{\'o}
Lipt{\'a}k",
title = "Linearly Many Faults in $ (n, k)$-star graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1729--1745",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111008994",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kuppusamy:2011:AIS,
author = "Lakshmanan Kuppusamy and Anand Mahendran and Kamala
Krithivasan",
title = "On the Ambiguity of Insertion Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "7",
pages = "1747--1758",
month = nov,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009008",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:45 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Domaratzki:2011:P,
author = "Michael Domaratzki and Kai Salomaa",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1759--1760",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Allauzen:2011:DCD,
author = "Cyril Allauzen and Corinna Cortes and Mehryar Mohri",
title = "A dual coordinate descent algorithm for {SVMs}
combined with rational kernels",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1761--1779",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009021",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Allauzen:2011:FBA,
author = "Cyril Allauzen and Michael Riley and Johan Schalkwyk",
title = "A Filter-Based Algorithm for Efficient Composition of
Finite-State Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1781--1795",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009033",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cui:2011:SCT,
author = "Bo Cui and Yuan Gao and Lila Kari and Sheng Yu",
title = "State Complexity of Two Combined Operations:
Catenation-Union and Catenation-Intersection",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1797--1812",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009045",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Diekert:2011:INC,
author = "Volker Diekert and Steffen Kopecki",
title = "It Is {NL}-Complete to Decide Whether a Hairpin
Completion of Regular Languages Is Regular",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1813--1828",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009057",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Droste:2011:WAR,
author = "Manfred Droste and Ingmar Meinecke",
title = "Weighted Automata and Regular Expressions Over
Valuation Monoids",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1829--1844",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009069",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Esik:2011:CSW,
author = "Zolt{\'a}n {\'E}sik and Andreas Maletti",
title = "The Category of Simulations for Weighted Tree
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1845--1859",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009070",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kufleitner:2011:POT,
author = "Manfred Kufleitner and Alexander Lauser",
title = "Partially Ordered Two-Way {B{\"u}chi} Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1861--1876",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009082",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Maletti:2011:OHM,
author = "Andreas Maletti and Daniel Quernheim",
title = "Optimal Hyper-Minimization",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1877--1891",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009094",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zdarek:2011:TBI,
author = "Jan {\v{Z}}{\v{d}}{\'a}rek and Bo{\v{r}}ivoj
Melichar",
title = "Tree-Based {$2$D} Indexing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1893--1907",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009100",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yu:2011:RSV,
author = "Fang Yu and Tevfik Bultan and Oscar H. Ibarra",
title = "Relational String Verification Using Multi-Track
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1909--1924",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009112",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Birget:2011:CSI,
author = "J. C. Birget",
title = "On the Circuit-Size of Inverses",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1925--1938",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009124",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dangalchev:2011:RCG,
author = "Chavdar Dangalchev",
title = "Residual Closeness and Generalized Closeness",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1939--1948",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009136",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Czumaj:2011:AAB,
author = "Artur Czumaj and Jurek Czyzowicz and Leszek
G{\k{a}}sieniec and Jesper Jansson and Andrzej Lingas
and Pawel Zylinski",
title = "Approximation Algorithms for Buy-At-Bulk Geometric
Network Design",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1949--1969",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054111009148",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bujtas:2011:GPP,
author = "Csilla Bujt{\'a}s and Gy{\"o}rgy D{\'o}sa and
Csan{\'a}d Imreh and Judit Nagy-Gy{\"o}rgy and Zsolt
Tuza",
title = "The Graph-Bin Packing Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1971--1993",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100915X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2011:AIV,
author = "Anonymous",
title = "Author Index Volume 22 (2011)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "22",
number = "8",
pages = "1995--2004",
month = dec,
year = "2011",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411100915X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 8 18:31:47 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mcquillan:2012:P,
author = "Ian Mcquillan and Giovanni Pighizzini",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "1--3",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kappes:2012:MCK,
author = "Martin Kappes and Andreas Malcher and Detlef
Wotschke",
title = "In Memoriam: {Chandra Kintala}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "5--19",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400011",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brzozowski:2012:CET,
author = "Janusz Brzozowski and Baiyu Li and Yuli Ye",
title = "On the Complexity of the Evaluation of Transient
Extensions of {Boolean} Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "21--35",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400023",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Calude:2012:SSH,
author = "Cristian S. Calude and Kai Salomaa and Tania K.
Roblot",
title = "State-Size Hierarchy for Finite-State Complexity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "37--50",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400035",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cui:2012:SCT,
author = "Bo Cui and Yuan Gao and Lila Kari and Sheng Yu",
title = "State Complexity of Two Combined Operations:
Catenation-Star and Catenation-Reversal",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "51--66",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400047",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dudzinski:2012:FDC,
author = "Krystian Dudzinski and Stavros Konstantinidis",
title = "Formal Descriptions of Code Properties: Decidability,
Complexity, Implementation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "67--85",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400059",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Esik:2012:OAC,
author = "Zolt{\'a}n {\'E}sik",
title = "Ordinal Automata and {Cantor} Normal Form",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "87--98",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400060",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Harbich:2012:CDC,
author = "Ronny Harbich and Bianca Truthe",
title = "A Comparison of the Descriptional Complexity of
Classes of Limited {Lindenmayer} Systems: {Part I}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "99--114",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400072",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holzer:2012:MNP,
author = "Markus Holzer and Sebastian Jakobi and Martin Kutrib",
title = "The Magic Number Problem for Subregular Language
Families",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "115--131",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400084",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Prusinkiewicz:2012:SGM,
author = "Przemys{\l}aw Prusinkiewicz and Mitra Shirmohammadi
and Faramarz Samavati",
title = "{$L$}-Systems in Geometric Modeling",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "133--146",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400096",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bonifacio:2012:MPC,
author = "Adilson Luiz Bonifacio and Arnaldo Vieira Moura and
Adenilso Simao",
title = "Model Partitions and Compact Test Case Suites",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "147--172",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500013",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhou:2012:PTE,
author = "Junping Zhou and Minghao Yin and Xiangtao Li and
Jinyan Wang",
title = "Phase Transitions of Expspace-Complete Problems: a
Further Step",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "173--184",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500025",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dolzhenko:2012:TDL,
author = "Egor Dolzhenko and Nata{\v{s}}a Jonoska",
title = "Two-Dimensional Languages and Cellular Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "185--206",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500037",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mahalingam:2012:PPM,
author = "Kalpana Mahalingam and K. G. Subramanian",
title = "Product of {Parikh} Matrices and Commutativity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "207--223",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500049",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dominguez:2012:PPF,
author = "C{\'e}sar Dom{\'\i}nguez and Dominique Duval",
title = "A Parameterization Process: from a Functorial Point of
View",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "1",
pages = "225--242",
month = jan,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500050",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:45:58 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chin:2012:SY,
author = "F. Chin and O. Ibarra and S. Sahni and A. Salomaa",
title = "Sheng Yu",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "243--246",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holub:2012:P,
author = "Jan Holub",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "247--248",
month = feb,
year = "2012",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Iliopoulos:2012:PAM,
author = "Costas S. Iliopoulos and Mirka Miller and Solon P.
Pissis",
title = "Parallel Algorithms for Mapping Short Degenerate and
Weighted {DNA} Sequences to a Reference Genome",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "249--259",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400114",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Inenaga:2012:FCS,
author = "Shunsuke Inenaga and Hideo Bannai",
title = "Finding Characteristic Substrings from Compressed
Texts",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "261--280",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400126",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Crochemore:2012:LCS,
author = "Maxime Crochemore and Laura Giambruno and Alessio
Langiu",
title = "On-Line Construction of a Small Automaton for a Finite
Set of Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "281--301",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400138",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Piatkowski:2012:ABM,
author = "Marcin Piatkowski and Wojciech Rytter",
title = "Asymptotic Behaviour of the Maximal Number of Squares
in Standard {Sturmian} Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "303--321",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411240014X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Campanelli:2012:PMS,
author = "Matteo Campanelli and Domenico Cantone and Simone Faro
and Emanuele Giaquinta",
title = "Pattern Matching with Swaps in Practice",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "323--342",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400151",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cantone:2012:ABM,
author = "Domenico Cantone and Simone Faro and Emanuele
Giaquinta",
title = "Adapting {Boyer--Moore}-Like Algorithms for Searching
{Huffman} Encoded Texts",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "343--356",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400163",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Burcsi:2012:AJP,
author = "P{\'e}ter Burcsi and Ferdinando Cicalese and Gabriele
Fici and Zsuzsanna Lipt{\'a}k",
title = "Algorithms for Jumbled Pattern Matching in Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "357--374",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400175",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Smyczynski:2012:CMI,
author = "Sebastian Smyczy{\'n}ski",
title = "Constant-Memory Iterative Generation of Special
Strings Representing Binary Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "375--387",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400187",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Franek:2012:CRA,
author = "Frantisek Franek and Mei Jiang",
title = "{Crochemore}'s Repetitions Algorithm Revisited:
Computing Runs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "389--401",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400199",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alba:2012:P,
author = "Enrique Alba and Franciszek Seredynski and El-Ghazali
Talbi and Albert Y. Zomaya",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "403--405",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400199",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Boukerche:2012:EPA,
author = "Azzedine Boukerche and Rodolfo {Bezerra Batista} and
Alba Cristina {Magalhaes Alves De Melo} and Felipe
{Brandt Scarel} and Lavir Antonio {Bahia Carvalho De
Souza}",
title = "Exact Parallel Alignment of Megabase Genomic Sequences
with Tunable Work Distribution",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "407--429",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400205",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Abderrahim:2012:HGQ,
author = "Allani Abderrahim and El-Ghazali Talbi and Mellouli
Khaled",
title = "Hybridization of Genetic and Quantum Algorithm for
Gene Selection and Classification of Microarray Data",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "431--444",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400217",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lee:2012:PMF,
author = "Young Choon Lee and Javid Taheri and Albert Y.
Zomaya",
title = "A Parallel Metaheuristic Framework Based on Harmony
Search for Scheduling in Distributed Computing
Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "445--464",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400229",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Switalski:2012:EMS,
author = "Piotr Switalski and Franciszek Seredynski",
title = "An Effective Multiprocessor Scheduling with Use of Geo
Metaheuristic",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "465--481",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400230",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Loukil:2012:PHG,
author = "Lakhdar Loukil and Malika Mehdi and Nouredine Melab
and El-Ghazali Talbi and Pascal Bouvry",
title = "Parallel Hybrid Genetic Algorithms for Solving {Q3Ap}
on Computational Grid",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "483--500",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400242",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Seredynski:2012:DRB,
author = "Marcin Seredynski and Pascal Bouvry",
title = "Direct Reciprocity-Based Cooperation in Mobile Ad Hoc
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "501--521",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400254",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ediger:2012:EAT,
author = "Patrick Ediger and Rolf Hoffmann",
title = "Efficiency Analysis of the Time-Shuffling Method for
the Evolution of Agent Behavior",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "523--542",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400266",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hernandez-Castro:2012:MTA,
author = "Julio Cesar Hernandez-Castro and Juan Manuel
Estevez-Tapiador and Pedro Peris-Lopez and John A.
Clark and El-Ghazali Talbi",
title = "Metaheuristic Traceability Attack Against {SLMAP}, an
{RFID} Lightweight Authentication Protocol",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "543--553",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400278",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Montanari:2012:P,
author = "Angelo Montanari and Margherita Napoli and Mimmo
Parente",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "555--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112020042",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bresolin:2012:BMB,
author = "Davide Bresolin and Pietro Sala and Guido Sciavicco",
title = "On Begins, Meets and Before",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "559--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411240028X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brim:2012:USI,
author = "Lubo{\v{s}} Brim and Jakub Chaloupka",
title = "Using Strategy Improvement to Stay Alive",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "585--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400291",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chatterjee:2012:DAG,
author = "Krishnendu Chatterjee and Rupak Majumdar",
title = "Discounting and Averaging in Games Across Time
Scales",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "609--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400308",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{DAgostino:2012:MCF,
author = "Giovanna D'Agostino and Giacomo Lenzi",
title = "On Modal $ \mu $-Calculus over Finite Graphs with
Small Components or Small Tree Width",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "627--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411240031X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fearnley:2012:PMG,
author = "John Fearnley and Martin Zimmermann",
title = "Playing {Muller} Games in a Hurry",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "649--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400321",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Friedmann:2012:TLS,
author = "Oliver Friedmann and Martin Lange",
title = "Two Local Strategy Iteration Schemes for Parity Game
Solving",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "669--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400333",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gimbert:2012:BOS,
author = "Hugo Gimbert and Wies{\l}aw Zielonka",
title = "{Blackwell} Optimal Strategies in Priority Mean-Payoff
Games",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "687--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400345",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordihn:2012:CCP,
author = "Henning Bordihn and Martin Kutrib and Andreas
Malcher",
title = "On the Computational Capacity of Parallel
Communicating Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "713--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500062",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wei:2012:IRK,
author = "Yuechuan Wei and Chao Li and Dan Cao",
title = "Improved Related-Key Rectangle Attack on the Full
{HAS-160} Encryption Mode",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "733--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500074",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dong:2012:NCV,
author = "Deshuai Dong and Longjiang Qu and Shaojing Fu and Chao
Li",
title = "New Constructions of Vectorial {Boolean} Functions
with Good Cryptographic Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "3",
pages = "749--??",
month = apr,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500086",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:16:05 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordim:2012:P,
author = "Jacir L. Bordim and Akihiro Fujiwara and Koji Nakano",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "4",
pages = "761--??",
month = jun,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112020054",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Goddard:2012:SSM,
author = "Wayne Goddard and Pradip K. Srimani",
title = "Self-Stabilizing Master-Slave Token Circulation and
Efficient Size-Computation in a Unidirectional Ring of
Arbitrary Size",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "4",
pages = "763--??",
month = jun,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400357",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2012:PAE,
author = "Keqin Li",
title = "Performance Analysis and Evaluation of Random Walk
Algorithms on Wireless Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "4",
pages = "779--??",
month = jun,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400369",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bui:2012:ARW,
author = "Alain Bui and Abdurusul Kudireti and Devan Sohier",
title = "An Adaptive Random Walk Based Distributed Clustering
Algorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "4",
pages = "803--??",
month = jun,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400370",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2012:MAR,
author = "Guoqiang Li and Xiaojuan Cai and Shoji Yuen",
title = "Modeling and Analysis of Real-Time Systems with Mutex
Components",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "4",
pages = "831--??",
month = jun,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400382",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fajardo-Delgado:2012:RSS,
author = "Daniel Fajardo-Delgado and Jos{\'e} Alberto
Fern{\'a}ndez-Zepeda and Anu G. Bourgeois",
title = "Randomized Self-Stabilizing Leader Election in
Preference-Based Anonymous Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "4",
pages = "853--??",
month = jun,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400394",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gudys:2012:PAC,
author = "Adam Gudy{\'s} and Sebastian Deorowicz",
title = "A Parallel Algorithm for the Constrained Multiple
Sequence Alignment Problem Designed for {GPUs}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "4",
pages = "877--??",
month = jun,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500098",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hu:2012:LGG,
author = "Liang Hu and Meng Zhang and Yi Zhang and Jijun Tang",
title = "Label-Guided Graph Exploration with Adjustable Ratio
of Labels",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "4",
pages = "903--??",
month = jun,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500104",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kuo:2012:MFA,
author = "Chi-Jung Kuo and Chiun-Chieh Hsu and Hon-Ren Lin and
Da-Ren Chen",
title = "Minimum Feedback Arc Sets in Rotator and Incomplete
Rotator Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "4",
pages = "931--??",
month = jun,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500116",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ranjan:2012:VIP,
author = "Desh Ranjan and Mohammad Zubair",
title = "Vertex Isoperimetric Parameter of a Computation
Graph",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "4",
pages = "941--??",
month = jun,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500128",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:19 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Maur:2012:P,
author = "Giancarlo Maur and Alberto Leporati",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "965--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112020066",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Broda:2012:ASG,
author = "Sabine Broda and Ant{\'o}nio Machiavelo and Nelma
Moreira and Rog{\'e}rio Reis",
title = "On the Average Size of {Glushkov} and Partial
Derivative Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "969--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400400",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chaturvedi:2012:LVO,
author = "Namit Chaturvedi and J{\"o}rg Olschewski and Wolfgang
Thomas",
title = "Languages Versus $ \omega $-Languages in Regular
Infinite Games",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "985--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400412",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Diekert:2012:GEI,
author = "Volker Diekert and Alexei Myasnikov",
title = "Group Extensions Over Infinite Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "1001--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400424",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Domaratzki:2012:APW,
author = "Michael Domaratzki and Narad Rampersad",
title = "{Abelian} Primitive Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "1021--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400436",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Charlier:2012:EDP,
author = "{\'E}milie Charlier and Narad Rampersad and Jeffrey
Shallit",
title = "Enumeration and Decidable Properties of Automatic
Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "1035--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400448",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pelantova:2012:ARW,
author = "Edita Pelantov{\'a} and {\v{S}}t{\'e}p{\'a}n
Starosta",
title = "Almost Rich Words As Morphic Images of Rich Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "1067--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411240045X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gao:2012:SCA,
author = "Yuan Gao and Sheng Yu",
title = "State Complexity and Approximation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "1085--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400461",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Say:2012:QCA,
author = "A. C. Cem Say and Abuzer Yakaryilmaz",
title = "Quantum Counter Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "1099--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411250013X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zheng:2012:SLR,
author = "Shenggen Zheng and Daowen Qiu and Lvzhou Li",
title = "Some Languages Recognized by Two-Way Finite Automata
with Quantum and Classical States",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "1117--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500141",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Arrighi:2012:PCT,
author = "Pablo Arrighi and Gilles Dowek",
title = "The Physical {Church--Turing} Thesis and the
Principles of Quantum Theory",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "1131--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500153",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chen:2012:MLD,
author = "Guaning Chen and Chih-Wei Yi and Min-Te Sun and
Fang-Chu Liu and Wei-Chi Lan",
title = "Minimum Local Disk Cover Sets for Broadcasting in
Heterogeneous Multihop Wireless Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "1147--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500165",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ehrenfeucht:2012:SCR,
author = "Andrzej Ehrenfeucht and Michael Main and Grzegorz
Rozenberg and Allison Thompson Brown",
title = "Stability and Chaos in Reaction Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "5",
pages = "1173--??",
month = aug,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500177",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 3 13:14:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Domosi:2012:P,
author = "P{\'a}l D{\"o}m{\"o}si and Zolt{\'a}n {\'E}sik",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1185--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112020078",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Blanchet-Sadri:2012:ACP,
author = "F. Blanchet-Sadri",
title = "Algorithmic Combinatorics on Partial Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1189--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400473",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Maletti:2012:UWH,
author = "Andreas Maletti and Daniel Quernheim",
title = "Unweighted and Weighted Hyper-Minimization",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1207--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400485",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pin:2012:EDL,
author = "Jean-{\'E}ric Pin",
title = "Equational Descriptions of Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1227--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400497",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Benattar:2012:CSF,
author = "Gilles Benattar and B{\'e}atrice B{\'e}rard and Didier
Lime and John Mullins and Olivier H. Roux and Mathieu
Sassolas",
title = "Channel Synthesis for Finite Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1241--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400503",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brzozowski:2012:QCS,
author = "Janusz Brzozowski and Bo Liu",
title = "Quotient Complexity of Star-Free Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1261--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400515",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fazekas:2012:NPP,
author = "Szil{\'a}rd Zsolt Fazekas and Peter Leupold and Kayoko
Shikishima-Tsuji",
title = "On Non-Primitive Palindromic Context-Free Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1277--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400527",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2012:CBS,
author = "Oscar H. Ibarra and Shinnosuke Seki",
title = "Characterizations of Bounded Semilinear Languages by
One-Way and Two-Way Deterministic Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1291--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400539",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kari:2012:BSR,
author = "Lila Kari and Zhi Xu",
title = "{De Bruijn} Sequences Revisited",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1307--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400540",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kufleitner:2012:ADD,
author = "Manfred Kufleitner and Alexander Lauser",
title = "Around Dot-Depth One",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1323--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400552",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2012:PHC,
author = "Keqin Li",
title = "Probing High-Capacity Peers to Reduce Download Times
in {P2P} File Sharing Systems with Stochastic Service
Capacities",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1341--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500189",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Christou:2012:IAA,
author = "Michalis Christou and Maxime Crochemore and Costas S.
Iliopoulos",
title = "Identifying All {Abelian} Periods of a String in
Quadratic Time and Relevant Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1371--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500190",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hadravova:2012:LSB,
author = "Jana Hadravov{\'a} and {\v{S}}t{\u{e}}p{\'a}n Holub",
title = "Large Simple Binary Equality Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1385--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500207",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yahalom:2012:TFP,
author = "Orly Yahalom",
title = "Testing for Forbidden Posets in Ordered Rooted
Forests",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "6",
pages = "1405--??",
month = sep,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500219",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 26 08:28:54 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Durand-Lose:2012:P,
author = "J{\'e}r{\^o}me Durand-Lose and Maurice Margenstern and
Klaus Sutner",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "7",
pages = "1419--??",
month = nov,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411202008X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 31 08:26:35 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alhazov:2012:SUS,
author = "Artiom Alhazov and Yurii Rogozhin and Sergey Verlan",
title = "On Small Universal Splicing Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "7",
pages = "1423--??",
month = nov,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400564",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 31 08:26:35 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Auger:2012:FDP,
author = "David Auger and Olivier Teytaud",
title = "The Frontier of Decidability in Partially Observable
Recursive Games",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "7",
pages = "1439--??",
month = nov,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400576",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 31 08:26:35 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ben-Amram:2012:EDC,
author = "Amir M. Ben-Amram and Lars Kristiansen",
title = "On the Edge of Decidability in Complexity Analysis of
Loop Programs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "7",
pages = "1451--??",
month = nov,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400588",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 31 08:26:35 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Burgin:2012:DUA,
author = "Mark Burgin",
title = "Decidability and Universality in the Axiomatic Theory
of Computability and Algorithms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "7",
pages = "1465--??",
month = nov,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411240059X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 31 08:26:35 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Finkel:2012:TAR,
author = "Olivier Finkel",
title = "Three Applications to Rational Relations of the High
Undecidability of the Infinite Post Correspondence
Problem in a regular $ \omega $-Language",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "7",
pages = "1481--??",
month = nov,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400606",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 31 08:26:35 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Meer:2012:SIT,
author = "Klaus Meer",
title = "Some Initial Thoughts on Bounded Query Computations
Over the Reals",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "7",
pages = "1499--??",
month = nov,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400618",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 31 08:26:35 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Niu:2012:TPS,
author = "Yunyun Niu and K. G. Subramanian and Ibrahim Venkat
and Rosni Abdullah",
title = "A Tissue {$P$} System Based Solution to Quadratic
Assignment Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "7",
pages = "1511--??",
month = nov,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411240062X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 31 08:26:35 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bennoui:2012:SAI,
author = "Hammadi Bennoui and Allaoua Chaoui and Kamel
Barkaoui",
title = "On Structural Analysis of Interacting Behavioral
{Petri} Nets for Distributed Causal Model-Based
Diagnosis",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "7",
pages = "1523--??",
month = nov,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500220",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 31 08:26:35 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Liao:2012:AST,
author = "Chung-Shou Liao and Louxin Zhang",
title = "Approximating the Spanning $k$-Tree Forest Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "7",
pages = "1543--??",
month = nov,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500232",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 31 08:26:35 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Meduna:2012:JFA,
author = "Alexander Meduna and Petr Zemek",
title = "Jumping Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "7",
pages = "1555--??",
month = nov,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500244",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 31 08:26:35 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Masakova:2012:P,
author = "Zuzana Mas{\'a}kov{\'a} and {\v{S}}t{\v{e}}p{\'a}n
Holub",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1579--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112020091",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gorbunova:2012:PWA,
author = "Irina A. Gorbunova and Arseny M. Shur",
title = "On {Pansiot} Words Avoiding 3-Repetitions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1583--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400631",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Petrova:2012:CPB,
author = "Elena A. Petrova and Arseny M. Shur",
title = "Constructing Premaximal Binary Cube-Free Words of Any
Level",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1595--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400643",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Schaeffer:2012:CEC,
author = "Luke Schaeffer and Jeffrey Shallit",
title = "The Critical Exponent Is Computable for Automatic
Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1611--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400655",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dombek:2012:SIA,
author = "Daniel Dombek",
title = "Substitutions over Infinite Alphabet Generating
$(-\beta)$-integers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1627--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400667",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bischoff:2012:UPI,
author = "Bastian Bischoff and James Currie and Dirk Nowotka",
title = "Unary Patterns with Involution",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1641--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400679",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Widmer:2012:PCL,
author = "Steven Widmer",
title = "Permutation Complexity and the Letter Doubling Map",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1653--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400680",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Burderi:2012:FMM,
author = "Fabio Burderi",
title = "Full Monoids and Maximal Codes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1677--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400692",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cadilhac:2012:BPA,
author = "Micha{\"e}l Cadilhac and Alain Finkel and Pierre
Mckenzie",
title = "Bounded {Parikh} Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1691--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400709",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Reghizzi:2012:RSL,
author = "Stefano Crespi Reghizzi and Pierluigi {San Pietro}",
title = "From Regular to Strictly Locally Testable Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1711--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400710",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhou:2012:CFD,
author = "Shuming Zhou and Lanxiang Chen and Jun-Ming Xu",
title = "Conditional Fault Diagnosability of Dual-Cubes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1729--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500256",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Honkala:2012:ESM,
author = "Juha Honkala",
title = "Equality Sets of Morphic Word Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1749--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112500268",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2012:AIV,
author = "Anonymous",
title = "Author Index Volume 23 (2012)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "8",
pages = "1767--??",
month = dec,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112990018",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 20 06:59:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Potanin:2013:P,
author = "Alex Potanin and Taso Viglas",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "1",
pages = "1--??",
month = jan,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113020012",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 14 08:51:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Floderus:2013:TME,
author = "Peter Floderus and Andrzej Lingas and Mia Persson",
title = "Towards More Efficient Infection and Fire Fighting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "1",
pages = "3--??",
month = jan,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400017",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 14 08:51:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Suzuki:2013:EET,
author = "Akira Suzuki and Kei Uchizawa and Xiao Zhou",
title = "Energy-Efficient Threshold Circuits Computing Mod
Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "1",
pages = "15--??",
month = jan,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400029",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 14 08:51:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Augustine:2013:TAS,
author = "John Augustine and Qi Han and Philip Loden and Sachin
Lodha and Sasanka Roy",
title = "Tight Analysis of Shortest Path Convergecast in
Wireless Sensor Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "1",
pages = "31--??",
month = jan,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400030",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 14 08:51:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Blin:2013:MMI,
author = "Guillaume Blin and Romeo Rizzi and Florian Sikora and
Stephane Vialette",
title = "Minimum {Mosaic} Inference of a Set of Recombinants",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "1",
pages = "51--??",
month = jan,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400042",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 14 08:51:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Narayanaswamy:2013:UFB,
author = "N. S. Narayanaswamy and N. Sadagopan",
title = "A Unified Framework for Bi(tri)connectivity and
Chordal Augmentation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "1",
pages = "67--??",
month = jan,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400054",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 14 08:51:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bienkowski:2013:HCM,
author = "Marcin Bienkowski and Pawe{\l} Zalewski",
title = "$ (1, 2) $-{Hamiltonian} Completion on a Matching",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "1",
pages = "95--??",
month = jan,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500019",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 14 08:51:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ehmsen:2013:TEC,
author = "Martin R. Ehmsen and Kim S. Larsen",
title = "A Technique for Exact Computation of Precoloring
Extension on Interval Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "1",
pages = "109--??",
month = jan,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500020",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 14 08:51:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Durand:2013:DUR,
author = "Fabien Durand",
title = "Decidability of Uniform Recurrence of Morphic
Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "1",
pages = "123--??",
month = jan,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500032",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 14 08:51:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Salomaa:2013:FCB,
author = "Arto Salomaa",
title = "Functional Constructions Between Reaction Systems and
Propositional Logic",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "1",
pages = "147--??",
month = jan,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500044",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 14 08:51:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Delzanno:2013:P,
author = "Giorgio Delzanno and Igor Potapov",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "2",
pages = "161--??",
month = feb,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113020024",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 7 12:20:51 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chatterjee:2013:CC,
author = "Krishnendu Chatterjee and Luca {De Alfaro} and Rupak
Majumdar",
title = "The Complexity of Coverage",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "2",
pages = "165--??",
month = feb,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400066",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 7 12:20:51 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Abdulla:2013:MAP,
author = "Parosh Aziz Abdulla and Jonathan Cederberg and
Tom{\'a}{\v{s}} Vojnar",
title = "Monotonic Abstraction for Programs with
Multiply-Linked Structures",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "2",
pages = "187--??",
month = feb,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400078",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 7 12:20:51 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Carioni:2013:ATM,
author = "Alessandro Carioni and Silvio Ghilardi and Silvio
Ranise",
title = "Automated Termination in Model-Checking Modulo
Theories",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "2",
pages = "211--??",
month = feb,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411340008X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 7 12:20:51 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fribourg:2013:PVT,
author = "Laurent Fribourg and Ulrich K{\"u}hne",
title = "Parametric Verification and Test Coverage for Hybrid
Automata Using the Inverse Method",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "2",
pages = "233--??",
month = feb,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400091",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 7 12:20:51 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gusev:2013:LBL,
author = "Vladimir V. Gusev",
title = "Lower Bounds for the Length of Reset Words in
{Eulerian} Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "2",
pages = "251--??",
month = feb,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400108",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 7 12:20:51 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mumme:2013:EFS,
author = "Malcolm Mumme and Gianfranco Ciardo",
title = "An Efficient Fully Symbolic Bisimulation Algorithm for
Non-Deterministic Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "2",
pages = "263--??",
month = feb,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411340011X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 7 12:20:51 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Skrypnyuk:2013:RFS,
author = "Nataliya Skrypnyuk and Flemming Nielson",
title = "Reachability for Finite-State Process Algebras Using
{Horn} Clauses",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "2",
pages = "283--??",
month = feb,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400121",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 7 12:20:51 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bacak-Turan:2013:NIT,
author = "Goksen Bacak-Turan and Alpay Kirlangic",
title = "Neighbor Integrity of Transformation Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "3",
pages = "303--??",
month = apr,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500056",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 5 18:30:25 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Masopust:2013:NLP,
author = "Tom{\'a}{\v{s}} Masopust",
title = "A Note on Limited Pushdown Alphabets in Stateless
Deterministic Pushdown Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "3",
pages = "319--??",
month = apr,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500068",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 5 18:30:25 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Torkestani:2013:LAB,
author = "Javad Akbari Torkestani",
title = "A Learning Automata-Based Algorithm to the Stochastic
Min-Degree Constrained Minimum Spanning Tree Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "3",
pages = "329--??",
month = apr,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411350007X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 5 18:30:25 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yue:2013:CIE,
author = "Houguang Yue",
title = "From Computing to Interaction: on the Expressiveness
of Asynchronous Pi-Calculus",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "3",
pages = "349--??",
month = apr,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500081",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 5 18:30:25 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tiwari:2013:CPR,
author = "S. P. Tiwari and Shambhu Sharan and Anupam K. Singh",
title = "On Coverings of Products of Rough Transformation
Semigroups",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "3",
pages = "375--??",
month = apr,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500093",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 5 18:30:25 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Subramanian:2013:TDD,
author = "K. G. Subramanian and Kalpana Mahalingam and Rosni
Abdullah and Atulya K. Nagar",
title = "Two-Dimensional Digitized Picture Arrays and {Parikh}
Matrices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "3",
pages = "393--??",
month = apr,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411350010X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 5 18:30:25 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tu:2013:COV,
author = "Ziran Tu and Yupeng Jiang and Xiangyong Zeng",
title = "Constructing Odd Variable {Boolean} Functions with
Optimal Algebraic Immunity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "3",
pages = "409--??",
month = apr,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500111",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 5 18:30:25 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lomuscio:2013:AGR,
author = "Alessio Lomuscio and Ben Strulo and Nigel Walker and
Peng Wu",
title = "Assume-Guarantee Reasoning with Local Specifications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "4",
pages = "419--??",
month = jun,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500123",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Dec 2 17:10:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fazekas:2013:NDS,
author = "Szil{\'a}rd Zsolt Fazekas and Robert Merca{\c{s}}",
title = "A Note on the Decidability of Subword Inequalities",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "4",
pages = "445--??",
month = jun,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500135",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Dec 2 17:10:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Otto:2013:CPC,
author = "Friedrich Otto",
title = "On Centralized Parallel Communicating Grammar Systems
with Context-Sensitive Components",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "4",
pages = "453--??",
month = jun,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500147",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Dec 2 17:10:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pathak:2013:EEA,
author = "Sudipta Pathak and Sanguthevar Rajasekaran and Marius
Nicolae",
title = "{Ems1}: an Elegant Algorithm for Edit Distance Based
{Motif} Search",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "4",
pages = "473--??",
month = jun,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500159",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Dec 2 17:10:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Burgin:2013:ICM,
author = "Mark Burgin and Cristian S. Calude and Elena Calude",
title = "Inductive Complexity Measures for Mathematical
Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "4",
pages = "487--??",
month = jun,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500160",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Dec 2 17:10:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lazar:2013:BBS,
author = "Katalin Anna L{\'a}z{\'a}r",
title = "A Bridge Between Self-Organizing Networks and Grammar
Systems Theory",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "4",
pages = "501--??",
month = jun,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500172",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Dec 2 17:10:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kalampakas:2013:MPD,
author = "Antonios Kalampakas and Olympia Louscou-Bozapalidou",
title = "Minimization of Planar Directed Acyclic Graph
Algebras",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "4",
pages = "519--??",
month = jun,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500184",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Dec 2 17:10:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cai:2013:NOF,
author = "Han Cai and Xiangyong Zeng and Xiaohu Tang and Lei
Hu",
title = "New Optimal Frequency Hopping Sequence Sets from
Balanced Nested Difference Packings of Partition-Type",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "4",
pages = "533--??",
month = jun,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500196",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Dec 2 17:10:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gheorghe:2013:RFM,
author = "Marian Gheorghe and Gheorghe P{\u{a}}un and Mario J.
P{\'e}rez-Jim{\'e}nez and Grzegorz Rozenberg",
title = "Research Frontiers of Membrane Computing: Open
Problems and Research Topics",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "5",
pages = "547--??",
month = aug,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500202",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Dec 2 17:11:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Das:2013:NEA,
author = "Ashok Kumar Das and Santanu Chatterjee and Jamuna
Kanta Sing",
title = "A Novel Efficient Access Control Scheme for
Large-Scale Distributed Wireless Sensor Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "5",
pages = "625--??",
month = aug,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500214",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Dec 2 17:11:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Darmann:2013:PST,
author = "Andreas Darmann",
title = "Popular Spanning Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "5",
pages = "655--??",
month = aug,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500226",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Dec 2 17:11:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Han:2013:IPF,
author = "Yo-Sub Han",
title = "An Improved Prefix-Free Regular-Expression Matching",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "5",
pages = "679--??",
month = aug,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500238",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Dec 2 17:11:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Moreira:2013:P,
author = "Nelma Moreira and Rog{\'e}rio Reis",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "689--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113020036",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brzozowski:2013:SMC,
author = "Janusz Brzozowski",
title = "In Search of Most Complex Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "691--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400133",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Oliveira:2013:WAC,
author = "Jos{\'e} N. Oliveira",
title = "Weighted Automata As Coalgebras in Categories of
Matrices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "709--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400145",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Berlinkov:2013:SQE,
author = "Mikhail V. Berlinkov",
title = "Synchronizing Quasi-{Eulerian} and Quasi-One-Cluster
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "729--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400157",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Reghizzi:2013:SLT,
author = "Stefano Crespi Reghizzi and Pierluigi {San Pietro}",
title = "Strict Local Testability with Consensus Equals
Regularity, and Other Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "747--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400169",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fominykh:2013:PAS,
author = "F. M. Fominykh and P. V. Martyugin and M. V. Volkov",
title = "P(l)aying for Synchronization",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "765--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400170",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Goc:2013:ATP,
author = "Daniel Go{\v{c}} and Dane Henshall and Jeffrey
Shallit",
title = "Automatic Theorem-Proving in Combinatorics on Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "781--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400182",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2013:HSH,
author = "Oscar H. Ibarra and Nicholas Q. Tran",
title = "How to Synchronize the Heads of a Multitape
Automaton",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "799--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400194",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jez:2013:HMD,
author = "Artur Je{\.z} and Andreas Maletti",
title = "Hyper-Minimization for Deterministic Tree Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "815--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400200",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kutrib:2013:DCW,
author = "Martin Kutrib and Friedrich Otto",
title = "On the Descriptional Complexity of the Window Size for
Deleting Restarting Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "831--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400212",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mohri:2013:DFA,
author = "Mehryar Mohri",
title = "On the Disambiguation of Finite Automata and
Functional Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "847--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400224",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Prrusa:2013:RTA,
author = "Daniel Pr{\r{u}}{\v{s}}a and Franti{\v{s}}ek
Mr{\'a}z",
title = "Restarting Tiling Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "863--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400236",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2013:RMS,
author = "En Zhang and Yongquan Cai",
title = "Rational Multi-Secret Sharing Scheme in Standard
Point-To-Point Communication Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "879--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411350024X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhou:2013:NUB,
author = "Guangyan Zhou and Zongsheng Gao",
title = "A new upper bound for random $ (2 + p) $-{SAT} by
flipping two variables",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "899--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500251",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Santhosh:2013:SSD,
author = "Prabhu M. Santhosh",
title = "Self Stabilization in Distributed Knot Detection",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "913--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500263",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2013:SSC,
author = "Jing Li and Di Liu and Jun Yuan",
title = "The Super Spanning Connectivity and Super Spanning
Laceability of Tori with Faulty Elements",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "6",
pages = "921--??",
month = sep,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500275",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:49:53 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yen:2013:P,
author = "Hsu-Chun Yen and Oscar H. Ibarra",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "941--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113020048",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Salomaa:2013:GKD,
author = "Arto Salomaa and Kai T. Salomaa and Andrew L.
Szilard",
title = "Goodby to the {Kindhearted Dragon Prof. Sheng Yu,
1950--2012}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "945--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400248",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hromkovic:2013:DVN,
author = "Juraj Hromkovi{\v{c}} and Rastislav Kr{\'a}lovi{\v{c}}
and Richard Kr{\'a}lovi{\v{c}} and Richard
{\v{S}}tefanec",
title = "Determinism vs. Nondeterminism for Two-Way Automata:
Representing the Meaning of States by Logical
Formul{\ae}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "955--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411340025X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Iwama:2013:RSO,
author = "Kazuo Iwama and Harumichi Nishimura",
title = "Recovering Strings in Oracles: Quantum and Classic",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "979--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400261",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Csuhaj-Varju:2013:PDA,
author = "Erzs{\'e}bet Csuhaj-Varj{\'u}",
title = "{P} and {DP} automata: unconventional versus classical
automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "995--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400273",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brzozowski:2013:CAR,
author = "Janusz Brzozowski and Hellis Tamm",
title = "Complexity of Atoms of Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "1009--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400285",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Esik:2013:CFL,
author = "Zolt{\'a}n {\'E}sik and Satoshi Okawa",
title = "On Context-Free Languages of Scattered Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "1029--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400297",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lehtinen:2013:HPD,
author = "Tommi Lehtinen and Alexander Okhotin",
title = "Homomorphisms Preserving Deterministic Context-Free
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "1049--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400303",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Han:2013:EDB,
author = "Yo-Sub Han and Sang-Ki Ko and Kai Salomaa",
title = "The Edit-Distance Between a Regular Language and a
Context-Free Language",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "1067--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400315",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holzer:2013:EAE,
author = "Markus Holzer and Sebastian Jakobi",
title = "From Equivalence to Almost-Equivalence, and Beyond:
Minimizing Automata with Errors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "1083--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400327",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cadilhac:2013:UCA,
author = "Micha{\"e}l Cadilhac and Alain Finkel and Pierre
Mckenzie",
title = "Unambiguous Constrained Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "1099--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400339",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Schmid:2013:ICR,
author = "Markus L. Schmid",
title = "Inside the Class of Regex Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "1117--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400340",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Karhumaki:2013:FWT,
author = "Juhani Karhum{\"a}ki and Svetlana Puzynina and Aleksi
Saarela",
title = "{Fine} and {Wilf}'s theorem for $k$-{Abelian}
periods",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "1135--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400352",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Masse:2013:MW,
author = "Alexandre Blondin Mass{\'e} and Sarah Desmeules and
S{\'e}bastien Gaboury and Sylvain Hall{\'e}",
title = "Multipseudoperiodic Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "1153--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400364",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Geffert:2013:UCN,
author = "Viliam Geffert and Dana Pardubsk{\'a}",
title = "Unary coded {NP}-complete languages in {$ {\rm
ASPACE}(\log \log n) $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "7",
pages = "1167--??",
month = nov,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113400376",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 27 13:50:02 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ware:2013:CVG,
author = "Simon Ware and Robi Malik",
title = "Compositional Verification of the Generalized
Nonblocking Property Using Abstraction and Canonical
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "8",
pages = "1183--??",
month = dec,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500287",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 2 05:58:19 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zha:2013:CNA,
author = "Zhengbang Zha and Lei Hu",
title = "Constructing New {APN} Functions from Known {PN}
Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "8",
pages = "1209--??",
month = dec,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500299",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 2 05:58:19 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
keywords = "Almost perfect nonlinear (APN) function; finite field;
perfect nonlinear (PN) function",
}
@Article{Fenner:2013:CHS,
author = "Stephen Fenner and Yong Zhang",
title = "On the Complexity of the Hidden Subgroup Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "8",
pages = "1221--??",
month = dec,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500305",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 2 05:58:19 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wei:2013:GCK,
author = "Yunchao Wei and Fuguang Chen",
title = "Generalized connectivity of $ (n, k) $-star graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "8",
pages = "1235--??",
month = dec,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500317",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 2 05:58:19 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yakaryilmaz:2013:TBS,
author = "Abuzer Yakaryilmaz and A. C. Cem Say",
title = "Tight Bounds for the Space Complexity of Nonregular
Language Recognition by Real-Time Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "8",
pages = "1243--??",
month = dec,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500329",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 2 05:58:19 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gruber:2013:PSR,
author = "Hermann Gruber and Markus Holzer",
title = "Provably Shorter Regular Expressions from Finite
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "8",
pages = "1255--??",
month = dec,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500330",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 2 05:58:19 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Deorowicz:2013:BPA,
author = "Sebastian Deorowicz and Agnieszka Danek",
title = "Bit-Parallel Algorithms for the Merged Longest Common
Subsequence Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "8",
pages = "1281--??",
month = dec,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500342",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 2 05:58:19 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Harren:2013:TOT,
author = "Rolf Harren and Klaus Jansen and Lars Pr{\"a}del and
Ulrich M. Schwarz and Rob {Van Stee}",
title = "Two for One: Tight Approximation of {$2$D} Bin
Packing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "8",
pages = "1299--??",
month = dec,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500354",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 2 05:58:19 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aytac:2013:SRR,
author = "Aysun Ayta{\c{c}} and Hanife Aksu",
title = "Some Results for the Rupture Degree",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "8",
pages = "1329--??",
month = dec,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500366",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 2 05:58:19 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ueno:2013:BRB,
author = "Kenya Ueno",
title = "Breaking the Rectangle Bound Barrier Against Formula
Size Lower Bounds",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "8",
pages = "1339--??",
month = dec,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113500378",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 2 05:58:19 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2013:AIV,
author = "Anonymous",
title = "Author Index Volume 24 (2013)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "24",
number = "8",
pages = "1355--??",
month = dec,
year = "2013",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054113990013",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 2 05:58:19 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fan:2014:NCI,
author = "Jia Fan and Yuliang Zheng and Xiaohu Tang",
title = "A New Construction of Identity-Based Signcryption
Without Random Oracles",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "1",
pages = "1--??",
month = jan,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500014",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 29 07:15:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lagogiannis:2014:PQD,
author = "George Lagogiannis",
title = "Parent Queries Over Dynamic Balanced Parenthesis
Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "1",
pages = "25--??",
month = jan,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500026",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 29 07:15:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cao:2014:SEC,
author = "Xiang-Lan Cao and Elkin Vumar",
title = "Super Edge Connectivity of {Kronecker} Products of
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "1",
pages = "59--??",
month = jan,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500038",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 29 07:15:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jung:2014:SAV,
author = "Haejae Jung",
title = "A Simple Array Version of {$M$}-Heap",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "1",
pages = "67--??",
month = jan,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411450004X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 29 07:15:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Golovnev:2014:AAT,
author = "Alexander Golovnev",
title = "Approximating Asymmetric {TSP} in Exponential Time",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "1",
pages = "89--??",
month = jan,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500051",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 29 07:15:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jiraskova:2014:RSC,
author = "Galina Jir{\'a}skov{\'a}",
title = "The Ranges of State Complexities for Complement, Star,
and Reversal of Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "1",
pages = "101--??",
month = jan,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500063",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 29 07:15:43 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chen:2014:TRA,
author = "Jheng-Cheng Chen and Chia-Jui Lai and Chang-Hsiung
Tsai",
title = "A Three-Round Adaptive Diagnostic Algorithm in a
Distributed System Modeled by Dual-Cubes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "2",
pages = "125--??",
month = feb,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500075",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 6 06:46:16 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jonoska:2014:ATSa,
author = "Nata{\v{s}}a Jonoska and Daria Karpenko",
title = "Active Tile Self-Assembly, Part 1: Universality at
Temperature 1",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "2",
pages = "141--??",
month = feb,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500087",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 6 06:46:16 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jonoska:2014:ATSb,
author = "Nata{\v{s}}a Jonoska and Daria Karpenko",
title = "Active Tile Self-Assembly, Part 2: Self-Similar
Structures and Structural Recursion",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "2",
pages = "165--??",
month = feb,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500099",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 6 06:46:16 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2014:ZKB,
author = "Eric Wang and Cewei Cui and Zhe Dang and Thomas R.
Fischer and Linmin Yang",
title = "Zero-Knowledge Blackbox Testing: Where Are the
Faults?",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "2",
pages = "195--??",
month = feb,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500105",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 6 06:46:16 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2014:DRG,
author = "Pai-Chou Wang",
title = "Dynamic Reducts Generation Using Cascading Hashes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "2",
pages = "219--??",
month = feb,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500117",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jun 6 06:46:16 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pelc:2014:EGE,
author = "Andrzej Pelc and Anas Tiane",
title = "Efficient {Grid} Exploration with a Stationary Token",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "3",
pages = "247--??",
month = apr,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500129",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 25 08:33:25 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2014:CGC,
author = "Jing Zhang and Xiaofan Yang and Cui Yu and Li He",
title = "The Congestion of Generalized Cube Communication
Pattern in Linear Array Network",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "3",
pages = "263--??",
month = apr,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500130",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 25 08:33:25 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ehrenfeucht:2014:ZSR,
author = "Andrzej Ehrenfeucht and Grzegorz Rozenberg",
title = "Zoom Structures and Reaction Systems Yield Exploration
Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "3",
pages = "275--??",
month = apr,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500142",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 25 08:33:25 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yamamoto:2014:TIV,
author = "Yoshiyuki Yamamoto and Kouichi Hirata and Tetsuji
Kuboyama",
title = "Tractable and Intractable Variations of Unordered Tree
Edit Distance",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "3",
pages = "307--??",
month = apr,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500154",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 25 08:33:25 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lam:2014:BSP,
author = "Nhat Lam and Min Kyung An and Dung T. Huynh and Trac
Nguyen",
title = "Broadcast Scheduling Problem in {SINR} Model",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "3",
pages = "331--??",
month = apr,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500166",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 25 08:33:25 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
keywords = "Broadcast; complexity; NP-hardness; scheduling; SINR;
WSN",
}
@Article{Zhou:2014:OSN,
author = "Yu Zhou and Lin Wang and Weiqiong Wang and Xinfeng
Dong and Xiaoni Du",
title = "One Sufficient and Necessary Condition on Balanced
{Boolean} Functions with $ \sigma_f = 2^{2n} + 2^{n +
3} (n \geq 3) $",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "3",
pages = "343--??",
month = apr,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500178",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 25 08:33:25 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Elmasry:2014:FST,
author = "Amr Elmasry and Yung H. Tsin",
title = "On Finding Sparse Three-Edge-Connected and
Three-Vertex-Connected Spanning Subgraphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "3",
pages = "355--??",
month = apr,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411450018X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 25 08:33:25 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ding:2014:OMM,
author = "Ning Ding and Yan Lan and Xin Chen and Gy{\"o}rgy
D{\'o}sa and He Guo and Xin Han",
title = "Online Minimum Makespan Scheduling with a Buffer",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "5",
pages = "525--??",
month = aug,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500191",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Sep 1 13:19:40 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zheng:2014:CMV,
author = "Jia Zheng and Baofeng Wu and Yufu Chen and Zhuojun
Liu",
title = "Constructing $ 2 m$-variable {Boolean} functions with
optimal algebraic immunity based on polar decomposition
of {$ \mathbb {F}_{2^{2m}}^*$}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "5",
pages = "537--??",
month = aug,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500208",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Sep 1 13:19:40 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2014:TTG,
author = "Yinkui Li and Zongtian Wei and Xiaokui Yue and Erqiang
Liu",
title = "Tenacity of Total Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "5",
pages = "553--??",
month = aug,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411450021X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Sep 1 13:19:40 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mandal:2014:SAT,
author = "Partha Sarathi Mandal and Anil K. Ghosh",
title = "A Statistical Approach Towards Secure Location
Verification in Noisy Wireless Channels",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "5",
pages = "563--??",
month = aug,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500221",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Sep 1 13:19:40 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Boykett:2014:RAN,
author = "Tim Boykett and Gerhard Wendt",
title = "{$ {\cal I}_2 $} Radical in Automata Near Rings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "5",
pages = "585--??",
month = aug,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500233",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Sep 1 13:19:40 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cordasco:2014:SSP,
author = "Gennaro Cordasco and Arnold L. Rosenberg",
title = "On Scheduling Series--Parallel {DAGs} to Maximize
Area",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "5",
pages = "597--??",
month = aug,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500245",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Sep 1 13:19:40 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ghasemi:2014:AFS,
author = "Taha Ghasemi and Hossein Ghasemalizadeh and
Mohammadreza Razzazi",
title = "An Algorithmic Framework for Solving Geometric
Covering Problems --- with Applications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "5",
pages = "623--??",
month = aug,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500257",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Sep 1 13:19:40 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Droste:2014:WNW,
author = "Manfred Droste and Bundit Pibaljommee",
title = "Weighted Nested Word Automata and Logics Over Strong
Bimonoids",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "5",
pages = "641--??",
month = aug,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500269",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Sep 1 13:19:40 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhou:2014:NWC,
author = "Junping Zhou and Weihua Su and Jianan Wang",
title = "New Worst-Case Upper Bound for Counting Exact
Satisfiability",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "6",
pages = "667--??",
month = sep,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500270",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:27 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Garcia:2014:EDF,
author = "Pedro Garc{\'i}a and Dami{\'a}n L{\'o}pez and Manuel
{V{\'a}zquez De Parga}",
title = "Efficient Deterministic Finite Automata
Split-Minimization Derived from {Brzozowski}'s
Algorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "6",
pages = "679--??",
month = sep,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500282",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:27 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yang:2014:PAG,
author = "Haijun Yang and Minqiang Li and Qinghua Zheng",
title = "Performance Analysis of {Grid} Architecture Via
Queueing Theory",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "6",
pages = "697--??",
month = sep,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500294",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:27 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chiu:2014:AHA,
author = "Chiao-Wei Chiu and Kuo-Si Huang and Chang-Biau Yang
and Chiou-Ting Tseng",
title = "An Adaptive Heuristic Algorithm with the Probabilistic
Safety Vector for Fault-Tolerant Routing on the $ (n,
k)$-Star Graph",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "6",
pages = "723--??",
month = sep,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500300",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:27 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chen:2014:OSM,
author = "Lin Chen and Deshi Ye and Guochuan Zhang",
title = "Online Scheduling of Mixed {CPU--GPU} Jobs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "6",
pages = "745--??",
month = sep,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500312",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:27 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tang:2014:CRB,
author = "Deng Tang and Claude Carlet and Xiaohu Tang",
title = "A Class of $1$-Resilient {Boolean} Functions with
Optimal Algebraic Immunity and Good Behavior Against
Fast Algebraic Attacks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "6",
pages = "763--??",
month = sep,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500324",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:27 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aizikowitz:2014:LCG,
author = "Tamar Aizikowitz and Michael Kaminski",
title = "Linear Conjunctive Grammars and One-Turn Synchronized
Alternating Pushdown Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "6",
pages = "781--??",
month = sep,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114500336",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:27 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jurgensen:2014:P,
author = "Helmut J{\"u}rgensen and Rog{\'e}rio Reis",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "7",
pages = "803--??",
month = nov,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411402002X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:36 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brzozowski:2014:SCS,
author = "Janusz Brzozowski and Baiyu Li",
title = "Syntactic Complexity of {$ \cal R $}- and {$ \cal J
$}-Trivial Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "7",
pages = "807--??",
month = nov,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400097",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:36 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Goc:2014:NSC,
author = "Daniel Go{\v{c}} and Alexandros Palioudakis and Kai
Salomaa",
title = "Nondeterministic State Complexity of Proportional
Removals",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "7",
pages = "823--??",
month = nov,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400103",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:36 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holzer:2014:NBT,
author = "Markus Holzer and Sebastian Jakobi",
title = "Nondeterministic Biautomata and Their Descriptional
Complexity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "7",
pages = "837--??",
month = nov,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400115",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:36 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sutner:2014:IIT,
author = "K. Sutner",
title = "Iteration of Invertible Transductions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "7",
pages = "857--??",
month = nov,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400127",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:36 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kutrib:2014:SUO,
author = "Martin Kutrib and Andreas Malcher and Matthias
Wendlandt",
title = "Simulations of Unary One-Way Multi-Head Finite
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "7",
pages = "877--??",
month = nov,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400139",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:36 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pighizzini:2014:LAR,
author = "Giovanni Pighizzini and Andrea Pisoni",
title = "Limited Automata and Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "7",
pages = "897--??",
month = nov,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400140",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:36 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Campeanu:2014:DCE,
author = "Cezar C{\^a}mpeanu",
title = "Descriptional Complexity in Encoded {Blum} Static
Complexity Spaces",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "7",
pages = "917--??",
month = nov,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400152",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 20 07:34:36 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Beal:2014:P,
author = "Marie-Pierre B{\'e}al and Olivier Carton",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "933--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114020031",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shur:2014:LFA,
author = "Arseny M. Shur",
title = "Languages with a Finite Antidictionary: Some Growth
Questions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "937--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400164",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Droste:2014:CST,
author = "Manfred Droste and Heiko Vogler",
title = "The {Chomsky--Sch{\"u}tzenberger} Theorem for
Quantitative Context-Free Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "955--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400176",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tan:2014:REQ,
author = "Tony Tan and Domagoj Vrgo{\v{c}}",
title = "Regular Expressions for Querying Data Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "971--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400188",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kucuk:2014:FAA,
author = "U{\u{g}}ur K{\"u}{\c{c}}{\"u}k and A. C. Cem Say and
Abuzer Yakaryilmaz",
title = "Finite Automata with Advice Tapes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "987--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411440019X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Esik:2014:OCS,
author = "Zolt{\'a}n {\'E}sik and Szabolcs Iv{\'a}n",
title = "Operational Characterization of Scattered {MCFLs}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "1001--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400206",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anselmo:2014:PPC,
author = "Marcella Anselmo and Dora Giammarresi and Maria
Madonia",
title = "Prefix Picture Codes: a Decidable Class of
Two-Dimensional Codes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "1017--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400218",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Day:2014:DPC,
author = "Joel D. Day and Daniel Reidenbach and Johannes C.
Schneider",
title = "On the Dual Post Correspondence Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "1033--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411440022X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dassow:2014:IPC,
author = "J{\"u}rgen Dassow and Florin Manea and Robert
Merca{\c{s}} and Mike M{\"u}ller",
title = "Inner Palindromic Closure",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "1049--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400231",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bertoni:2014:DIP,
author = "Alberto Bertoni and Christian Choffrut and Flavio
D'Alessandro",
title = "On the Decidability of the Intersection Problem for
Quantum Automata and Context-Free Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "1065--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400243",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Atig:2014:AOM,
author = "Mohamed Faouzi Atig and K. Narayan Kumar and Prakash
Saivasan",
title = "Adjacent Ordered Multi-Pushdown Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "1083--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400255",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Goc:2014:NAB,
author = "Daniel Go{\v{c}} and Narad Rampersad and Michel Rigo
and Pavel Salimov",
title = "On the Number of {Abelian} Bordered Words (with an
Example of Automatic Theorem-Proving)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "1097--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400267",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Carnino:2014:FUA,
author = "Vincent Carnino and Sylvain Lombardy",
title = "Factorizations and Universal Automaton of {Omega}
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "1111--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400279",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2014:SDQ,
author = "Oscar H. Ibarra and Bala Ravikumar",
title = "Some Decision Questions Concerning the Time Complexity
of Language Acceptors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "1127--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400280",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kutrib:2014:SOW,
author = "Martin Kutrib and Andreas Malcher and Matthias
Wendlandt",
title = "Stateless One-Way Multi-Head Finite Automata with
Pebbles",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "1141--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400292",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bonomo:2014:SCS,
author = "Silvia Bonomo and Sabrina Mantaci and Antonio Restivo
and Giovanna Rosone and Marinella Sciortino",
title = "Sorting Conjugates and Suffixes of Words in a
Multiset",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "1161--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114400309",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2014:AIV,
author = "Anonymous",
title = "Author Index: Volume 25 (2014)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "25",
number = "8",
pages = "1177--??",
month = dec,
year = "2014",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054114990019",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Feb 25 17:18:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wei:2015:CPK,
author = "Puwen Wei and Yuliang Zheng",
title = "On the Construction of Public Key Encryption with
Sender Recovery",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "1",
pages = "1--??",
month = jan,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411550001X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 14 10:17:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kantabutra:2015:FSP,
author = "Sanpawat Kantabutra",
title = "Fast Sequential and Parallel Vertex Relabelings of {$
K_{m, m} $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "1",
pages = "33--??",
month = jan,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500021",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 14 10:17:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gandhi:2015:AAS,
author = "Ratnik Gandhi and Samaresh Chatterji",
title = "Applications of Algebra for Some Game Theoretic
Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "1",
pages = "51--??",
month = jan,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500033",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 14 10:17:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Corson:2015:ACR,
author = "Jon M. Corson and Lance L. Ross",
title = "Automata with Counters that Recognize Word Problems of
Free Products",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "1",
pages = "79--??",
month = jan,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500045",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 14 10:17:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Turker:2015:CSP,
author = "Uraz Cengiz T{\"u}rker and H{\"u}sn{\"u} Yenig{\"u}n",
title = "Complexities of Some Problems Related to
Synchronizing, Non-Synchronizing and Monotonic
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "1",
pages = "99--??",
month = jan,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500057",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 14 10:17:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Teh:2015:CWP,
author = "Wen Chean Teh",
title = "On Core Words and the {Parikh} Matrix Mapping",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "1",
pages = "123--??",
month = jan,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500069",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 14 10:17:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Liao:2015:NOC,
author = "Qunying Liao and Juan Zhu",
title = "A Note on Optimal Constant Dimension Codes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "1",
pages = "143--??",
month = jan,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500070",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 14 10:17:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ryabko:2015:CAF,
author = "Boris Ryabko",
title = "Complexity of Approximating Functions on Real-Life
Computers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "1",
pages = "153--??",
month = jan,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500082",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 14 10:17:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2015:CFT,
author = "Xianyong Li and Xiaofan Yang and Li He and Cui Yu and
Jing Zhang",
title = "Conditional Fault Tolerance of Hypermesh Optical
Interconnection Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "1",
pages = "159--??",
month = jan,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500094",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 14 10:17:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nuida:2015:MPS,
author = "Koji Nuida and Takuro Abe and Shizuo Kaji and Toshiaki
Maeno and Yasuhide Numata",
title = "A Mathematical Problem for Security Analysis of Hash
Functions and Pseudorandom Generators",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "2",
pages = "169--??",
month = feb,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/s0129054115500100",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 6 09:14:15 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rajabi-Alni:2015:CPS,
author = "Fatemeh Rajabi-Alni and Alireza Bagheri",
title = "Constrained Point Set Embedding of a Balanced Binary
Tree",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "2",
pages = "195--??",
month = feb,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/s0129054115500112",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 6 09:14:15 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Eom:2015:SCK,
author = "Hae-Sung Eom and Yo-Sub Han and Kai Salomaa",
title = "State Complexity of $k$-Union and $k$-Intersection for
Prefix-Free Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "2",
pages = "211--??",
month = feb,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/s0129054115500124",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 6 09:14:15 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ding:2015:NSS,
author = "Yihua Ding and James Z. Wang and Pradip K. Srimani",
title = "New Self-Stabilizing Algorithms for Minimal Weakly
Connected Dominating Sets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "2",
pages = "229--??",
month = feb,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/s0129054115500136",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 6 09:14:15 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Feng:2015:LFT,
author = "Kai Feng and Shiying Wang and Guozhen Zhang",
title = "Link Failure Tolerance in the Arrangement Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "2",
pages = "241--??",
month = feb,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/s0129054115500148",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 6 09:14:15 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fenner:2015:QAS,
author = "Stephen Fenner and Yong Zhang",
title = "Quantum Algorithms for a Set of Group Theoretic
Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "2",
pages = "255--??",
month = feb,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/s012905411550015x",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 6 09:14:15 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kouri:2015:RMA,
author = "Tina M. Kouri and Daniel Pascua and Dinesh P. Mehta",
title = "Random Models and Analyses for Chemical Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "2",
pages = "269--??",
month = feb,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/s0129054115500161",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 6 09:14:15 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Devismes:2015:WVS,
author = "St{\'e}phane Devismes and S{\'e}bastien Tixeuil and
Masafumi Yamashita",
title = "Weak {\em vs.} Self {\em vs.} Probabilistic
Stabilization",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "3",
pages = "293--??",
month = apr,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500173",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:34 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Saha:2015:NRF,
author = "Subrata Saha and Sanguthevar Rajasekaran and Rampi
Ramprasad",
title = "Novel Randomized Feature Selection Algorithms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "3",
pages = "321--??",
month = apr,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500185",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:34 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rowland:2015:ASR,
author = "Eric Rowland and Jeffrey Shallit",
title = "Automatic Sets of Rational Numbers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "3",
pages = "343--??",
month = apr,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500197",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:34 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Qi:2015:LED,
author = "Xingqin Qi and Edgar Fuller and Rong Luo and Guodong
Guo and Cunquan Zhang",
title = "{Laplacian} Energy of Digraphs and a Minimum
{Laplacian} Energy Algorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "3",
pages = "367--??",
month = apr,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500203",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:34 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gruska:2015:PQF,
author = "Jozef Gruska and Daowen Qiu and Shenggen Zheng",
title = "Potential of Quantum Finite Automata with Exact
Acceptance",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "3",
pages = "381--??",
month = apr,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500215",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:34 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Grigoriev:2015:NMS,
author = "Alexander Grigoriev and Bert Marchal and Natalya
Usotskaya",
title = "A Note on the Minimum {$H$}-Subgraph Edge Deletion",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "3",
pages = "399--??",
month = apr,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500227",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:34 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Boyar:2015:FIP,
author = "Joan Boyar and Kim S. Larsen and Abyayananda Maiti",
title = "The Frequent Items Problem in Online Streaming Under
Various Performance Measures",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "4",
pages = "413--??",
month = jun,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500239",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:35 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Rudy:2015:DRA,
author = "Jaros{\l}aw Rudy",
title = "Dynamic Random-Access Stored-Program Machine for
Runtime Code Modification",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "4",
pages = "441--??",
month = jun,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500240",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:35 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Calude:2015:AAN,
author = "Cristian S. Calude and Damien Desfontaines",
title = "Anytime Algorithms for Non-Ending Computations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "4",
pages = "465--??",
month = jun,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500252",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:35 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Christensen:2015:SHT,
author = "Jan Christensen and Anders Nicolai Knudsen and Kim S.
Larsen",
title = "Soccer is Harder Than Football",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "4",
pages = "477--??",
month = jun,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500264",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:35 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhu:2015:SBT,
author = "Xishun Zhu and Xiangyong Zeng and Yuan Chen",
title = "Some Binomial and Trinomial Differentially $4$-Uniform
Permutation Polynomials",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "4",
pages = "487--??",
month = jun,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500276",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:35 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Casteigts:2015:SFF,
author = "Arnaud Casteigts and Paola Flocchini and Bernard Mans
and Nicola Santoro",
title = "Shortest, Fastest, and Foremost Broadcast in Dynamic
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "4",
pages = "499--??",
month = jun,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500288",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:35 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Calamoneri:2015:OJK,
author = "Tiziana Calamoneri",
title = "Optimal {$ L(j, k) $}-Edge-Labeling of Regular Grids",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "4",
pages = "523--??",
month = jun,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411550029X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 6 13:38:35 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Salomaa:2015:AA,
author = "Arto Salomaa and Francis Chin and Oscar Ibarra and
Sartaj Sahni",
title = "{Alberto Apostolico}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "5",
pages = "iii",
month = aug,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115010017",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Aug 31 06:13:56 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cao:2015:TBF,
author = "Xiwang Cao and Lei Hu",
title = "Two {Boolean} Functions with Five-Valued {Walsh}
Spectra and High Nonlinearity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "5",
pages = "537--??",
month = aug,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500306",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Aug 31 06:13:56 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{ONeil:2015:CCS,
author = "Thomas E. O'Neil",
title = "Complement, Complexity, and Symmetric Representation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "5",
pages = "557--??",
month = aug,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500318",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Aug 31 06:13:56 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2015:SCM,
author = "Shiying Wang and Kai Feng and Yubao Guo",
title = "Sufficient Conditions for Maximally k-Isoperimetric
Edge Connectivity of Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "5",
pages = "583--??",
month = aug,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411550032X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Aug 31 06:13:56 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2015:CNP,
author = "Guangkui Xu and Xiwang Cao",
title = "Constructing New Piecewise Differentially $4$-Uniform
Permutations from Known {APN} Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "5",
pages = "599--??",
month = aug,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500331",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Aug 31 06:13:56 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ho:2015:SYE,
author = "Tzu-Hsin Ho and Li-Hsing Yen and Chien-Chao Tseng",
title = "Simple-Yet-Efficient Construction and Revocation of
Group Signatures",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "5",
pages = "611--??",
month = aug,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500343",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Aug 31 06:13:56 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Arslan:2015:FAL,
author = "Abdullah N. Arslan",
title = "Fast Algorithms for Local Similarity Queries in Two
Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "5",
pages = "625--??",
month = aug,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500355",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Aug 31 06:13:56 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Otto:2015:APC,
author = "Friedrich Otto",
title = "Asynchronous Parallel Communicating Systems of
Pushdown Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "5",
pages = "643--??",
month = aug,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500367",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Aug 31 06:13:56 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aytac:2015:VMT,
author = "Aysun Ayta{\c{c}} and Tufan Turaci",
title = "Vulnerability Measures of Transformation Graph {$
G^{xy+} $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "6",
pages = "667--??",
month = sep,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500379",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 7 08:40:07 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{vanLeeuwen:2015:SCR,
author = "Jan van Leeuwen and Ji{\v{r}}{\'\i} Wiedermann",
title = "Separating the Classes of Recursively Enumerable
Languages Based on Machine Size",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "6",
pages = "677--??",
month = sep,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500380",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 7 08:40:07 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Eom:2015:SCB,
author = "Hae-Sung Eom and Yo-Sub Han",
title = "State Complexity of Boundary of Prefix-Free Regular
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "6",
pages = "697--??",
month = sep,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500392",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 7 08:40:07 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Krivka:2015:JG,
author = "Zbyn{\v{e}}k K{\v{r}}ivka and Alexander Meduna",
title = "Jumping Grammars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "6",
pages = "709--??",
month = sep,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500409",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 7 08:40:07 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Giambruno:2015:GGB,
author = "Laura Giambruno and Sabrina Mantaci and Jean
N{\'e}raud and Carla Selmi",
title = "A Generalization of {Girod}'s Bidirectional Decoding
Method to Codes with a Finite Deciphering Delay",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "6",
pages = "733--??",
month = sep,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500410",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 7 08:40:07 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Neggazi:2015:ESS,
author = "Brahim Neggazi and Nabil Guellati and Mohammed Haddad
and Hamamache Kheddouci",
title = "Efficient Self-Stabilizing Algorithm for Independent
Strong Dominating Sets in Arbitrary Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "6",
pages = "751--??",
month = sep,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500422",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 7 08:40:07 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Torkestani:2015:ASC,
author = "Javad Akbari Torkestani",
title = "Algorithms for {Steiner} Connected Dominating Set
Problem Based on Learning Automata Theory",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "6",
pages = "769--??",
month = sep,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115500434",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Nov 7 08:40:07 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holzer:2015:P,
author = "Markus Holzer and Martin Kutrib",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "7",
pages = "803--??",
month = nov,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115020013",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Jan 4 08:37:05 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Esparza:2015:FGS,
author = "Javier Esparza and Michael Luttenberger and Maximilian
Schlund",
title = "{FPSOLVE}: A Generic Solver for Fixpoint Equations
Over Semirings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "7",
pages = "805--??",
month = nov,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400018",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Jan 4 08:37:05 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Pighizzini:2015:IAL,
author = "Giovanni Pighizzini",
title = "Investigations on Automata and Languages Over a Unary
Alphabet",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "7",
pages = "827--??",
month = nov,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411540002X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Jan 4 08:37:05 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sirakoulis:2015:CPC,
author = "Georgios Ch. Sirakoulis",
title = "The Computational Paradigm of Cellular Automata in
Crowd Evacuation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "7",
pages = "851--??",
month = nov,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400031",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Jan 4 08:37:05 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Amorim:2015:NLF,
author = "Ivone Amorim and Ant{\'o}nio Machiavelo and
Rog{\'e}rio Reis",
title = "On the Number of Linear Finite Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "7",
pages = "873--??",
month = nov,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400043",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Jan 4 08:37:05 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bianchi:2015:POW,
author = "Maria Paola Bianchi and Carlo Mereghetti and Beatrice
Palano",
title = "On the Power of One-Way Automata with Quantum and
Classical States",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "7",
pages = "895--??",
month = nov,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400055",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Jan 4 08:37:05 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Brzozowski:2015:LAS,
author = "Janusz Brzozowski and Marek Szyku{\l}a",
title = "Large Aperiodic Semigroups",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "7",
pages = "913--??",
month = nov,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400067",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Jan 4 08:37:05 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dumitran:2015:BPS,
author = "Marius Dumitran and Javier Gil and Florin Manea and
Victor Mitrana",
title = "Bounded Prefix-Suffix Duplication: Language Theoretic
and Algorithmic Results",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "7",
pages = "933--??",
month = nov,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400079",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Jan 4 08:37:05 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gusev:2015:RTA,
author = "Vladimir V. Gusev and Elena V. Pribavkina",
title = "Reset Thresholds of Automata with Two Cycle Lengths",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "7",
pages = "953--??",
month = nov,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400080",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Jan 4 08:37:05 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibarra:2015:AFV,
author = "Oscar H. Ibarra",
title = "On the Ambiguity and Finite-Valuedness Problems in
Acceptors and Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "7",
pages = "967--??",
month = nov,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400092",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Jan 4 08:37:05 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Maletti:2015:PWR,
author = "Andreas Maletti",
title = "The Power of Weighted Regularity-Preserving Multi
Bottom-Up Tree Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "7",
pages = "987--??",
month = nov,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400109",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Jan 4 08:37:05 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Esik:2015:P,
author = "Zolt{\'a}n {\'E}sik",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "8",
pages = "1007--??",
month = dec,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115020025",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 25 06:16:52 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gruber:2015:FAR,
author = "Hermann Gruber and Markus Holzer",
title = "From Finite Automata to Regular Expressions and Back
--- A Summary on Descriptional Complexity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "8",
pages = "1009--??",
month = dec,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400110",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 25 06:16:52 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Loding:2015:SPD,
author = "Christof L{\"o}ding",
title = "Simplification Problems for Deterministic Pushdown
Automata on Infinite Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "8",
pages = "1041--??",
month = dec,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400122",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 25 06:16:52 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Maneth:2015:SDE,
author = "Sebastian Maneth",
title = "A Survey on Decidable Equivalence Problems for Tree
Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "8",
pages = "1069--??",
month = dec,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400134",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 25 06:16:52 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bordihn:2015:RPC,
author = "Henning Bordihn and Martin Kutrib and Andreas
Malcher",
title = "Returning Parallel Communicating Finite Automata with
Communication Bounds: Hierarchies, Decidabilities, and
Undecidabilities",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "8",
pages = "1101--??",
month = dec,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400146",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 25 06:16:52 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Carnino:2015:DUW,
author = "Vincent Carnino and Sylvain Lombardy",
title = "On Determinism and Unambiguity of Weighted Two-Way
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "8",
pages = "1127--??",
month = dec,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400158",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 25 06:16:52 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Du:2015:OBS,
author = "Chen Fei Du and Jeffrey Shallit and Arseny M. Shur",
title = "Optimal Bounds for the Similarity Density of the
{Thue--Morse} Word with Overlap-Free and $ 7 /
3$-Power-Free Infinite Binary Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "8",
pages = "1147--??",
month = dec,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411540016X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 25 06:16:52 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fernau:2015:FIR,
author = "Henning Fernau and Rudolf Freund and Markus Holzer",
title = "The Finite Index Restriction Meets Hybrid Modes in
Cooperating Distributed Grammar Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "8",
pages = "1167--??",
month = dec,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115400171",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 25 06:16:52 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Meier:2015:ECS,
author = "Arne Meier and Michael Thomas and Heribert Vollmer and
Martin Mundhenk",
title = "Erratum: {The Complexity of Satisfiability for
Fragments of CTL and CTL$^\star $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "8",
pages = "1189--??",
month = dec,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411592001X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 25 06:16:52 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2015:AIV,
author = "Anonymous",
title = "Author Index Volume 26 (2015)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "26",
number = "8",
pages = "1191--??",
month = dec,
year = "2015",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054115990014",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Feb 25 06:16:52 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wu:2016:ESS,
author = "Peng Wu and Minsoo Ryu",
title = "{EDZL} Scheduling and Schedulability Analysis for
Performance Asymmetric Multiprocessors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "1",
pages = "1--??",
month = jan,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500015",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 19 11:55:46 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shtrakov:2016:CCF,
author = "Slavcho Shtrakov and Ivo Damyanov",
title = "On the Computational Complexity of Finite Operations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "1",
pages = "15--??",
month = jan,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500027",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 19 11:55:46 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Teh:2016:SME,
author = "Wen Chean Teh",
title = "Separability of {$M$}-Equivalent Words by Morphisms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "1",
pages = "39--??",
month = jan,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500039",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 19 11:55:46 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2016:NCO,
author = "Changyuan Wang and Daiyuan Peng and Limengnan Zhou",
title = "New Constructions of Optimal Frequency-Hopping
Sequence Sets with Low-Hit-Zone",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "1",
pages = "53--??",
month = jan,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500040",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 19 11:55:46 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bertier:2016:CCM,
author = "Marin Bertier and Matthieu Perrin and C{\'e}dric
Tedeschi",
title = "On the Complexity of Concurrent Multiset Rewriting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "1",
pages = "67--??",
month = jan,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500052",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 19 11:55:46 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Deng:2016:ECP,
author = "Lunzhi Deng and Jiwen Zeng and Huawei Huang",
title = "Efficient Certificateless Proxy Signature Scheme",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "1",
pages = "85--??",
month = jan,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500064",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 19 11:55:46 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shur:2016:P,
author = "Arseny Shur",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "2",
pages = "101--??",
month = feb,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116020019",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 5 06:37:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gurevich:2016:PP,
author = "Yuri Gurevich",
title = "Past Present",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "2",
pages = "103--??",
month = feb,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400013",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 5 06:37:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{DeFelice:2016:ACA,
author = "Sven {De Felice} and Cyril Nicaud",
title = "Average Case Analysis of {Brzozowski}'s Algorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "2",
pages = "109--??",
month = feb,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400025",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 5 06:37:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Almeida:2016:SSA,
author = "Jorge Almeida and Emanuele Rodaro",
title = "Semisimple Synchronizing Automata and the
{Wedderburn--Artin} Theory",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "2",
pages = "127--??",
month = feb,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400037",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 5 06:37:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Berdinsky:2016:CAR,
author = "Dmitry Berdinsky and Bakhadyr Khoussainov",
title = "{Cayley} Automatic Representations of Wreath
Products",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "2",
pages = "147--??",
month = feb,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400049",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 5 06:37:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holzer:2016:MHM,
author = "Markus Holzer and Sebastian Jakobi",
title = "Minimal and Hyper-Minimal Biautomata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "2",
pages = "161--??",
month = feb,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400050",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 5 06:37:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kutrib:2016:SA,
author = "Martin Kutrib and Andreas Malcher and Matthias
Wendlandt",
title = "Set Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "2",
pages = "187--??",
month = feb,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400062",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 5 06:37:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{LaTorre:2016:SBP,
author = "Salvatore {La Torre} and Margherita Napoli and Gennaro
Parlato",
title = "Scope-Bounded Pushdown Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "2",
pages = "215--??",
month = feb,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400074",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 5 06:37:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Reynier:2016:VPT,
author = "Pierre-Alain Reynier and Jean-Marc Talbot",
title = "Visibly Pushdown Transducers with Well-Nested
Outputs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "2",
pages = "235--??",
month = feb,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400086",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 5 06:37:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bednarova:2016:NRM,
author = "Zuzana Bedn{\'a}rov{\'a} and Viliam Geffert and Klaus
Reinhardt and Abuzer Yakaryilmaz",
title = "New Results on the Minimum Amount of Useful Space",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "2",
pages = "259--??",
month = feb,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400098",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 5 06:37:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yakaryilmaz:2016:DST,
author = "Abuzer Yakaryilmaz and A. C. Cem Say and H. G{\"o}kalp
Demirci",
title = "Debates with Small Transparent Quantum Verifiers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "2",
pages = "283--??",
month = feb,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400104",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 5 06:37:24 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fazekas:2016:P,
author = "Szil{\'a}rd Zsolt Fazekas and Kayoko Shikishima-Tsuji
and Akihiro Yamamura",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "3",
pages = "301--??",
month = apr,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116020020",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Jun 8 05:52:50 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tian:2016:SFL,
author = "Jing Tian and Yong Shao and Xianzhong Zhao",
title = "Out Subword-Free Languages and Its Subclasses",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "3",
pages = "305--??",
month = apr,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400116",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Jun 8 05:52:50 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kunimochi:2016:SPE,
author = "Yoshiyuki Kunimochi",
title = "Some Properties of Extractable Codes and Insertable
Codes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "3",
pages = "327--??",
month = apr,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400128",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Jun 8 05:52:50 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Leupold:2016:GIL,
author = "Peter Leupold",
title = "General Idempotency Languages Over Small Alphabets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "3",
pages = "343--??",
month = apr,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411640013X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Jun 8 05:52:50 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Meduna:2016:SMG,
author = "Alexander Meduna and Ond{\v{r}}ej Soukup",
title = "Simple Matrix Grammars and Their Leftmost Variants",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "3",
pages = "359--??",
month = apr,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400141",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Jun 8 05:52:50 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shikishima-Tsuji:2016:RIH,
author = "Kayoko Shikishima-Tsuji",
title = "Regularity of Iterative Hairpin Completions of
Crossing $ (2, 2)$-Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "3",
pages = "375--??",
month = apr,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400153",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Jun 8 05:52:50 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chigahara:2016:OWJ,
author = "Hiroyuki Chigahara and Szil{\'a}rd Zsolt Fazekas and
Akihiro Yamamura",
title = "One-Way Jumping Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "3",
pages = "391--??",
month = apr,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116400165",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Jun 8 05:52:50 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Januszewski:2016:IOA,
author = "Janusz Januszewski and {\L}ukasz Zielonka",
title = "Improved Online Algorithms for $2$-Space Bounded
$2$-Dimensional Bin Packing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "4",
pages = "407--??",
month = jun,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500076",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:39:41 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Forsyth:2016:RPW,
author = "Michael Forsyth and Amlesh Jayakumar and Jarkko
Peltom{\"a}ki and Jeffrey Shallit",
title = "Remarks on Privileged Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "4",
pages = "431--??",
month = jun,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500088",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:39:41 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2016:OFH,
author = "Shanding Xu and Xiwang Cao and Guangkui Xu",
title = "Optimal Frequency-Hopping Sequence Sets Based on
Cyclotomy",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "4",
pages = "443--??",
month = jun,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411650009X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:39:41 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2016:RRU,
author = "Yongjia Wang and Xi Xiong and Haining Fan",
title = "{$ {\rm GF}(2^n) $} Redundant Representation Using
Matrix Embedding for Irreducible Trinomials",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "4",
pages = "463--??",
month = jun,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500106",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:39:41 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bera:2016:SAA,
author = "Somnath Bera and Kalpana Mahalingam",
title = "Some Algebraic Aspects of {Parikh} $q$-Matrices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "4",
pages = "479--??",
month = jun,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500118",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:39:41 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wei:2016:VNS,
author = "Zongtian Wei and Nannan Qi and Xiaokui Yue",
title = "Vertex-Neighbor-Scattering Number of Bipartite
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "4",
pages = "501--??",
month = jun,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411650012X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:39:41 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Etherington:2016:PAC,
author = "Carole J. Etherington and Matthew W. Anderson and Eric
Bach and Jon T. Butler and Pantelimon
St{\u{a}}nic{\u{a}}",
title = "A Parallel Approach in Computing Correlation Immunity
up to Six Variables",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "4",
pages = "511--??",
month = jun,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500131",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 8 14:39:41 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alatabbi:2016:ALC,
author = "Ali Alatabbi and Costas S. Iliopoulos and Alessio
Langiu and M. Sohel Rahman",
title = "Algorithms for Longest Common {Abelian} Factors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "5",
pages = "529--??",
month = aug,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500143",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 3 08:23:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Teh:2016:PMS,
author = "Wen Chean Teh",
title = "{Parikh} Matrices and Strong {$M$}-Equivalence",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "5",
pages = "545--??",
month = aug,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500155",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 3 08:23:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Vorel:2016:SSC,
author = "Vojt{\v{e}}ch Vorel",
title = "Subset Synchronization and Careful Synchronization of
Binary Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "5",
pages = "557--??",
month = aug,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500167",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 3 08:23:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tse:2016:BAT,
author = "Savio S. H. Tse",
title = "Belated Analyses of Three Credit-Based Adaptive
Polling Algorithms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "5",
pages = "579--??",
month = aug,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500179",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 3 08:23:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2016:SSS,
author = "Xianfang Wang and Jian Gao and Fang-Wei Fu",
title = "Secret Sharing Schemes from Linear Codes over {$ F_p +
\nu F_p $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "5",
pages = "595--??",
month = aug,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500180",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 3 08:23:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Caron:2016:SSP,
author = "Eddy Caron and Ajoy K. Datta and Franck Petit and
C{\'e}dric Tedeschi",
title = "Self-Stabilizing Prefix Tree Based Overlay Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "5",
pages = "607--??",
month = aug,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500192",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 3 08:23:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cassaigne:2016:ACF,
author = "Julien Cassaigne and Idrissa Kabor{\'e}",
title = "{Abelian} Complexity and Frequencies of Letters in
Infinite Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "5",
pages = "631--??",
month = aug,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500209",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 3 08:23:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Meduna:2016:C,
author = "Alexander Meduna and Ond{\v{r}}ej Soukup",
title = "Corrigendum: {``Simple Matrix Grammars and Their
Leftmost Variants [3]''}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "5",
pages = "651--??",
month = aug,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116940018",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Oct 3 08:23:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2016:OTS,
author = "Wenming Zhang and E. Zhang and Feifeng Zheng",
title = "Online Two Stage $k$-Search Problem and Its
Competitive Analysis",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "6",
pages = "653--??",
month = sep,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500210",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Nov 16 05:33:53 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lu:2016:MRL,
author = "Jiyong Lu and Jun Zhang and Xuan Guang and Fang-Wei
Fu",
title = "Multiple Repair Localities with Distinct Erasure
Tolerance",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "6",
pages = "665--??",
month = sep,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500222",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Nov 16 05:33:53 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Caron:2016:SCC,
author = "Pascal Caron and Jean-Gabriel Luque and Ludovic Mignot
and Bruno Patrou",
title = "State Complexity of Catenation Combined with a
{Boolean} Operation: A Unified Approach",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "6",
pages = "675--??",
month = sep,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500234",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Nov 16 05:33:53 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ko:2016:OSC,
author = "Sang-Ki Ko and Hae-Sung Eom and Yo-Sub Han",
title = "Operational State Complexity of Subtree-Free Regular
Tree Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "6",
pages = "705--??",
month = sep,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500246",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Nov 16 05:33:53 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aslan:2016:WRD,
author = "Ersin Aslan",
title = "Weak-Rupture Degree of Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "6",
pages = "725--??",
month = sep,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500258",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Nov 16 05:33:53 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Altundag:2016:NRD,
author = "Ferhan Nihan Altundag and Goksen Bacak-Turan",
title = "Neighbor Rupture Degree of {Harary} Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "6",
pages = "739--??",
month = sep,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411650026X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Nov 16 05:33:53 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Atanasiu:2016:NOP,
author = "Adrian Atanasiu and Wen Chean Teh",
title = "A New Operator over {Parikh} Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "6",
pages = "757--??",
month = sep,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500271",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Nov 16 05:33:53 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bonnet:2016:NEI,
author = "{\'E}douard Bonnet and Florian Sikora",
title = "A Note on Edge Isoperimetric Numbers and Regular
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "6",
pages = "771--??",
month = sep,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500283",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Nov 16 05:33:53 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kuppusamy:2016:SDC,
author = "Lakshmanan Kuppusamy and Indhumathi Raman and Kamala
Krithivasan",
title = "On Succinct Description of Certain Context-Free
Languages by Ins-Del and Matrix Ins-Del Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "7",
pages = "775--??",
month = nov,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500295",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 24 07:15:19 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kostolanyi:2016:AAW,
author = "Peter Kostol{\'a}nyi and Branislav Rovan",
title = "Automata with Auxiliary Weights",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "7",
pages = "787--??",
month = nov,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500301",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 24 07:15:19 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Caissy:2016:EFH,
author = "David Caissy and Andrzej Pelc",
title = "Exploration of Faulty {Hamiltonian} Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "7",
pages = "809--??",
month = nov,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500313",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 24 07:15:19 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fujita:2016:PLG,
author = "Satoshi Fujita",
title = "On the Power of Lookahead in Greedy Scheme for Finding
a Minimum {CDS} for Unit Disk Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "7",
pages = "829--??",
month = nov,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500325",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 24 07:15:19 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2016:FOR,
author = "Hui-Jie Xu and Wan-Dong Cai and Gui-Rong Chen",
title = "Forums-Oriented Research on the Spreading and
Inhibition of Rumors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "7",
pages = "845--??",
month = nov,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500337",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 24 07:15:19 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Han:2016:SCI,
author = "Yo-Sub Han and Sang-Ki Ko and Timothy Ng and Kai
Salomaa",
title = "State Complexity of Insertion",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "7",
pages = "863--??",
month = nov,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500349",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 24 07:15:19 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xiao:2016:ACT,
author = "Zibi Xiao and Xiangyong Zeng and Zhimin Sun",
title = "$2$-Adic Complexity of Two Classes of Generalized
Cyclotomic Binary Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "7",
pages = "879--??",
month = nov,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500350",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 24 07:15:19 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chin:2016:A,
author = "Francis Chin and Oscar H. Ibarra and Sartaj K. Sahni",
title = "Announcement",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "8",
pages = "895--896",
month = dec,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116010012",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:43:47 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Liu:2016:SNC,
author = "Haibo Liu and Qunying Liao",
title = "Some New Constructions for Generalized Zero-Difference
Balanced Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "8",
pages = "897--908",
month = dec,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500362",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:43:47 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alirezazadeh:2016:PFA,
author = "Saeid Alirezazadeh",
title = "On Pseudovarieties of Forest Algebras",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "8",
pages = "909--942",
month = dec,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500374",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:43:47 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Du:2016:DAF,
author = "Chen Fei Du and Hamoon Mousavi and Luke Schaeffer and
Jeffrey Shallit",
title = "Decision Algorithms for {Fibonacci}-Automatic Words,
{III}: Enumeration and {Abelian} Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "8",
pages = "943--964",
month = dec,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500386",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:43:47 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ko:2016:SCR,
author = "Sang-Ki Ko and Ha-Rim Lee and Yo-Sub Han",
title = "State Complexity of Regular Tree Languages for Tree
Matching",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "8",
pages = "965--980",
month = dec,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500398",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:43:47 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fujita:2016:FSC,
author = "Toru Fujita and Koji Nakano and Yasuaki Ito",
title = "Fast Simulation of {Conway}'s {Game of Life} Using
Bitwise Parallel Bulk Computation on a {GPU}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "8",
pages = "981--1004",
month = dec,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054116500404",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:43:47 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2016:AIV,
author = "Anonymous",
title = "Author Index Volume 27 (2016)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "27",
number = "8",
pages = "1005--??",
month = dec,
year = "2016",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411699001X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 21 06:43:47 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2017:SCQ,
author = "Guangkui Xu and Xiwang Cao and Shanding Xu",
title = "Several Classes of Quadratic Ternary Bent, Near-Bent
and $2$-Plateaued Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "1",
pages = "1--18",
month = jan,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500010",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:43 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2017:MMA,
author = "Rongjia Li and Chenhui Jin",
title = "Meet-in-the-Middle Attack on $ 11$-Round {$3$D} Block
Cipher",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "1",
pages = "19--28",
month = jan,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500022",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:43 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aytac:2017:BNW,
author = "Vecdi Ayta{\c{c}} and Zeynep Nihan Berberler",
title = "Binding Number and Wheel Related Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "1",
pages = "29--38",
month = jan,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500034",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:43 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gurski:2017:IRS,
author = "Frank Gurski and Patrick Gwydion Poullie",
title = "Interval Routing Schemes for Circular-Arc Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "1",
pages = "30--60",
month = jan,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500046",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:43 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhou:2017:CEE,
author = "Dongfang Zhou and Jianxi Fan and Cheng-Kuan Lin and
Jingya Zhou and Xi Wang",
title = "Cycles Embedding in Exchanged Crossed Cube",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "1",
pages = "61--76",
month = jan,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500058",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:43 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Elouasbi:2017:DRD,
author = "Samir Elouasbi and Andrzej Pelc",
title = "Deterministic Rendezvous with Detection Using Beeps",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "1",
pages = "77--97",
month = jan,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411750006X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:43 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2017:DCC,
author = "Xiang Wang and Fang-Wei Fu",
title = "Deterministic Construction of Compressed Sensing
Matrices from Codes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "2",
pages = "99--109",
month = feb,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500071",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:44 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bramas:2017:RBC,
author = "Quentin Bramas and S{\'e}bastien Tixeuil",
title = "The Random Bit Complexity of Mobile Robots
Scattering",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "2",
pages = "111--133",
month = feb,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500083",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:44 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Coons:2017:RSJ,
author = "Michael Coons",
title = "Regular Sequences and the Joint Spectral Radius",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "2",
pages = "135--140",
month = feb,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500095",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:44 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lagogiannis:2017:QOP,
author = "George Lagogiannis",
title = "Query-Optimal Partially Persistent {B}-Trees with
Constant Worst-Case Update Time",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "2",
pages = "141--169",
month = feb,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500101",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:44 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chang:2017:SER,
author = "Zuling Chang and Pinhui Ke and Yongcheng Zhao",
title = "Some Enumeration Results on Binary $ 2^n$-Periodic
Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "2",
pages = "171--184",
month = feb,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500113",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:44 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Arnold:2017:IGR,
author = "Stefan Arnold",
title = "Identifying Generalized {Reed--Muller} Codewords by
Quantum Queries",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "2",
pages = "185--194",
month = feb,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500125",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Apr 4 14:39:44 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Palioudakis:2017:WCB,
author = "Alexandros Palioudakis and Kai Salomaa and Selim G.
Akl",
title = "Worst Case Branching and Other Measures of
Nondeterminism",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "3",
pages = "195--??",
month = apr,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500137",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2017:HTN,
author = "Jing Li and Yuxing Yang and Xiaohui Gao",
title = "{Hamiltonicity} of the Torus Network Under the
Conditional Fault Model",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "3",
pages = "211--??",
month = apr,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500149",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holzer:2017:MMF,
author = "Markus Holzer and Sebastian Jakobi",
title = "More on Minimizing Finite Automata with Errors ---
Nondeterministic Machines",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "3",
pages = "229--??",
month = apr,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500150",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Teh:2017:MRS,
author = "Wen Chean Teh and Adrian Atanasiu",
title = "Minimal Reaction Systems Revisited and Reaction System
Rank",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "3",
pages = "247--??",
month = apr,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500162",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mairesse:2017:USS,
author = "Jean Mairesse and Ir{\`e}ne Marcovici",
title = "Uniform Sampling of Subshifts of Finite Type on Grids
and Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "3",
pages = "263--??",
month = apr,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500174",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2017:FCP,
author = "Meng Zhang",
title = "Fast Convolutions of Packed Strings and Pattern
Matching with Wildcards",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "3",
pages = "289--??",
month = apr,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500186",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Moslehi:2017:SBP,
author = "Zahra Moslehi and Alireza Bagheri",
title = "Separating Bichromatic Point Sets by Minimal Triangles
with a Fixed Angle",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "4",
pages = "309--??",
month = jun,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500198",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Russell:2017:GSL,
author = "Benjamin Russell and Susan Stepney",
title = "The Geometry of Speed Limiting Resources in Physical
Models of Computation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "4",
pages = "321--??",
month = jun,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500204",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bacak-Turan:2017:NRD,
author = "Goksen Bacak-Turan and Ekrem Oz",
title = "Neighbor Rupture Degree of Transformation Graphs {$
G^{xy-} $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "4",
pages = "335--??",
month = jun,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500216",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sun:2017:SCB,
author = "Zhiqiang Sun and Lei Hu",
title = "Several Classes of {Boolean} Functions with
Four-Valued {Walsh} Spectra",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "4",
pages = "357--??",
month = jun,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500228",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Grigoriev:2017:YMP,
author = "Dima Grigoriev and Laszlo B. Kish and Vladimir
Shpilrain",
title = "{Yao}'s Millionaires' Problem and Public-Key
Encryption Without Computational Assumptions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "4",
pages = "379--??",
month = jun,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411750023X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ke:2017:AMB,
author = "Pinhui Ke and Zhifan Ye and Zhengchun Zhou and Jian
Shen",
title = "Autocorrelation of the Modified Binary Two-Prime
{Sidelnikov} Sequence",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "4",
pages = "391--??",
month = jun,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500241",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hadid:2017:SAF,
author = "Rachid Hadid and Mehmet Hakan Karaata and Vincent
Villain",
title = "A Stabilizing Algorithm for Finding Two Node-Disjoint
Paths in Arbitrary Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "4",
pages = "411--??",
month = jun,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500253",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:07 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Han:2017:Pa,
author = "Yo-Sub Han and Kai Salomaa",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "5",
pages = "437--??",
month = aug,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117020014",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fulop:2017:MZE,
author = "Zolt{\'a}n F{\"u}l{\"o}p",
title = "In Memoriam {Zolt{\'a}n {\'E}sik} (1951--2016)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "5",
pages = "441--??",
month = aug,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117030010",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kapoutsis:2017:LCS,
author = "Christos A. Kapoutsis and Lamana Mulaffer",
title = "A Logical Characterization of Small {2NFAs}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "5",
pages = "445--??",
month = aug,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400019",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Seki:2017:CFH,
author = "Shinnosuke Seki and Andrew Winslow",
title = "The Complexity of Fixed-Height Patterned Tile
Self-Assembly",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "5",
pages = "465--??",
month = aug,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400020",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Belovs:2017:CCC,
author = "Aleksandrs Belovs and J. Andres Montoya and Abuzer
Yakary{\i}lmaz",
title = "On a Conjecture by {Christian Choffrut}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "5",
pages = "483--??",
month = aug,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400032",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Axelsen:2017:DID,
author = "Holger Bock Axelsen and Markus Holzer and Martin
Kutrib",
title = "The Degree of Irreversibility in Deterministic Finite
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "5",
pages = "503--??",
month = aug,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400044",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Teichmann:2017:RAW,
author = "Markus Teichmann",
title = "Regular Approximation of Weighted Linear Context-Free
Tree Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "5",
pages = "523--??",
month = aug,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400056",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sulzmann:2017:DBD,
author = "Martin Sulzmann and Kenny Zhuo Ming Lu",
title = "Derivative-Based Diagnosis of Regular Expression
Ambiguity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "5",
pages = "543--??",
month = aug,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400068",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fujiyoshi:2017:PAU,
author = "Akio Fujiyoshi",
title = "A Practical Algorithm for the Uniform Membership
Problem of Labeled Multidigraphs of Tree-Width 2 for
Spanning Tree Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "5",
pages = "563--??",
month = aug,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411740007X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bensch:2017:DST,
author = "Suna Bensch and Johanna Bj{\"o}rklund and Martin
Kutrib",
title = "Deterministic Stack Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "5",
pages = "583--??",
month = aug,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400081",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Calvo-Zaragoza:2017:CEE,
author = "Jorge Calvo-Zaragoza and Jose Oncina and Colin de la
Higuera",
title = "Computing the Expected Edit Distance from a String to
a Probabilistic Finite-State Automaton",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "5",
pages = "603--??",
month = aug,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400093",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Prusa:2017:CMS,
author = "Daniel Pr{\r{u}}{\v{s}}a",
title = "Complexity of Matching Sets of Two-Dimensional
Patterns by Two-Dimensional On-Line Tessellation
Automaton",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "5",
pages = "623--??",
month = aug,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411740010X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Dec 16 08:38:08 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Han:2017:Pb,
author = "Jinguang Han and Yogachandran Rahulamathavan and Willy
Susilo",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "641--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117020026",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ma:2017:LBI,
author = "Chunguang Ma and Juyan Li and Weiping Ouyang",
title = "Lattice-Based Identity-Based Homomorphic Conditional
Proxy Re-Encryption for Secure Big Data Computing in
Cloud Environment",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "645--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400111",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mazumder:2017:PSK,
author = "Rashed Mazumder and Atsuko Miyaji and Chunhua Su",
title = "Probably Secure Keyed-Function Based Authenticated
Encryption Schemes for Big Data",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "661--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400123",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhu:2017:PSN,
author = "Youwen Zhu and Xingxin Li and Jian Wang and Yining Liu
and Zhiguo Qu",
title = "Practical Secure Na{\"\i}ve {Bayesian} Classification
Over Encrypted Big Data in Cloud",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "683--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400135",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yu:2017:ACA,
author = "Gang Yu and Xiaoxiao Ma and Zhenfu Cao and Guang Zeng
and Wenbao Han",
title = "Accountable {CP-ABE} with Public Verifiability: How to
Effectively Protect the Outsourced Data in Cloud",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "705--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400147",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tian:2017:ORA,
author = "Yangguang Tian and Guomin Yang and Yi Mu and Shiwei
Zhang and Kaitai Liang and Yong Yu",
title = "One-Round Attribute-Based Key Exchange in the
Multi-Party Setting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "725--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400159",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhou:2017:IBB,
author = "Fucai Zhou and Su Peng and Jian Xu and Zifeng Xu",
title = "Identity-Based Batch Provable Data Possession with
Detailed Analyses",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "743--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400160",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Huang:2017:BBC,
author = "Jianye Huang and Qiong Huang and Chunhua Pan",
title = "A Black-Box Construction of Strongly Unforgeable
Signature Scheme in the Leakage Setting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "761--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400172",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chen:2017:SIE,
author = "Chin-Ling Chen and Jungpil Shin and Yu-Ting Tsai and
Aniello Castiglione and Francesco Palmieri",
title = "Securing Information Exchange in {VANETs} by Using
Pairing-Based Cryptography",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "781--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400184",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sun:2017:CPP,
author = "Jiameng Sun and Binrui Zhu and Jing Qin and Jiankun Hu
and Qianhong Wu",
title = "Confidentiality-Preserving Publicly Verifiable
Computation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "6",
pages = "799--??",
month = sep,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117400196",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Feb 9 11:49:58 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sun:2017:CAL,
author = "Lei Sun and Fangwei Fu and Jian Liu",
title = "On the Conjecture About the Linear Structures of
Rotation Symmetric {Boolean} Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "7",
pages = "819--??",
month = nov,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500265",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Feb 24 10:21:24 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aytac:2017:RRC,
author = "Aysun Ayta{\c{c}} and Zeynep Nihan Odaba{\c{s}}
Berberler",
title = "Robustness of Regular Caterpillars",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "7",
pages = "835--??",
month = nov,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500277",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Feb 24 10:21:24 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wei:2017:CES,
author = "Jianghong Wei and Xinyi Huang and Wenfen Liu and
Xuexian Hu",
title = "Cost-Effective and Scalable Data Sharing in Cloud
Storage Using Hierarchical Attribute-Based Encryption
with Forward Security",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "7",
pages = "843--??",
month = nov,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500289",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Feb 24 10:21:24 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sharma:2017:BST,
author = "Gokarna Sharma and Costas Busch",
title = "The Bursty {Steiner} Tree Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "7",
pages = "869--??",
month = nov,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500290",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Feb 24 10:21:24 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lin:2017:IID,
author = "Jie Lin and Yue Jiang and E. James Harner and Bing-Hua
Jiang and Don Adjeroh",
title = "{IDPM}: An Improved Degenerate Pattern Matching
Algorithm for Biological Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "7",
pages = "889--??",
month = nov,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500307",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Feb 24 10:21:24 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Guo:2017:FFU,
author = "Lili Guo and Xi Wang and Cheng-Kuan Lin and Jingya
Zhou and Jianxi Fan",
title = "A Fault-Free Unicast Algorithm in the Generalized
Hypercube with Restricted Faulty Vertices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "7",
pages = "915--??",
month = nov,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500319",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Feb 24 10:21:24 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wadhwa:2017:AAR,
author = "Vaishali M. Wadhwa and Deepak Garg",
title = "Approximation Algorithm for Resource Allocation
Problems with Time Dependent Penalties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "7",
pages = "931--??",
month = nov,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500320",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Feb 24 10:21:24 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Atig:2017:EOM,
author = "Mohamed Faouzi Atig and Benedikt Bollig and Peter
Habermehl",
title = "Emptiness of Ordered Multi-Pushdown Automata is
{2ETIME}-Complete",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "8",
pages = "945--??",
month = dec,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500332",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 26 07:50:45 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hong:2017:IAA,
author = "Wenyi Hong and Zhenbo Wang",
title = "Improved Approximation Algorithm for the Combination
of Parallel Machine Scheduling and Vertex Cover",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "8",
pages = "977--??",
month = dec,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500344",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 26 07:50:45 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2017:ERD,
author = "Yinkui Li and Mingzhe Du and Hongyan Li and Xiaolin
Wang",
title = "Edge Rupture Degree of Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "8",
pages = "993--??",
month = dec,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500356",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 26 07:50:45 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Azimi:2017:MSL,
author = "Sepinoud Azimi and Charmi Panchal and Andrzej Mizera
and Ion Petre",
title = "Multi-Stability, Limit Cycles, and Period-Doubling
Bifurcation with Reaction Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "8",
pages = "1007--??",
month = dec,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500368",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 26 07:50:45 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Trejo-Sanchez:2017:SSA,
author = "Joel Antonio Trejo-S{\'a}nchez and Jos{\'e} Alberto
Fern{\'a}ndez-Zepeda and Julio C{\'e}sar
Ram{\'\i}rez-Pacheco",
title = "A Self-Stabilizing Algorithm for a Maximal $2$-Packing
in a Cactus Graph Under Any Scheduler",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "8",
pages = "1021--??",
month = dec,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411750037X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 26 07:50:45 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2017:SSC,
author = "Pingshan Li and Min Xu",
title = "The Super Spanning Connectivity of Arrangement
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "8",
pages = "1047--??",
month = dec,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117500381",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 26 07:50:45 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2017:AIV,
author = "Anonymous",
title = "Author Index Volume 28 (2017)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "28",
number = "8",
pages = "1073--??",
month = dec,
year = "2017",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054117990015",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Feb 26 07:50:45 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Vorel:2018:BPJ,
author = "Vojt{\v{e}}ch Vorel",
title = "On Basic Properties of Jumping Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "1",
pages = "1--??",
month = jan,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500016",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 20 11:30:32 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Luck:2018:QQO,
author = "Martin L{\"u}ck",
title = "Quirky Quantifiers: Optimal Models and Complexity of
Computation Tree Logic",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "1",
pages = "17--??",
month = jan,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500028",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 20 11:30:32 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kedad-Sidhoum:2018:FSA,
author = "Safia Kedad-Sidhoum and Florence Monna and Gr{\'e}gory
Mouni{\'e} and Denis Trystram",
title = "A Family of Scheduling Algorithms for Hybrid Parallel
Platforms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "1",
pages = "63--??",
month = jan,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411850003X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 20 11:30:32 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lin:2018:ELE,
author = "Nianfeng Lin and Damei L{\"u} and Jinhua Wang",
title = "{$ L(2, 1) $}-Edge-Labelings of the
Edge-Path-Replacement of a Graph",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "1",
pages = "91--??",
month = jan,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500041",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 20 11:30:32 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lopez-Ortiz:2018:AOC,
author = "Alejandro L{\'o}pez-Ortiz and Cynthia B. Perez and
Jazm{\'\i}n Romero",
title = "Arbitrary Overlap Constraints in Graph Packing
Problems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "1",
pages = "101--??",
month = jan,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500053",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 20 11:30:32 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Poovanandran:2018:MES,
author = "Ghajendran Poovanandran and Wen Chean Teh",
title = "On {$M$}-Equivalence and Strong {$M$}-Equivalence for
{Parikh} Matrices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "1",
pages = "123--??",
month = jan,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500065",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 20 11:30:32 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Potapov:2018:P,
author = "Igor Potapov and Pavel Semukhin",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "2",
pages = "139--??",
month = feb,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118010013",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Apr 12 06:33:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bannai:2018:DPF,
author = "Hideo Bannai and Travis Gagie and Shunsuke Inenaga and
Juha K{\"a}rkk{\"a}inen and Dominik Kempa and Marcin
Pi{\k{a}}tkowski and Shiho Sugimoto",
title = "Diverse Palindromic Factorization is {NP}-Complete",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "2",
pages = "143--??",
month = feb,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118400014",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Apr 12 06:33:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Berwanger:2018:CGA,
author = "Dietmar Berwanger and Marie van den Bogaard",
title = "Consensus Game Acceptors and Iterated Transductions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "2",
pages = "165--??",
month = feb,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118400026",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Apr 12 06:33:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bianchi:2018:STW,
author = "Maria Paola Bianchi and Juraj Hromkovi{\v{c}} and Ivan
Kov{\'a}{\v{c}}",
title = "On the Size of Two-Way Reasonable Automata for the
Liveness Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "2",
pages = "187--??",
month = feb,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118400038",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Apr 12 06:33:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Czyba:2018:FAI,
author = "Christopher Czyba and Wolfgang Thomas and Christopher
Spinrath",
title = "Finite Automata Over Infinite Alphabets: Two Models
with Transitions for Local Change",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "2",
pages = "213--??",
month = feb,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411840004X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Apr 12 06:33:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Eremondi:2018:DCF,
author = "Joey Eremondi and Oscar H. Ibarra and Ian McQuillan",
title = "On the Density of Context-Free and Counter Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "2",
pages = "233--??",
month = feb,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118400051",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Apr 12 06:33:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holzer:2018:MRD,
author = "Markus Holzer and Sebastian Jakobi and Martin Kutrib",
title = "Minimal Reversible Deterministic Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "2",
pages = "251--??",
month = feb,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118400063",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Apr 12 06:33:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jecker:2018:MSW,
author = "Isma{\"e}l Jecker and Emmanuel Filiot",
title = "Multi-Sequential Word Relations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "2",
pages = "271--??",
month = feb,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118400075",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Apr 12 06:33:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Klimann:2018:CSR,
author = "Ines Klimann and Matthieu Picantin and Dmytro
Savchuk",
title = "A Connected $3$-State Reversible {Mealy} Automaton
Cannot Generate an Infinite {Burnside} Group",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "2",
pages = "297--??",
month = feb,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118400087",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Apr 12 06:33:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ng:2018:SCN,
author = "Timothy Ng and David Rappaport and Kai Salomaa",
title = "State Complexity of Neighbourhoods and Approximate
Pattern Matching",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "2",
pages = "315--??",
month = feb,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118400099",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Apr 12 06:33:34 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bucci:2018:GPL,
author = "Michelangelo Bucci and Gwena{\"e}l Richomme",
title = "Greedy Palindromic Lengths",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "3",
pages = "331--356",
month = apr,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500077",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 10 06:25:10 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bibak:2018:AUH,
author = "Khodakhast Bibak and Bruce M. Kapron and Venkatesh
Srinivasan and L{\'a}szl{\'o} T{\'o}th",
title = "On an Almost-Universal Hash Function Family with
Applications to Authentication and Secrecy Codes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "3",
pages = "357--375",
month = apr,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500089",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 10 06:25:10 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Derakhshan:2018:OBD,
author = "Parisa Derakhshan and Walter Hussak",
title = "Optimal Bounds for Disjoint {Hamilton} Cycles in Star
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "3",
pages = "377--389",
month = apr,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500090",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 10 06:25:10 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kavand:2018:TST,
author = "Pardis Kavand and Ali Mohades",
title = "A Time-Space Trade-off for the Shortest Path Tree in a
Simple Polygon",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "3",
pages = "391--402",
month = apr,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500107",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 10 06:25:10 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bera:2018:PPM,
author = "Somnath Bera and Kalpana Mahalingam and K. G.
Subramanian",
title = "Properties of {Parikh} Matrices of Binary Words
Obtained by an Extension of a Restricted Shuffle
Operator",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "3",
pages = "403--413",
month = apr,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500119",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 10 06:25:10 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ozelim:2018:IDF,
author = "Luan Carlos de Sena Monteiro Ozelim and Andre Luis
Brasil Cavalcante",
title = "The Iota-Delta Function as an Alternative to {Boolean}
Formalism",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "3",
pages = "415--423",
month = apr,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500120",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 10 06:25:10 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nakanishi:2018:QPA,
author = "Masaki Nakanishi",
title = "Quantum Pushdown Automata with Garbage Tape",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "3",
pages = "425--446",
month = apr,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500132",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 10 06:25:10 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Berberler:2018:LVN,
author = "Zeynep Nihan Berberler and Esin Yigit",
title = "Link Vulnerability in Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "3",
pages = "447--456",
month = apr,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500144",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 10 06:25:10 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kari:2018:P,
author = "Jarkko Kari and Alexander Okhotin",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "4",
pages = "457--459",
month = jun,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118020021",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Jun 30 07:19:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Angelini:2018:ABD,
author = "Patrizio Angelini and Giordano {Da Lozzo} and Marco
{Di Bartolomeo} and Valentino {Di Donato} and Maurizio
Patrignani and Vincenzo Roselli and Ioannis G. Tollis",
title = "Algorithms and Bounds for {$L$}-Drawings of Directed
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "4",
pages = "461--480",
month = jun,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118410010",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Jun 30 07:19:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aydinian:2018:CMT,
author = "Harout Aydinian and Ferdinando Cicalese and Christian
Deppe and Vladimir Lebedev",
title = "A Combinatorial Model of Two-Sided Search",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "4",
pages = "481--504",
month = jun,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118410022",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Jun 30 07:19:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bianchi:2018:OMS,
author = "Maria Paola Bianchi and Hans-Joachim B{\"o}ckenhauer
and Tatjana Br{\"u}lisauer and Dennis Komm and Beatrice
Palano",
title = "Online Minimum Spanning Tree with Advice",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "4",
pages = "505--527",
month = jun,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118410034",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Jun 30 07:19:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bournez:2018:RPO,
author = "Olivier Bournez and Oleksiy Kurganskyy and Igor
Potapov",
title = "Reachability Problems for One-Dimensional Piecewise
Affine Maps",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "4",
pages = "529--549",
month = jun,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118410046",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Jun 30 07:19:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Burjons:2018:OGC,
author = "Elisabet Burjons and Juraj Hromkovi{\v{c}} and
Rastislav Kr{\'a}lovi{\v{c}} and Richard
Kr{\'a}lovi{\v{c}} and Xavier Mu{\~n}oz and Walter
Unger",
title = "Online Graph Coloring Against a Randomized Adversary",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "4",
pages = "551--569",
month = jun,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118410058",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Jun 30 07:19:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gazda:2018:CYO,
author = "M. W. Gazda and T. A. C. Willemse",
title = "Cooking Your Own Parity Game Preorders Through
Matching Plays",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "4",
pages = "571--590",
month = jun,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905411841006X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Jun 30 07:19:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gehrke:2018:PSU,
author = "Jan Clemens Gehrke and Klaus Jansen and Stefan E. J.
Kraft and Jakob Schikowski",
title = "A {PTAS} for Scheduling Unrelated Machines of Few
Different Types",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "4",
pages = "591--621",
month = jun,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118410071",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Jun 30 07:19:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hyyro:2018:DRC,
author = "Heikki Hyyr{\"o} and Shunsuke Inenaga",
title = "Dynamic {RLE}-Compressed Edit Distance Tables Under
General Weighted Cost Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "4",
pages = "623--645",
month = jun,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118410083",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Jun 30 07:19:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kravchenko:2018:GSF,
author = "Dmitry Kravchenko and Nikolajs Nahimovs and Alexander
Rivosh",
title = "{Grover}'s Search with Faults on Some Marked
Elements",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "4",
pages = "647--662",
month = jun,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118410095",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Jun 30 07:19:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kwee:2018:NOR,
author = "Kent Kwee and Friedrich Otto",
title = "Nondeterministic Ordered Restarting Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "4",
pages = "663--685",
month = jun,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118410101",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Jun 30 07:19:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nahimovs:2018:QWT,
author = "Nikolajs Nahimovs and Alexander Rivosh",
title = "Quantum Walks on Two-Dimensional Grids with Multiple
Marked Locations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "4",
pages = "687--700",
month = jun,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118410113",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Jun 30 07:19:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Masse:2018:P,
author = "Alexandre Blondin Mass{\'e} and Sre{\v{c}}ko Brlek and
Christophe Reutenauer",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "701--704",
month = aug,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118020033",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118020033",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Berthe:2018:RSD,
author = "V. Berth{\'e} and F. Dolce and F. Durand and J. Leroy
and D. Perrin",
title = "Rigidity and Substitutive Dendric Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "705--720",
month = aug,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118420017",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118420017",
abstract = "Dendric words are infinite words that are defined in
terms of extension graphs. These are bipartite graphs
that describe the left and right extensions of factors.
Dendric words are such that all their extension graphs
are trees. They are also called tree words. This class
of words includes classical families of words such as
Sturmian words, codings of interval exchanges, or else,
Arnoux--Rauzy words. We investigate here the properties
of substitutive dendric words and prove some rigidity
properties, that is, algebraic properties on the set of
substitutions that fix a dendric word. We also prove
that aperiodic minimal dendric subshifts (generated by
dendric words) cannot have rational topological
eigenvalues, and thus, cannot be generated by constant
length substitutions.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Charlier:2018:PNB,
author = "{\'E}milie Charlier and Wolfgang Steiner",
title = "Permutations and Negative Beta-Shifts",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "721--740",
month = aug,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118420029",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118420029",
abstract = "Elizalde (2011) characterized which permutations can
be obtained by ordering consecutive elements in the
trajectories of (positive) beta-transformations and
beta-shifts. We prove similar results for negative
bases beta.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chauve:2018:CGA,
author = "Cedric Chauve and Julien Courtiel and Yann Ponty",
title = "Counting, Generating, Analyzing and Sampling Tree
Alignments",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "741--767",
month = aug,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118420030",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118420030",
abstract = "Pairwise ordered tree alignment are combinatorial
objects that appear in important applications, such as
RNA secondary structure comparison. However, the usual
representation of tree alignments as supertrees is
ambiguous, i.e. two distinct supertrees may induce
identical sets of matches between identical pairs of
trees. This ambiguity is uninformative, and detrimental
to any probabilistic analysis. In this work, we
consider tree alignments up to equivalence. Our first
result is a precise asymptotic enumeration of tree
alignments, obtained from a context-free grammar by
mean of basic analytic combinatorics. Our second result
focuses on alignments between two given ordered trees S
S S and T T T . By refining our grammar to align
specific trees, we obtain a decomposition scheme for
the space of alignments, and use it to design an
efficient dynamic programming algorithm for sampling
alignments under the Gibbs-Boltzmann probability
distribution. This generalizes existing tree alignment
algorithms, and opens the door for a probabilistic
analysis of the space of suboptimal alignments.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bedon:2018:CBA,
author = "Nicolas Bedon",
title = "Complementation of Branching Automata for Scattered
and Countable {$N$}-Free Posets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "769--799",
month = aug,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118420042",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118420042",
abstract = "We prove the effective closure under complementation
of the class of languages of scattered and countable N
N N -free posets recognized by branching automata.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dartois:2018:AST,
author = "Luc Dartois and Isma{\"e}l Jecker and Pierre-Alain
Reynier",
title = "Aperiodic String Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "801--824",
month = aug,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118420054",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118420054",
abstract = "Regular string-to-string functions enjoy a nice triple
characterization through deterministic two-way
transducers (2DFT), streaming string transducers (SST)
and MSO definable functions. This result has recently
been lifted to FO definable functions, with equivalent
representations by means of aperiodic 2DFT and
aperiodic 1-bounded SST, extending a well-known result
on regular languages. In this paper, we give three
direct transformations: (i) from 1-bounded SST to 2DFT,
(ii) from 2DFT to copyless SST, and (iii) from
k-bounded to 1-bounded SST. We give the complexity of
each construction and also prove that they preserve the
aperiodicity of transducers. As corollaries, we obtain
that FO definable string-to-string functions are
equivalent to SST whose transition monoid is finite and
aperiodic, and to aperiodic copyless SST.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Endrullis:2018:DIW,
author = "J{\"o}rg Endrullis and Juhani Karhum{\"a}ki and Jan
Willem Klop and Aleksi Saarela",
title = "Degrees of Infinite Words, Polynomials and Atoms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "825--843",
month = aug,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118420066",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118420066",
abstract = "We study finite-state transducers and their power for
transforming infinite words. Infinite sequences of
symbols are of paramount importance in a wide range of
fields, from formal languages to pure mathematics and
physics. While finite automata for recognising and
transforming languages are well-understood, very little
is known about the power of automata to transform
infinite words. The word transformation realised by
finite-state transducers gives rise to a complexity
comparison of words and thereby induces equivalence
classes, called (transducer) degrees, and a partial
order on these degrees. The ensuing hierarchy of
degrees is analogous to the recursion-theoretic degrees
of unsolvability, also known as Turing degrees, where
the transformational devices are Turing machines.
However, as a complexity measure, Turing machines are
too strong: they trivialise the classification problem
by identifying all computable words. Finite-state
transducers give rise to a much more fine-grained,
discriminating hierarchy. In contrast to Turing
degrees, hardly anything is known about transducer
degrees, in spite of their naturality. We use methods
from linear algebra and analysis to show that there are
infinitely many atoms in the transducer degrees, that
is, minimal non-trivial degrees.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gasnikov:2018:SFP,
author = "Daniil Gasnikov and Arseny M. Shur",
title = "Square-Free Partial Words with Many Wildcards",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "846--860",
month = aug,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118420078",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118420078",
abstract = "We contribute to the study of square-free words. The
classical notion of a square-free word has a natural
generalization to partial words, studied in several
papers since 2008. We prove that the maximal density of
wildcards in the ternary infinite square-free partial
word is surprisingly big: 3/16 3/16 3/16 . Further we
show that the density of wildcards in a finitary
infinite square-free partial words is at most 1/3 1/3
1/3 and this bound is reached by a quaternary word. We
demonstrate that partial square-free words can be
viewed as ``usual'' square-free words with some letters
replaced by wildcards and introduce the corresponding
characteristic of infinite square-free words, called
flexibility. The flexibility is estimated for some
important words and classes of words; an interesting
phenomenon is the existence of ``rigid'' square-free
words, having no room for wildcards at all.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jirasek:2018:OUF,
author = "Jozef {Jir{\'a}sek, Jr.} and Galina Jir{\'a}skov{\'a}
and Juraj {\v{S}}ebej",
title = "Operations on Unambiguous Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "861--876",
month = aug,
year = "2018",
DOI = "https://doi.org/10.1142/S012905411842008X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905411842008X",
abstract = "A nondeterministic finite automaton is unambiguous if
it has at most one accepting computation on every input
string. We investigate the state complexity of basic
regular operations on languages represented by
unambiguous finite automata. We get tight upper bounds
for reversal (n), intersection (mn), left and right
quotients (2^n - 1), positive closure ((3/4)2^{n - 1}),
star ((3/4)2^n), shuffle (2^{mn} - 1), and
concatenation ((3/4)2^{m + n} - 1). To prove tightness,
we use a binary alphabet for intersection and left and
right quotients, a ternary alphabet for star and
positive closure, a five-letter alphabet for shuffle,
and a seven-letter alphabet for concatenation. For
complementation, we reduce the trivial upper bound 2^n
to 20.7856n + \log n. We also get some partial results
for union and square.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Maletti:2018:CTT,
author = "Andreas Maletti",
title = "Compositions of Tree-to-Tree Statistical Machine
Translation Models",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "877--892",
month = aug,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118420091",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118420091",
abstract = "The well-known synchronous context-free grammars
(SCFGs) and synchronous tree-substitution grammars
(STSGs), both of which are used as tree-to-tree
translation models in statistical machine translation
are investigated. Their composition hierarchies are
established in both the unweighted as well as the
weighted case. More precisely, it is shown that SCFGs
are closed under composition in both cases and that
there is a close connection between compositions of
STSGs and compositions of certain tree transducers.
With the help of the close ties, the composition
closure of STSGs is identified in both cases as well.
The results for the weighted case utilize a new lifting
technique that might prove useful also in similar
setups.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Manea:2018:CSR,
author = "Florin Manea and Dirk Nowotka and Markus L. Schmid",
title = "On the Complexity of Solving Restricted Word
Equations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "893--909",
month = aug,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118420108",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118420108",
abstract = "We investigate the complexity of the solvability
problem for restricted classes of word equations with
and without regular constraints. The solvability
problem for unrestricted word equations remains NP NP
NP -hard, even if, on both sides, between any two
occurrences of the same variable no other different
variable occurs; for word equations with regular
constraints, the solvability problems remains NP NP NP
-hard for equations whose two sides share no variables
or with two variables, only one of which is repeated.
On the other hand, word equations with only one
repeated variable (but an arbitrary number of
variables) and at least one non-repeated variable on
each side, can be solved in polynomial-time.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Michalewski:2018:SUT,
author = "Henryk Michalewski and Micha{\l} Skrzypczak",
title = "On the Strength of Unambiguous Tree Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "911--933",
month = aug,
year = "2018",
DOI = "https://doi.org/10.1142/S012905411842011X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905411842011X",
abstract = "This work is a study of the class of non-deterministic
automata on infinite trees that are unambiguous i.e.
have at most one accepting run on every tree. The
motivating question asks if the fact that an automaton
is unambiguous implies some drop in the descriptive
complexity of the language recognised by the automaton.
As it turns out, such a drop occurs for the parity
index and does not occur for the weak parity index.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nowotka:2018:OVW,
author = "Dirk Nowotka and Aleksi Saarela",
title = "One-Variable Word Equations and Three-Variable
Constant-Free Word Equations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "5",
pages = "935--950",
month = aug,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118420121",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118420121",
abstract = "We prove connections between one-variable word
equations and three-variable constant-free word
equations, and use them to prove that the number of
equations in an independent system of three-variable
constant-free equations is at most logarithmic with
respect to the length of the shortest equation in the
system. We also study two well-known conjectures. The
first conjecture claims that there is a constant c such
that every one-variable equation has either infinitely
many solutions or at most c. The second conjecture
claims that there is a constant c such that every
independent system of three-variable constant-free
equations with a nonperiodic solution is of size at
most c. We prove that the first conjecture implies the
second one, possibly for a different constant.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mignot:2018:EAC,
author = "Ludovic Mignot and Nadia Ouali-Sebti and Djelloul
Ziadi",
title = "An Efficient Algorithm for the Construction of the
Equation Tree Automaton",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "6",
pages = "951--978",
month = sep,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500156",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:47 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500156",
abstract = "Champarnaud et al., and Khorsi et al. show how to
compute the equation automaton of a word regular
expression $E$ via the C-continuations. Kuske and
Meinecke extend the computation of the equation
automaton to a regular tree expression $E$ over a
ranked alphabet $ \Sigma $ and produce a $ O(R \cdot
|E|^2)$ time and space complexity algorithm, where R is
the maximal rank of a symbol occurring in $ \Sigma $
and $ |E|$ is the size of the syntax tree of $E$. In
this paper, we give a full description of an algorithm
based on the acyclic minimization of Revuz in order to
compute the pseudo-continuations from the
C-continuations. Our algorithm, which is performed in $
O(|Q| \cdot |E|)$ time and space complexity, where $
|Q|$ is the number of states of the produced automaton,
is more efficient than the one obtained by Kuske and
Meinecke since $ |Q| \lessequal |E|$. Moreover, our
algorithm is an output-sensitive algorithm, i.e. the
complexity of which is based on the size of the
produced automaton.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Darmann:2018:MSP,
author = "Andreas Darmann and Janosch D{\"o}cker and Britta
Dorn",
title = "The Monotone Satisfiability Problem with Bounded
Variable Appearances",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "6",
pages = "979--993",
month = sep,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500168",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:47 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500168",
abstract = "The prominent Boolean formula satisfiability problem
SAT is known to be NP-complete even for very restricted
variants such as 3-SAT, Monotone 3-SAT, or Planar
3-SAT, or instances with bounded variable appearance.
We settle the computational complexity status for two
variants with bounded variable appearance: We show that
Planar Monotone Sat --- the variant of Monotone Sat in
which the incidence graph is required to be planar ---
is NP-complete even if each clause consists of at most
three distinct literals and each variable appears
exactly three times, and that Monotone Sat is
NP-complete even if each clause consists of three
distinct literals and each variable appears exactly
four times in the formula. The latter confirms a
conjecture stated in scribe notes [7] of an MIT lecture
by Eric Demaine. In addition, we provide hardness
results with respect to bounded variable appearances
for two variants of Planar Monotone Sat.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhao:2018:CEC,
author = "Shuli Zhao and Weihua Yang and Shurong Zhang and
Liqiong Xu",
title = "Component Edge Connectivity of Hypercubes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "6",
pages = "995--1001",
month = sep,
year = "2018",
DOI = "https://doi.org/10.1142/S012905411850017X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:47 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905411850017X",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Liu:2018:REC,
author = "Yu-Liang Liu and Jou-Ming Chang",
title = "Realizing Exchanged Crossed Cube Communication
Patterns on Linear Array {WDM} Optical Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "6",
pages = "1003--1021",
month = sep,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500181",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:47 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500181",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chung:2018:ERN,
author = "Heewon Chung and Myungsun Kim",
title = "Encoding of Rational Numbers and Their Homomorphic
Computations for {FHE}-Based Applications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "6",
pages = "1023--1044",
month = sep,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500193",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:47 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500193",
abstract = "This work addresses a basic problem of security
systems that operate on very sensitive information.
Specifically, we are interested in the problem of
privately handling numeric data represented by rational
numbers (e.g., medical records). Fully homomorphic
encryption (FHE) is one of the natural and powerful
tools for ensuring privacy of sensitive data, while
allowing complicated computations on the data. However,
because the native plaintext domain of known FHE
schemes is restricted to a set of quite small integers,
it is not easy to obtain efficient algorithms for
encrypted rational numbers in terms of space and
computation costs. For example, the na{\"\i}ve decimal
representation considerably restricts the choice of
parameters in employing an FHE scheme, particularly the
plaintext size. Our basic strategy is to alleviate this
inefficiency by using a different representation of
rational numbers instead of na{\"\i}ve expressions. In
this work we express rational numbers as continued
fractions. Because continued fractions enable us to
represent rational numbers as a sequence of integers,
we can use a plaintext space with a small size while
preserving the same quality of precision. However, this
encoding technique requires performing very complex
arithmetic operations, such as division and modular
reduction. Theoretically, FHE allows the evaluation of
any function, including modular reduction at encrypted
data, but it requires a Boolean circuit of very high
degree to be constructed. Hence, the primary
contribution of this work is developing an approach to
solve this efficiency problem using homomorphic
operations with small degrees.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Guellouma:2018:TAR,
author = "Younes Guellouma and Hadda Cherroun",
title = "From Tree Automata to Rational Tree Expressions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "6",
pages = "1045--1062",
month = sep,
year = "2018",
DOI = "https://doi.org/10.1142/S012905411850020X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:47 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905411850020X",
abstract = "We propose a construction of rational tree expression
from finite tree automata. First, we define rational
expression equation systems and we propose a
substitution based method to find the unique solution.
Furthermore, we discuss the case of recursion being
present in an equation system, and then show under
which restrictions such systems can effectively be
solved. Secondly, we show that any finite tree
automaton can be associated to a rational tree equation
system, and that the latter can in turn be resolved.
Finally, using the previous steps, a rational tree
expression equivalent to the underlying automaton is
extracted.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhou:2018:CBG,
author = "Caixue Zhou and Guangyong Gao and Zongmin Cui and
Zhiqiang Zhao",
title = "Certificate-Based Generalized Ring Signcryption
Scheme",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "6",
pages = "1063--1088",
month = sep,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500211",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:47 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500211",
abstract = "Generalized ring signcryption (GRSC) can realize ring
signature and ring signcryption functions with only one
key pair and one algorithm. It is very useful for a
system with a large number of users, or whose function
may be changed, or with limited storage space. We give
a formal definition and security model of GRSC in the
certificate-based cryptosystem setting and propose a
concrete scheme by using bilinear pairings. The
confidentiality of our scheme can be proved under the
GBDH and CDH assumptions and the unforgeability of our
scheme can be proved under GDH' and CDH assumptions in
the random oracle model, and what is more, our scheme
has unconditional anonymity. Compared with other
certificateless ring signcryption schemes that use
bilinear pairings, it is a highly efficient one.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2018:SER,
author = "Meng Zhang and Yi Zhang",
title = "Space-Efficient Representations for {Glushkov}
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "7",
pages = "1089--1105",
month = nov,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118500223",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500223",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2018:ERS,
author = "Hong Wang and Jie Guan and Lin Ding",
title = "On Equivalence Relations of State Diagram of Cascade
Connection of an {LFSR} into an {NFSR}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "7",
pages = "1107--1117",
month = nov,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500235",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500235",
abstract = "Grain is one of the hardware-oriented finalists of the
eSTREAM. The cipher has a cascade connection of an LFSR
into an NFSR which is denoted by Cascade Model. In this
paper, we study the equivalence relations between state
diagrams of two functions, and apply them to the
Cascade Models, then some results regarding their
equivalence relations are obtained.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kurkcu:2018:CBE,
author = "{\"O}m{\"u}r K{\i}van{\c{c}} K{\"u}rk{\c{c}}{\"u} and
Ersin Aslan",
title = "A Comparison Between Edge Neighbor Rupture Degree and
Edge Scattering Number in Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "7",
pages = "1119--1142",
month = nov,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500247",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500247",
abstract = "The vulnerability measure of a graph or a network
depends on robustness of the remained graph, after
being exposed to any intervention or attack. In this
paper, we consider two edge vulnerability parameters
that are the edge neighbor rupture degree and the edge
scattering number. The values of these parameters of
some specific graphs and their graph operations are
calculated. Thus, we analyze and compare which
parameter is distinctive for the different type of
graphs by using tables.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shi:2018:SDF,
author = "Minjia Shi and Hongwei Zhu and Liqin Qian and Patrick
Sol{\'e}",
title = "On Self-Dual Four Circulant Codes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "7",
pages = "1143--1150",
month = nov,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500259",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500259",
abstract = "Four circulant codes form a special class of
2-generator, index 4, quasi-cyclic codes. Under some
conditions on their generator matrix they can be shown
to be self-dual. Artin primitive root conjecture shows
the existence of an infinite subclass of these codes
satisfying a modified Gilbert--Varshamov bound.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ciftci:2018:EIN,
author = "Canan {\c{C}}ift{\c{c}}i and Aysun Ayta{\c{c}}",
title = "Exponential Independence Number of Some Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "7",
pages = "1151--1164",
month = nov,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500260",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500260",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Teh:2018:CFP,
author = "Wen Chean Teh",
title = "Compositions of Functions and Permutations Specified
by Minimal Reaction Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "7",
pages = "1165--1179",
month = nov,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500272",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500272",
abstract = "This paper studies mathematical properties of reaction
systems that were introduced by Ehrenfeucht and
Rozenberg as computational models inspired by
biochemical reaction in the living cells. In
particular, we continue the study on the generative
power of functions specified by minimal reaction
systems under composition initiated by Salomaa.
Allowing degenerate reaction systems, functions
specified by minimal reaction systems over a
quarternary alphabet that are permutations generate the
alternating group on the power set of the background
set.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yan:2018:DAB,
author = "Shuo Yan and Yunyong Zhang and Binfeng Yan and Lin Yan
and Jinfeng Kou",
title = "Data Associations Between Two Hierarchy Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "7",
pages = "1181--1201",
month = nov,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500284",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500284",
abstract = "To study the data association, a structure called a
hierarchy tree is constructed. It is based on the
approach to hierarchical data processing, and
constituted by different level partitions of a data
set. This leads to the definition of the data
association, thereby links two hierarchy trees
together. The research on the data association focuses
on the way to check whether data are associated with
other data. The investigation includes the issues: the
intuitive and formal methods for constructing hierarchy
trees, the technique of making granules hierarchical,
the sufficient and necessary condition for measuring
the data association, the analysis of basing the closer
data association on the closer data identity, the
discussion of connecting numerical information with
association closeness, etc. Crucially, the hierarchical
data processing and numerical information are important
characteristics of the research. As an applied example,
two hierarchy trees are set up, demonstrating the
hierarchical granulation process of two actual data
sets. Data associations between the data sets are
characterized by the approach developed in this paper,
which provides the basis of algorithm design for the
actual problem. In particular, since the research is
relevant to granules and alterations of granularity, it
may offer an avenue of research on granular
computing.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Koga:2018:CFP,
author = "Toshihiro Koga",
title = "Context-Freeness of Parsing Expression Languages is
Undecidable",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "7",
pages = "1203--1213",
month = nov,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500296",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500296",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Roayaei:2018:PCD,
author = "Mehdy Roayaei and MohammadReza Razzazi",
title = "Parameterized Complexity of Directed {Steiner} Network
with Respect to Shared Vertices and Arcs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "7",
pages = "1215--1230",
month = nov,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500302",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500302",
abstract = "We consider the directed Steiner network problem,
where given a weighted directed graph $G$ and $p$ pairs
of vertices $ P = \{ (s_1, t_1), \ldots {}, (s_p, t_p)
\} $, one has to find the minimum weight subgraph $H$
of $G$ that contains path from $ s_i$ to $ t_i$ for all
$i$. We search for the main cause of the complexity of
the problem and introduce the notions of junction
vertex and shared segment in an optimal solution. We
study the parameterized complexity of the problem with
respect to these parameters and achieve several
parameterized hardness results. Also, we present two
output-sensitive algorithms for the problem, which are
much simpler and easier to implement than the
previously best known one; and in addition, when the
paths corresponding to the input pairs have few shared
vertices or arcs in the optimal solution, these
algorithms outperform the previous one.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nouri-Baygi:2018:CCA,
author = "Mostafa Nouri-Baygi",
title = "The Computational Complexity of and Approximation
Algorithms for Variants of the Component Selection
Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "7",
pages = "1231--1245",
month = nov,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118500314",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Mon Nov 12 14:26:50 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054118500314",
abstract = "In the past decades, there has been a burst of
activity to simplify implementation of complex software
systems. The solution framework in software engineering
community for this problem is called component-based
software design (CBSD), whereas in the modeling and
simulation community it is called composability.
Composability is a complex feature due to the
challenges of creating components, selecting
combinations of components, and integrating the
selected components. In this paper, we address the
challenge through the analysis of Component Selection
(CS), the NP-complete process of selecting a minimal
set of components to satisfy a set of objectives. Due
to the computational complexity of CS, we consider
approximation algorithms that make the component
selection process practical. We define three variations
of CS and present good approximation algorithms to find
near optimal solutions. In spite of our creation of
approximable variants of Component Selection, we prove
that the general Component Selection problem is
inapproximable.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Iliopoulos:2018:P,
author = "Costas S. Iliopoulos and Fatima Vayani",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "8",
pages = "1247--1248",
month = dec,
year = "2018",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054118020045",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 27 05:21:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Salikhov:2018:ICD,
author = "Kamil Salikhov",
title = "Improved Compression of {DNA} Sequencing Data with
Cascading {Bloom} Filters",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "8",
pages = "1249--1255",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118430013",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 27 05:21:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "Modern DNA sequencing technologies generate prodigious
volumes of sequence data consisting of short DNA
fragments (reads). Storing and transferring this data
is often challenging. With this motivation, several
specialized compression methods have been developed. In
this paper, we present an improvement of the lossless
reference-free compression algorithm, suggested by
Rozov et al., based on the technique of cascading Bloom
filters. Through computational experiments on real
data, we demonstrate that our method results in a
significant associated memory reduction in practice.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Poyias:2018:MBP,
author = "Andreas Poyias and Simon J. Puglisi and Rajeev Raman",
title = "{m-Bonsai}: A Practical Compact Dynamic Trie",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "8",
pages = "1257--1278",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118430025",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 27 05:21:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "We consider the problem of implementing a
space-efficient dynamic trie, with an emphasis on good
practical performance. For a trie with $n$ nodes with
an alphabet of size $ \sigma $, the
information-theoretic space lower bound is $ n \log
\sigma + O(n)$ bits. The Bonsai data structure is a
compact trie proposed by Darragh et al. (Softw. Pract.
Exper. {\bf 23}(3) (1993) 277--291). Its disadvantages
include the user having to specify an upper bound $M$
on the trie size in advance (which cannot be changed
easily after initalization), a space usage of $ M \log
\sigma + O(M \log \log M)$ (which is asymptotically
non-optimal for smaller $ \sigma $ or if $ n \ll M$)
and a lack of support for deletions. It supports
traversal and update operations in $ O(1 / \epsilon)$
expected time (based on assumptions about the behaviour
of hash functions), where $ \epsilon = (M - n) / M$ and
has excellent speed performance in practice. We propose
an alternative, m-Bonsai, that addresses the above
problems, obtaining a trie that uses $ (1 + \beta) n
(\log \sigma + O(1))$ bits in expectation, and supports
traversal and update operations in $ O(1 / \beta)$
expected time and $ O(1 / \beta^2)$ amortized expected
time, for any user-specified parameter $ \beta > 0$
(again based on assumptions about the behaviour of hash
functions). We give an implementation of m-Bonsai which
uses considerably less memory and is slightly faster
than the original Bonsai.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Belazzougui:2018:BVO,
author = "Djamal Belazzougui and Travis Gagie and Veli
M{\"a}kinen and Marco Previtali and Simon J. Puglisi",
title = "Bidirectional Variable-Order {de Bruijn} Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "8",
pages = "1279--1295",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118430037",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 27 05:21:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "Compressed suffix trees and bidirectional FM-indexes
can store a set of strings and support queries that let
us explore the set of substrings they contain, adding
and deleting characters on both the left and right, but
they can use much more space than a de Bruijn graph for
the strings. Bowe et al.'s BWT-based de Bruijn graph
representation (Proc. Workshop on Algorithms for
Bioinformatics, pp. 225--235, 2012) can be made
bidirectional as well, at the cost of increasing its
space usage by a small constant, but it fixes the
length of the substrings. Boucher et al. (Proc. Data
Compression Conference, pp. 383--392, 2015) generalized
Bowe et al.'s representation to support queries about
variable-length substrings, but at the cost of
bidirectionality. In this paper we show how to make
Boucher et al.'s variable-order implementation of de
Bruijn graphs bidirectional.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Teixeira:2018:SEM,
author = "Andreia Sofia Teixeira and Francisco Fernandes and
Alexandre P. Francisco",
title = "{SpliceTAPyR} --- An Efficient Method for
Transcriptome Alignment",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "8",
pages = "1297--1310",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118430049",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 27 05:21:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "RNA-Seq is a Next-Generation Sequencing (NGS) protocol
for sequencing the messenger RNA in a cell and
generates millions of short sequence fragments, reads,
in a single run. These reads can be used to measure
levels of gene expression and to identify novel splice
variants of genes. One of the critical steps in an
RNA-Seq experiment is mapping NGS reads to the
reference genome. Because RNA-Seq reads can span over
more than one exon in the genome, this task is
challenging. In the last decade, tools for RNA-Seq
alignment have emerged, but most of them run in two
phases. First, the pipeline only maps reads that have a
direct match in the reference, and the remaining are
set aside as initially unmapped reads. Then, they use
heuristics based approaches, clustering or even
annotations, to decide where to align the later. This
work presents an efficient computational solution for
the problem of transcriptome alignment, named
SpliceTAPyR. It identifies signals of splice junctions
and relies on compressed full-text indexing methods and
succinct data structures to efficiently align RNA-Seq
reads in a single phase. This way it achieves the same
or better accuracy than other tools while using
considerably less memory and time to the most
competitive tools.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Adamczyk:2018:PDG,
author = "Micha{\l}l Adamczyk and Mai Alzamel and Panagiotis
Charalampopoulos and Jakub Radoszewski",
title = "Palindromic Decompositions with Gaps and Errors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "8",
pages = "1311--1329",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118430050",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 27 05:21:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "Identifying palindromes in sequences has been an
interesting line of research in combinatorics on words
and also in computational biology, after the discovery
of the relation of palindromes in the DNA sequence with
the HIV virus. Efficient algorithms for the
factorization of sequences into palindromes and maximal
palindromes have been devised in recent years. We
extend these studies by allowing gaps in decompositions
and errors in palindromes, and also imposing a lower
bound to the length of acceptable palindromes. We first
present an on-line algorithm for obtaining a
palindromic decomposition of a string of length $n$
with the minimal total gap length in time $ {\cal O}(n
\log n \cdot g)$ and space $ {\cal O}(n \cdot g)$,
where $g$ is the number of allowed gaps in the
decomposition. We then consider a decomposition of the
string in maximal $ \delta $-palindromes (i.e.
palindromes with $ \delta $ errors under the edit or
Hamming distance) and $g$ allowed gaps. We present an
algorithm to obtain such a decomposition with the
minimal total gap length in time $ {\cal O}(n \cdot (g
+ \delta))$ and space $ {\cal O}(n \cdot g)$. Finally,
we provide an implementation of our algorithms.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Barton:2018:FAC,
author = "Carl Barton and Chang Liu and Solon P. Pissis",
title = "Fast Average-Case Pattern Matching on Weighted
Sequences",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "8",
pages = "1331--1343",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118430062",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 27 05:21:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
abstract = "A weighted string is a string in which a set of
letters may occur at each position with respective
occurrence probabilities. Weighted strings, also known
as position weight matrices, weighted sequences or
uncertain sequences, naturally arise in many contexts.
In this paper, we study the problem of weighted string
matching with a special focus on average-case analysis.
Given a weighted pattern string $x$ of length $m$, a
text string $y$ of length $ n > m$, both on a
constant-sized alphabet of size $ \sigma $, and a
cumulative weight threshold $ 1 / z$, defined as the
minimal probability of occurrence of factors in a
weighted string, we present an on-line algorithm
requiring average-case search time $ o(n)$ for pattern
matching for weight ratio $ z / m < \min \{ 1 / (2 \log
z + 1 / z), \log \sigma / (\log z (\log m + \log \log
\sigma)) \} $. For a pattern string $x$ of length $m$,
a weighted text string $y$ of length $ n > m$, both on
a constant-sized alphabet, and a cumulative weight
threshold $ 1 / z$, we present an on-line algorithm
requiring average-case search time $ o(n)$ for the same
weight ratio. The importance of these algorithms lies
on the fact that, for these ratios, they can work in
sublinear search time in the size of the input text,
and in linear preprocessing costs in the size of the
pattern.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Abdollahyan:2018:IPR,
author = "Maryam Abdollahyan and Greg Elgar and Fabrizio
Smeraldi",
title = "Identifying Potential Regulatory Elements by
Transcription Factor Binding Site Alignment Using
Partial Order Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "8",
pages = "1345--1354",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118430074",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 27 05:21:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "Identification and functional characterization of
regulatory elements in the human genome is a
challenging task. A sequence feature commonly used to
predict regulatory activity is the co-occurrence of
transcription factor binding sites (TFBSs) in
regulatory regions. In this work, we present a
graph-based approach to detect frequently co-occurring
TFBSs in evolutionarily conserved non-coding elements
(CNEs). We introduce a graph representation of the
sequence of TFBSs identified in a CNE that allows us to
handle overlapping binding sites. We use a dynamic
programming algorithm to align such graphs and
determine the relative enrichment of short sequences of
TFBSs in the alignments. We evaluate our approach on a
set of functionally validated CNEs. Our findings
include a regulatory signature composed of co-occurring
Pbx-Hox and Meis binding motifs associated with
hindbrain enhancer activity.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alnasir:2018:TQN,
author = "Jamie J. Alnasir and Hugh P. Shanahan",
title = "Transcriptomics: Quantifying Non-Uniform Read
Distribution Using {MapReduce}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "8",
pages = "1355--1372",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118430086",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 27 05:21:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "RNA-seq is a high-throughput Next-sequencing technique
for estimating the concentration of all transcripts in
a transcriptome. The method involves complex
preparatory and post-processing steps which can
introduce bias, and the technique produces a large
amount of data [7, 19]. Two important challenges in
processing RNA-seq data are therefore the ability to
process a vast amount of data, and methods to quantify
the bias in public RNA-seq datasets. We describe a
novel analysis method, based on analysing sequence
motif correlations, that employs MapReduce on Apache
Spark to quantify bias in Next-generation sequencing
(NGS) data at the deep exon level. Our implementation
is designed specifically for processing large datasets
and allows for scalability and deployment on cloud
service providers offering MapReduce. In investigating
the wild and mutant organism types in the species D.
melanogaster we have found that motifs with runs of Gs
(or their complement) exhibit low motif-pair
correlations in comparison with other motif-pairs. This
is independent of the mean exon GC content in the wild
type data, but there is a mild dependence in the mutant
data. Hence, whilst both datasets show the same trends,
there is however significant variation between the two
samples.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2018:AIV,
author = "Anonymous",
title = "Author Index Volume 29 (2018)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "8",
pages = "1373--1379",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118990010",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 27 05:21:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Charlier:2019:P,
author = "{\'E}milie Charlier and Julien Leroy and Michel Rigo",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "1",
pages = "1--4",
month = jan,
year = "2019",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054119020015",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 6 10:05:49 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119020015",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Beier:2019:OSC,
author = "Simon Beier and Markus Holzer and Martin Kutrib",
title = "Operational State Complexity and Decidability of
Jumping Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "1",
pages = "5--27",
month = jan,
year = "2019",
DOI = "https://doi.org/10.1142/S012905411940001X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 6 10:05:49 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905411940001X",
abstract = "We consider jumping finite automata and their
operational state complexity and decidability status.
Roughly speaking, a jumping automaton is a finite
automaton with a non-continuous input. This device has
nice relations to semilinear sets and thus to Parikh
images of regular sets, which will be exhaustively used
in our proofs. In particular, we prove upper bounds on
the intersection and complementation. The latter result
on the complementation upper bound answers an open
problem from [G. J. Lavado, G. Pighizzini, S. Seki:
Operational State Complexity of Parikh Equivalence,
2014]. Moreover, we correct an erroneous result on the
inverse homomorphism closure. Finally, we also consider
the decidability status of standard problems as
regularity, disjointness, universality, inclusion, etc.
for jumping finite automata.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{deBondt:2019:LBS,
author = "Michiel de Bondt and Henk Don and Hans Zantema",
title = "Lower Bounds for Synchronizing Word Lengths in Partial
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "1",
pages = "29--60",
month = jan,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400021",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 6 10:05:49 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400021",
abstract = "It was conjectured by {\v{C}}ern{\'y} in 1964, that a
synchronizing DFA on n states always has a
synchronizing word of length at most (n - 1)2 (n - 1)2
(n - 1)2, and he gave a sequence of DFAs for which this
bound is reached. Until now a full analysis of all DFAs
reaching this bound was only given for n \leq 5 n \leq
5 n \leq 5, and with bounds on the number of symbols
for n \leq 12 n \leq 12 n \leq 12. Here we give the
full analysis for n \leq 7 n \leq 7 n \leq 7, without
bounds on the number of symbols. For PFAs (partial
automata) on \leq 7 \leq 7 \leq 7 states we do a
similar analysis as for DFAs and find the maximal
shortest synchronizing word lengths, exceeding (n - 1)2
(n - 1)2 (n - 1)2 for n \geq 4 n \geq 4 n \geq 4. Where
DFAs with long synchronization typically have very few
symbols, for PFAs we observe that more symbols may
increase the synchronizing word length. For PFAs on
\leq 10 \leq 10 \leq 10 states and two symbols we
investigate all occurring synchronizing word lengths.
We give series of PFAs on two and three symbols,
reaching the maximal possible length for some small
values of n. For n = 6, 7, 8, 9 the construction on two
symbols is the unique one reaching the maximal length.
For both series the growth is faster than (n - 1)2 (n -
1)2 (n - 1)2, although still quadratic. Based on string
rewriting, for arbitrary size we construct a PFA on
three symbols with exponential shortest synchronizing
word length, giving significantly better bounds than
earlier exponential constructions. We give a
transformation of this PFA to a PFA on two symbols
keeping exponential shortest synchronizing word length,
yielding a better bound than applying a similar known
transformation. Both PFAs are transitive. Finally, we
show that exponential lengths are even possible with
just one single undefined transition, again with
transitive constructions.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gao:2019:GAC,
author = "Alice L. L. Gao and Sergey Kitaev and Wolfgang Steiner
and Philip B. Zhang",
title = "On a Greedy Algorithm to Construct Universal Cycles
for Permutations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "1",
pages = "61--72",
month = jan,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400033",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 6 10:05:49 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400033",
abstract = "A universal cycle for permutations of length n is a
cyclic word or permutation, any factor of which is
order-isomorphic to exactly one permutation of length
n, and containing all permutations of length n as
factors. It is well known that universal cycles for
permutations of length n exist. However, all known ways
to construct such cycles are rather complicated. For
example, in the original paper establishing the
existence of the universal cycles, constructing such a
cycle involves finding an Eulerian cycle in a certain
graph and then dealing with partially ordered sets. In
this paper, we offer a simple way to generate a
universal cycle for permutations of length n, which is
based on applying a greedy algorithm to a permutation
of length n - 1. We prove that this approach gives a
unique universal cycle $ \Pi_n $ for permutations, and
we study properties of $ \Pi_n $.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gazdag:2019:PLP,
author = "Zsolt Gazdag and Kriszti{\'a}n Tichler and
Erzs{\'e}bet Csuhaj-Varj{\'u}",
title = "A Pumping Lemma for Permitting Semi-Conditional
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "1",
pages = "73--92",
month = jan,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400045",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 6 10:05:49 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400045",
abstract = "Permitting semi-conditional grammars (pSCGs) are
extensions of context-free grammars where each rule is
associated with a word w and such a rule can be applied
to a sentential form u only if w is a subword of u. We
consider permitting generalized SCGs (pgSCGs) where
each rule is associated with a set of words P and is
applicable only if every word in P occurs in u. We
investigate the generative power of pgSCGs with no
erasing rules and prove a pumping lemma for their
languages. Using this lemma we show that pgSCGs are
strictly weaker than context-sensitive grammars. This
solves a long-lasting open problem concerning the
generative power of pSCGs. Moreover, we give a
comparison of the generating power of pgSCGs and that
of forbidding random context grammars with no erasing
rules.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gonze:2019:IBC,
author = "Fran{\c{c}}ois Gonze and Vladimir V. Gusev and
Rapha{\"e}l M. Jungers and Bal{\'a}zs Gerencs{\'e}r and
Mikhail V. Volkov",
title = "On the Interplay Between {{\v{C}}ern{\'y}} and
{Babai}'s Conjectures",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "1",
pages = "93--114",
month = jan,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400057",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 6 10:05:49 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400057",
abstract = "Motivated by the Babai conjecture and the
{\v{C}}ern{\'y} conjecture, we study the reset
thresholds of automata with the transition monoid equal
to the full monoid of transformations of the state set.
For automata with n states in this class, we prove that
the reset threshold is upper-bounded by 2n2 - 6n+5 2n2
- 6n+5 2n2 - 6n + 5 and can attain the value n(n - 1)2
n(n - 1)2 n(n - 1) 2. In addition, we study diameters
of the pair digraphs of permutation automata and
construct n -state permutation automata with diameter
n24+o(n2) n24+o(n2) n2 4 + o(n2).",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hospodar:2019:DCF,
author = "Michal Hospod{\'a}r and Galina Jir{\'a}skov{\'a} and
Peter Mlyn{\'a}r{\v{c}}ik",
title = "Descriptional Complexity of the Forever Operator",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "1",
pages = "115--134",
month = jan,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400069",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 6 10:05:49 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400069",
abstract = "We examine the descriptional complexity of the forever
operator, which assigns the language $ \bar {\Sigma^*
\bar {L}} $ to a regular language L, and we investigate
the trade-offs between various models of finite
automata. We consider complete and partial
deterministic finite automata, nondeterministic finite
automata with single or multiple initial states,
alternating, and Boolean finite automata. We assume
that the argument and the result of this operation are
accepted by automata belonging to one of these six
models. We investigate all possible trade-offs and
provide a tight upper bound for 32 of 36 of them. The
most interesting result is the trade-off from
nondeterministic to deterministic automata given by the
Dedekind number M(n - 1). We also prove that the
nondeterministic state complexity of $ \bar {\Sigma^*
\bar {L}} $ is $ 2^{n - 1} $ which solves an open
problem stated by Birget [The state complexity of $
\bar {\Sigma^* \bar {L}} $ and its connection with
temporal logic, Inform. Process. Lett. {\bf 58} (1996)
185--188].",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kunc:2019:GRT,
author = "Michal Kunc and Jan Meitner",
title = "The Generalized Rank of Trace Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "1",
pages = "135--169",
month = jan,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400070",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 6 10:05:49 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400070",
abstract = "Given a partially commutative alphabet and a set of
words L, the rank of L expresses the amount of
shuffling required to produce a word belonging to L
from two words whose concatenation belongs to the
closure of L with respect to the partial commutation.
In this paper, the notion of rank is generalized from
concatenations of two words to an arbitrary fixed
number of words. In this way, an infinite sequence of
non-negative integers and infinity is assigned to every
set of words. It is proved that in the case of
alphabets defining free commutative monoids, as well as
in the more general case of direct products of free
monoids, sequences of ranks of regular sets are exactly
non-decreasing sequences that are eventually constant.
On the other hand, by uncovering a relationship between
rank sequences of regular sets and rational series over
the min-plus semiring, it is shown that already for
alphabets defining free products of free commutative
monoids, rank sequences need not be eventually
periodic.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Richomme:2019:CIL,
author = "Gwena{\"e}l Richomme",
title = "Characterization of Infinite {LSP} Words and
Endomorphisms Preserving the {LSP} Property",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "1",
pages = "171--196",
month = jan,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400082",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 6 10:05:49 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400082",
abstract = "Answering a question of G. Fici, we give an S-adic
characterization of the family of infinite LSP words,
that is, the family of infinite words having all their
left special factors as prefixes. More precisely we
provide a finite set of morphisms S and an automaton A
such that an infinite word is LSP if and only if it is
S-adic and one of its directive words is recognizable
by A. Then we characterize the endomorphisms that
preserve the property of being LSP for infinite words.
This allows us to prove that there exists no set S' of
endomorphisms for which the set of infinite LSP words
corresponds to the set of S'-adic words. This implies
that an automaton is required no matter which set of
morphisms is used.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chimani:2019:ATC,
author = "Markus Chimani and Giuseppe {Di Battista} and Fabrizio
Frati and Karsten Klein",
title = "Advances on Testing $c$-Planarity of Embedded Flat
Clustered Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "2",
pages = "197--230",
month = feb,
year = "2019",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054119500011",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 13 07:03:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "In this paper, we show a polynomial-time algorithm for
testing $c$-planarity of embedded flat clustered graphs
with at most two vertices per cluster on each face. Our
result is based on a reduction to the planar set of
spanning trees in topological multigraphs (pssttm)
problem, which is defined as follows. Given a
(non-planar) topological multigraph $A$ with $k$
connected components $ A_1, \ldots {}, A_k$, do
spanning trees of $ A_1, \ldots {}, A_k$ exist such
that no two edges in any two spanning trees cross?
Kratochv{\'\i}l et al. [SIAM Journal on Discrete
Mathematics, {\bf 4}(2): 223--244, 1991] proved that
the problem is NP-hard even if $ k = 1$; on the other
hand, Di Battista and Frati presented a linear-time
algorithm to solve the pssttm problem for the case in
which $A$ is a 1-planar topological multigraph [Journal
of Graph Algorithms and Applications, 13(3): 349--378,
2009]. For any embedded flat clustered graph $C$, an
instance $A$ of the pssttm problem can be constructed
in polynomial time such that $C$ is $c$-planar if and
only if $A$ admits a solution. We show that, if $C$ has
at most two vertices per cluster on each face, then it
can be tested in polynomial time whether the
corresponding instance $A$ of the pssttm problem is
positive or negative. Our strategy for solving the
pssttm problem on $A$ is to repeatedly perform a
sequence of tests, which might let us conclude that $A$
is a negative instance, and simplifications, which
might let us simplify $A$ by removing or contracting
some edges. Most of these tests and simplifications are
performed ``locally'', by looking at the crossings
involving a single edge or face of a connected
component $ A_i$ of $A$; however, some tests and
simplifications have to consider certain global
structures in $A$, which we call $ \alpha $-donuts. If
no test concludes that $A$ is a negative instance of
the pssttm problem, then the simplifications eventually
transform $A$ into an equivalent 1-planar topological
multigraph on which we can apply the cited linear-time
algorithm by Di Battista and Frati.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Klein:2019:FFP,
author = "Rolf Klein and Elmar Langetepe and Barbara Schwarzwald
and Christos Levcopoulos and Andrzej Lingas",
title = "On a Fire Fighter's Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "2",
pages = "231--246",
month = feb,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500023",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 13 07:03:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "Suppose that a circular fire spreads in the plane at
unit speed. A single fire fighter can build a barrier
at speed $ v > 1 $. How large must $v$ be to ensure
that the fire can be contained, and how should the fire
fighter proceed? We contribute two results. First, we
analyze the natural curve FFv that develops when the
fighter keeps building, at speed $v$, a barrier along
the boundary of the expanding fire. We prove that the
behavior of this spiralling curve is governed by a
complex function $ (e^{wZ} - s Z)^{-1}$, where $w$ and
$s$ are real functions of $v$. For $ v > v_c = 2.6144
\ldots {}$ all zeroes are complex conjugate pairs. If $
\phi $ denotes the complex argument of the conjugate
pair nearest to the origin then, by residue calculus,
the fire fighter needs $ \Theta (1 / \phi)$ rounds
before the fire is contained. As $v$ decreases towards
$ v_c$ these two zeroes merge into a real one, so that
argument \phi goes to 0. Thus, curve FFv does not
contain the fire if the fighter moves at speed $ v =
v_c$ (That speed $ v > v_c$ is sufficient for
containing the fire has been proposed before by Bressan
et al. [6], who constructed a sequence of logarithmic
spiral segments that stay strictly away from the fire.)
Second, we show that for any curve that visits the four
coordinate half-axes in cyclic order, and in increasing
distances from the origin the fire can not be contained
if the speed $v$ is less than 1.618\ldots{}, the golden
ratio.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhou:2019:LBS,
author = "Guangyan Zhou and Rui Kang",
title = "On the Lower Bounds of $ (1, 0)$-Super Solutions for
Random {$k$-SAT}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "2",
pages = "247--254",
month = feb,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500035",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 13 07:03:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "Super solution is a notion introduced to produce
robust and stable solutions of combinatorial
optimization and decision problems. We consider the $
(1, 0)$-super solutions of random instances of $k$-SAT,
where a clause is satisfied if and only if there are at
least two satisfied literals in this clause. By using
an enhanced weighting scheme, we obtain better lower
bounds that, if a random $k$-CNF formula $ F_k(n, r_n)$
is $ (1, 0)$-unsatisfiable with probability tending to
1 as $ n \to \infty $, then $ r_k \geq 1.88, 4.31,
8.83, 17.11, 32.5$ for $ k = 5, 6, 7, 8, 9$,
respectively.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hwang:2019:ELS,
author = "Min-Shiang Hwang and Cheng-Chi Lee and Shih-Ting Hsu",
title = "An {ElGamal}-like Secure Channel Free Public Key
Encryption with Keyword Search Scheme",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "2",
pages = "255--273",
month = feb,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500047",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 13 07:03:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "The idea of public key encryption with keyword search
(PEKS), proposed by Boneh et al., enables one to send a
trapdoor containing a encrypted keyword to query data
without revealing the keyword. In Boneh et al.'s
design, the trapdoor has to be transferred through a
secure channel, which is both costly and inefficient.
Baek et al. then proposed an efficient secure channel
free public key encryption scheme with keyword search
(SCF-PEKS). After that, vast amounts of research have
focused on the protection against the off-line keyword
guessing attack (OKGA) by enhancing the model. However,
most of the PEKS/SCF-PEKS schemes developed so far are
constructed by applying bilinear pairing and are
susceptible to off-line keyword guessing attacks. In
this paper, we propose a new SCF-PEKS scheme based on
the ElGamal cryptosystem. The proposed scheme is not
only secure against off-line keyword guessing attacks
but also improves the efficiency.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Liu:2019:TCP,
author = "Xianping Liu and Yuan Chen and Yunge Xu and Zhimin
Sun",
title = "Triple-Cycle Permutations Over Finite Fields of
Characteristic Two",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "2",
pages = "272--292",
month = feb,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500059",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 13 07:03:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "Triple-cycle permutations over finite fields of
characteristic two are studied, and some classes of
triple-cycle permutations are proposed in this paper.
In addition, new triple-cycle permutations can be
constructed by switching construction from known
ones.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Grosse:2019:FAD,
author = "Ulrike Gro{\ss}e and Christian Knauer and Fabian Stehn
and Joachim Gudmundsson and Michiel Smid",
title = "Fast Algorithms for Diameter-Optimally Augmenting
Paths and Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "2",
pages = "293--313",
month = feb,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500060",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 13 07:03:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "We consider the problem of augmenting an $n$-vertex
graph embedded in a metric space, by inserting one
additional edge in order to minimize the diameter of
the resulting graph. We present exact algorithms for
the cases when (i) the input graph is a path, running
in $ O(n \log^3 n)$ time, and (ii) the input graph is a
tree, running in $ O(n^2 \log n)$ time. We also present
an algorithm for paths that computes a $ (1 +
\epsilon)$-approximation in $ O(n + 1 / \epsilon^3)$
time.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dieudonne:2019:ECA,
author = "Yoann Dieudonn{\'e} and Shlomi Dolev and Franck Petit
and Michael Segal",
title = "Explicit Communication Among Stigmergic Robots",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "2",
pages = "315--332",
month = feb,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500072",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 13 07:03:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "In this paper, we investigate avenues for the exchange
of information (explicit communication) among deaf and
mute mobile robots scattered in the plane. We introduce
the use of movement-signals (analogously to flight
signals and bees waggle) as a mean to transfer
messages, enabling the use of distributed algorithms
among robots. We propose one-to-one deterministic
movement protocols that implement explicit
communication among semi-synchronous robots. We first
show how the movements of robots can provide implicit
acknowledgment in semi-synchronous systems. We use this
result to design one-to-one communication among a pair
of robots. Then, we propose two one-to-one
communication protocols for any system of $ n \geq 2 $
robots. The former works for robots equipped with
observable IDs that agree on a common direction (sense
of direction). The latter enables one-to-one
communication assuming robots devoid of any observable
IDs or sense of direction. All protocols (for either
two or any number of robots) assume that no robot
remains inactive forever. However, they cannot avoid
that the robots move either away or closer to each
others, by the way requiring robots with an infinite
visibility. In this paper, we also present how to
overcome these two disadvantages (some activity of
every robot and infinite visibility). Our protocols
enable the use of distributing algorithms based on
message exchanges among swarms of stigmergic robots.
They also allow robots to be equipped with the means of
communication to tolerate faults in their communication
devices.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Couceiro:2019:CVS,
author = "Miguel Couceiro and Mikl{\'o}s Mar{\'o}ti and
Tam{\'a}s Waldhauser and L{\'a}szl{\'o} Z{\'a}dori",
title = "Computing Version Spaces in the Qualitative Approach
to Multicriteria Decision Aid",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "2",
pages = "333--353",
month = feb,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500084",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Mar 13 07:03:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "We consider a lattice-based model in multiattribute
decision making, where preferences are represented by
global utility functions that evaluate alternatives in
a lattice structure (which can account for situations
of indifference as well as of incomparability).
Essentially, this evaluation is obtained by first
encoding each of the attributes (nominal, qualitative,
numeric, etc.) of each alternative into a distributive
lattice, and then aggregating such values by lattice
functions. We formulate version spaces within this
model (global preferences consistent with empirical
data) as solutions of an interpolation problem and
present their complete descriptions accordingly.
Moreover, we consider the computational complexity of
this interpolation problem, and show that up to 3
attributes it is solvable in polynomial time, whereas
it is NP complete over more than 3 attributes. Our
results are then illustrated with a concrete example.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Fernandes:2019:PAS,
author = "Cristina G. Fernandes and Carlos E. Ferreira and
Fl{\'a}vio K. Miyazawa and Yoshiko Wakabayashi",
title = "Prices of Anarchy of Selfish {$2$D} Bin Packing
Games",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "3",
pages = "355--374",
year = "2019",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054119500096",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 1 06:18:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "We consider a game-theoretical problem called selfish
2-dimensional bin packing game, a generalization of the
1-dimensional case already treated in the literature.
In this game, the items to be packed are rectangles,
and the bins are unit squares. The game starts with a
set of items arbitrarily packed in bins. The cost of an
item is defined as the ratio between its area and the
total occupied area of the respective bin. Each item is
a selfish player that wants to minimize its cost. A
migration of an item to another bin is allowed only
when its cost is decreased. We show that this game
always converges to a Nash equilibrium (a stable
packing where no single item can decrease its cost by
migrating to another bin). We show that the pure price
of anarchy of this game is unbounded, so we address the
particular case where all items are squares. We show
that the pure price of anarchy of the selfish square
packing game is at least 2.3634 and at most 2.6875 . We
also present analogous results for the strong Nash
equilibrium (a stable packing where no nonempty set of
items can simultaneously migrate to another common bin
and decrease the cost of each item in the set). We show
that the strong price of anarchy when all items are
squares is at least 2.0747 and at most 2.3605 .",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Boyar:2019:TBR,
author = "Joan Boyar and Faith Ellen",
title = "Tight Bounds for Restricted Grid Scheduling",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "3",
pages = "375--405",
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500102",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 1 06:18:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "The following problem is considered: Items with
integer sizes are given and variable sized bins arrive
online. A bin must be used if there is still an item
remaining which fits in it when the bin arrives. The
goal is to minimize the total size of all the bins
used. Previously, a lower bound of $ 5 / 4 $ on the
competitive ratio of this problem was achieved using
items of size $S$ and $ 2 S - 1$. For these item sizes
and maximum bin size $ M = 4 S - 3$, we obtain
asymptotically matching upper and lower bounds, which
vary depending on the ratio of the number of small
items to the number of large items.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Huang:2019:DCS,
author = "Daitao Huang and Minjia Shi and Patrick Sol{\'e}",
title = "Double Circulant Self-Dual and {LCD} Codes Over {$
\mathbb {Z}_{p^2} $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "3",
pages = "407--416",
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500114",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 1 06:18:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "We study double circulant LCD codes over {$ \mathbb
{Z}_{p^2} $} for all odd primes p, and self-dual double
circulant codes over {$ \mathbb {Z}_{p^2} $} for primes
$ p \equiv 1 \pmod 4 $. We derive exact enumeration
formulae, and asymptotic lower bounds on the minimum
distance of the $p$-ary images of these codes by the
classical Gray maps.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yigit:2019:NLR,
author = "Esin Yi{\u{g}}it and Zeynep Nihan Berberler",
title = "A Note on the Link Residual Closeness of Graphs Under
Join Operation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "3",
pages = "417--424",
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500126",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 1 06:18:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "Link residual closeness is a novel graph based network
vulnerability parameter. In this model, nodes are
perfectly reliable and the links fail independently of
each other. In this paper, the behavior of composite
network types to the failure of individual links are
observed and analyzed via link residual closeness which
provides a much fuller characterization of the
network.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gorain:2019:AAB,
author = "Barun Gorain and Partha Sarathi Mandal",
title = "Approximation Algorithms for Barrier Sweep Coverage",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "3",
pages = "425--448",
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500138",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 1 06:18:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "Time-varying coverage, namely sweep coverage is a
recent development in the area of wireless sensor
networks, where a few mobile sensors sweep or monitor a
comparatively large number of locations periodically.
In this article, we study barrier sweep coverage with
mobile sensors where the barrier is considered as a
finite length continuous curve on a plane. The coverage
at every point on the curve is time-variant. We propose
an optimal solution for sweep coverage of a finite
length continuous curve. Usually, energy source of a
mobile sensor is a battery with limited power, so
energy restricted sweep coverage is a challenging
problem for long running applications. We propose an
energy-restricted sweep coverage problem where every
mobile sensor must visit an energy source frequently to
recharge or replace its battery. We propose a 13 3
-approximation algorithm for this problem. The proposed
algorithm for multiple curves achieves the best
possible approximation factor 2 for a special case. We
propose a 5-approximation algorithm for the general
problem. As an application of the barrier sweep
coverage problem for a set of line segments, we
formulate a data gathering problem. In this problem a
set of mobile sensors is arbitrarily monitoring the
line segments one for each. A set of data mules
periodically collects the monitoring data from the set
of mobile sensors. We prove that finding the minimum
number of data mules to collect data periodically from
every mobile sensor is NP-hard and propose a
3-approximation algorithm to solve it.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Finkel:2019:ITL,
author = "Olivier Finkel",
title = "Incompleteness Theorems, Large Cardinals, and Automata
Over Finite Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "3",
pages = "449--467",
year = "2019",
DOI = "https://doi.org/10.1142/S012905411950014X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 1 06:18:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "We prove that one can construct various kinds of
automata over finite words for which some elementary
properties are actually independent from strong set
theories like $ T_n = : {\bf ZFC} + $ ``There exist (at
least) $n$ inaccessible cardinals'', for integers $ n
\geq 0$. In particular, we prove independence results
for languages of finite words generated by context-free
grammars, or accepted by 2-tape or 1-counter automata.
Moreover we get some independence results for weighted
automata and for some related finitely generated
subsemigroups of the set {$ \mathbb {Z}^{3 \times 3}$}
of $3$--$3$ matrices with integer entries. Some of
these latter results are independence results from the
Peano axiomatic system {\bf PA}.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2019:NPF,
author = "Xiaofang Xu and Chunlei Li and Xiangyong Zeng",
title = "Nonsingular Polynomials from Feedback Shift
Registers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "3",
pages = "469--487",
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500151",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed May 1 06:18:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "In this paper, we present nonsingular permutation
polynomials from nonsingular feedback shift registers
and examine nonlinearity and algebraic degree of
nonsingular polynomials of certain forms. The upper
bound on the nonlinearity of nonsingular Boolean
functions is investigated. We also present $n$-variable
nonsingular Boolean functions with algebraic degree $ n
1$ and highest possible nonlinearity for odd $n$.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yu:2019:PSI,
author = "Yong Yu and Guomin Yang and Huaxiong Wang",
title = "Preface: Special Issue Cryptography and Provable
Security",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "489--492",
month = jun,
year = "2019",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054119020027",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119020027",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Tseng:2019:AMR,
author = "Yi-Fan Tseng and Chun-I Fan and Cheng-Wei Sung",
title = "On the Anonymity of Multi-Receiver Identity-Based
Encryption Based on {Fujisaki--Okamoto}
Transformation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "493--509",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400094",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400094",
abstract = "In 2010, Fan et al. first introduced the concept of
anonymous multi-receiver identity-based encryption
(AMRIBE). They used the concept of Fujisaki Okamoto
transformation (F.O. transformation) to support their
proof in random oracle models. Recently, many works on
this topic have been proposed. Most of them adopted
Fujisaki Okamoto transformation to achieve the
indistinguishability of encryptions under multi-ID,
chosen-ciphertext attacks (IND-MID-CCA) security.
However, we find out that these schemes do not gain
anonymity against insider attacks. In this manuscript,
we use a sequence of games to prove that any AMRIBE
scheme will fail to gain anonymity under
chosen-ciphertext attacks and chosen-plaintext attacks
if the IND-MID-CCA security is proven using Fujisaki
Okamoto transformation.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Rezaeibagha:2019:PSB,
author = "Fatemeh Rezaeibagha and Yi Mu and Shiwei Zhang and
Xiaofen Wang",
title = "Provably Secure (Broadcast) Homomorphic Signcryption",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "511--529",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400100",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400100",
abstract = "Signcryption has drawn a lot of attention due to its
useful applications in many areas, in particular for
applications where the computation and communication
resources are constrained, for example, for lightweight
devices. The traditional signcryption scheme does not
support the homomorphic property. Recent work by
Rezaeibagha et al. (Provsec 2017) offered a provably
secure homomorphic signcryption scheme, in which for
the first time, provided a scheme provably secure under
some restriction. In this paper, we show that the
homomorphic signcryption can be extended to provably
secure broadcast signcryption scheme. We allow the
broadcasted signcrypted data items to be aggregated
without requiring decryption that is a desirable
feature in distributed environments.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Yao:2019:ACC,
author = "Zhongyuan Yao and Yi Mu",
title = "{ACE} with Compact Ciphertext Size and Decentralized
Sanitizers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "531--549",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400112",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400112",
abstract = "We present an access control encryption (ACE) scheme
which enjoys advantages over previous works in several
aspects. Our scheme ensures not only compact ciphertext
size but also small size of keys installed in each user
in the ACE system. Besides, to the best of our
knowledge, our scheme is the first implementation of
ACE with decentralized sanitizers. Comparing to ACE
constructions with only one sanitizer, our scheme is
more secure and reliable since it does not suffer from
the single point failure. Considering the security of
our scheme, we present two models catering to the
no-read rule and no-write rule security requirements
respectively. Additionally, our extended no-write rule
model allows the corruption of some sanitizers in the
ACE system and thus is stronger than the one for
schemes with only one sanitizer. We prove the security
of our scheme under the two models.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Meng:2019:SDD,
author = "Wenjuan Meng and Jianhua Ge and Tao Jiang",
title = "Secure Data Deduplication with Reliable Data Deletion
in Cloud",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "551--570",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400124",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400124",
abstract = "A cloud storage system which incorporates the deletion
and deduplication functionalities will have both
security and efficiency advantages over exiting
solutions which provide only one of them. However, the
security models of secure data deletion and data
deduplication functionalities are not compatible with
each other, which will cause security and efficiency
vulnerability under coercive adversaries. To solve
these security and efficiency challenges, we define and
construct a scheme, whose security relies on the proper
erasure of keys in the wrapped key tree and periodical
update of the deduplication encryption keys. Moreover,
we enhance the efficiency of the proposed scheme by
introducing incremental data update, where only the
changed part is encrypted/decrypted and
uploaded/downloaded in data updating. Further security
analysis shows that the proposed scheme is secure
against coercive attack. Finally, the practical
implementation shows that our scheme is performance
efficient in computation, storage and communication for
both the cloud storage server and users.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Xu:2019:PPS,
author = "Zifeng Xu and Fucai Zhou and Yuxi Li and Jian Xu and
Qiang Wang",
title = "Privacy-Preserving Subgraph Matching Protocol for Two
Parties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "571--588",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400136",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400136",
abstract = "Graph data structure has been widely used across many
application areas, such as web data, social network,
and cheminformatics. The main benefit of storing data
as graphs is there exists a rich set of graph
algorithms and operations that can be used to solve
various computing problems, including pattern matching,
data mining, and image processing. Among these graph
algorithms, the subgraph isomorphism problem is one of
the most fundamental algorithms that can be utilized by
many higher level applications. The subgraph
isomorphism problem is defined as, given two graphs G
and H, whether G contains a subgraph that is
isomorphic to H . In this paper, we consider a special
case of the subgraph isomorphism problem called the
subgraph matching problem, which tests whether G is a
subgraph of H . We propose a protocol that solve the
subgraph matching problem in a privacy-preserving
manner. The protocol allows two parties to jointly
compute whether one graph is a subgraph of the other,
while protecting the private information about the
input graphs. The protocol is secure under the
semi-honest setting, where each party performs the
protocol faithfully.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Lai:2019:NIB,
author = "Qiqi Lai and Bo Yang and Zhe Xia and Yannan Li and
Yuan Chen and Zhenlong Li",
title = "Novel Identity-Based Hash Proof System with Compact
Master Public Key from Lattices in the Standard Model",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "589--606",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400148",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400148",
abstract = "As the progress of quantum computers, it is desired to
propose many more efficient cryptographic constructions
with post-quantum security. In the literatures, almost
all cryptographic schemes and protocols can be
explained and constructed modularly from certain
cryptographic primitives, among which an Identity-Based
Hash Proof System (IB-HPS) is one of the most basic and
important primitives. Therefore, we can utilize IB-HPSs
with post-quantum security to present several types of
post-quantum secure schemes and protocols. Up until
now, all known IB-HPSs with post-quantum security are
instantiated based on latticed-based assumptions.
However, all these lattice-based IB-HPSs are either in
the random oracle model or not efficient enough in the
standard model. Hence, it should be of great
significance to construct more efficient IB-HPSs from
lattices in the standard model. In this paper, we
propose a new smooth IB-HPS with anonymity based on the
Learning with Errors (LWE) assumption in the standard
model. This new construction is mainly inspired by a
classical identity-based encryption scheme based on LWE
due to Agreawal et al. in Eurocrypt 2010. And our
innovation is to employ the algorithm SampleGaussian
introduced by Gentry et al. and the property of random
lattice to simulate the identity secret key with
respect to the challenge identity. Compared with other
existing IB-HPSs in the standard model, our master
public key is quite compact. As a result, our
construction has much lower overheads on computation
and storage.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Hu:2019:AAA,
author = "Yupu Hu and Zhizhu Lian and Jiangshan Chen and Baocang
Wang and Shanshan Zhang",
title = "Algebraic Attacks Against Several Weak Variants of
{GVW 13 ABE}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "607--618",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S012905411940015X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905411940015X",
abstract = "Attribute-based encryption (ABE) is an active research
area in the public-key cryptography. Among large amount
of ABE schemes, the scheme GVW 13 (STOC13) is an
well-known candidate for realizing ABE via lattice
mechanism, whose security relies on learning with
errors (LWE). This ABE scheme has very exquisite
structure, and its crucial component lies in using that
two-to-one recoding (TOR) algorithm. However, the main
shortcoming of GVW 13 is the use of the huge key-size.
Therefore, it encourages people to find out some more
simplified variants of GVW 13. In this paper, we first
propose three variants of GVW 13 for reducing the size
of secret key, which would be the feasible strategies
to improve GVW 13 with great possibility.
Unfortunately, we can still present three related
attacks against these three proposals under the same
collusion scenario, respectively.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Kang:2019:NBK,
author = "Burong Kang and Xinyu Meng and Lei Zhang and Yinxia
Sun",
title = "Nonce-Based Key Agreement Protocol Against Bad
Randomness",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "619--633",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400161",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400161",
abstract = "Most of the existing cryptographic schemes, e.g., key
agreement protocol, call for good randomness.
Otherwise, the security of these cryptographic schemes
cannot be fully guaranteed. Nonce-based cryptosystem is
recently introduced to improve the security of public
key encryption and digital signature schemes by
ensuring security when randomness fails. In this paper,
we first investigate the security of key agreement
protocols when randomness fails. Then we define the
security model for nonce-based key agreement protocols
and propose a nonce-based key agreement protocol that
protects against bad randomness. The new protocol is
proven to be secure in our proposed security model.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Liu:2019:SEC,
author = "Xiangxin Liu and Xiaoyuan Yang and Yiliang Han and Xu
An Wang",
title = "A Secure and Efficient Code-Based Signature Scheme",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "635--645",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400173",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400173",
abstract = "The McEliece public key cryptosystem and the
Niederreiter public key cryptosystem are the two major
branches of the code-based public key cryptosystem. It
has been found that the difficult problems relied by
these two systems are different from the syndrome
decoding problem stated by Berlekamp et al. The Hamming
weight of the error vector is fixed and known to the
attackers in these two systems, which leading to the
disclosure of information, and through which the
attacker can implement an effective attack. In this
paper, an improved vision of the McEliece public key
cryptosystem was given, and a new code-based signature
scheme is designed based on the new cryptosystem. As a
result, we achieve a more secure variant of McEliece
public key cryptosystem and a more secure code-based
signature scheme with high security and fast signing
speed.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Wu:2019:PFI,
author = "Libing Wu and Yubo Zhang and Kim-Kwang Raymond Choo
and Debiao He",
title = "Pairing-Free Identity-Based Encryption with Authorized
Equality Test in Online Social Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "4",
pages = "647--664",
month = jun,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400185",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400185",
abstract = "Online social networking applications have become more
and more popular in the advance of the technological
age. Much of our personal information has been
disclosed in social networking activities and
privacy-preserving still remains a research challenge
in social network. Public key encryption scheme with
equality test(PKEET), which is an extension of public
key encryption with keyword search (PEKS), seems to be
a solution. PKEET enables the tester to check whether
two given ciphertexts are derived from the same
plaintext. Recently, Zhu et al. proposed a pairing-free
public key encryption scheme with equality test based
on the traditional public key cryptosystem. However, it
suffers from certificates management issue. In this
paper, we propose a pairing-free identity-based
encryption scheme with authorized equality
test(PF-IBEAET). The PF-IBEAET scheme also provides
fine-grained authorizations. We prove that the scheme
is one way secure against chosen identity and chosen
ciphertext attack (OW-ID-CCA) and indistinguishable
against chosen-identity and chosen-ciphertext attack
(IND-ID-CCA) in the random oracle model (ROM).
Performance analysis shows that the scheme achieves a
better performance than similar schemes.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue Cryptography and Provable Security",
}
@Article{Zhang:2019:LRH,
author = "Yinghui Zhang and Menglei Yang and Dong Zheng and
Tiantian Zhang and Rui Guo and Fang Ren",
title = "Leakage-Resilient Hierarchical Identity-Based
Encryption with Recipient Anonymity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "5",
pages = "665--681",
month = aug,
year = "2019",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054119400197",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400197",
abstract = "As a promising public key cryptographic primitive,
hierarchical identity-based encryption (HIBE)
introduces key delegation mechanisms into
identity-based encryption. However, key leakage and
recipient anonymity issues have not been adequately
addressed in HIBE. Hence, direct applications of
traditional HIBE schemes will violate data security and
abuse users privacy in practice. In this paper, we
propose an anonymous unbounded hierarchical
identity-based encryption scheme, which achieves
bounded leakage resilience and the hierarchy depth is
not limited. Our security proofs based on the dual
system encryption technique show that the proposed
scheme is capable of resisting key leakage and it
realizes recipient anonymity in the standard model. In
addition, leakage resilience analysis indicates that
our scheme allows the leakage rate of approximate 1/3
no matter the hierarchy depth of identities. Finally,
performance comparisons show the practicability of our
scheme. In particular, the secret key of our
construction is of a fixed-length.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Faal:2019:MVE,
author = "Hossein Teimoori Faal",
title = "A Multiset Version of Even-Odd Permutations Identity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "5",
pages = "683--691",
month = aug,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500163",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500163",
abstract = "In this paper, we present a multiset analogue of the
even-odd permutations identity in the context of
combinatorics of words. The multiset version is indeed
equivalent to the coin arrangements lemma which is a
key lemma in Sherman's proof of Feynman's conjecture
about combinatorial solution of Ising model in
statistical physics. Here, we give a bijective proof
which is based on the standard factorization of a
Lyndon word.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2019:FFH,
author = "Pingshan Li and Min Xu",
title = "Fault-Free {Hamiltonian} Cycles in Balanced Hypercubes
with Conditional Edge Faults",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "5",
pages = "693--717",
month = aug,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500175",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500175",
abstract = "The balanced hypercube, BHn, is a variant of
hypercube Qn . Zhou et al. [ Inform. Sci. 300 (2015) 20
27] proposed an interesting problem that whether there
is a fault-free Hamiltonian cycle in BHn with each
vertex incident to at least two fault-free edges. In
this paper, we consider this problem and show that each
fault-free edge lies on a fault-free Hamiltonian cycle
in BHn after no more than 4n 5 faulty edges occur if
each vertex is incident with at least two fault-free
edges for all n 2 . Our result is optimal with respect
to the maximum number of tolerated edge faults.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Poovanandran:2019:SST,
author = "Ghajendran Poovanandran and Wen Chean Teh",
title = "Strong $ (2 \cdot t) $ and Strong $ (3 \cdot t) $
Transformations for Strong {$M$}-Equivalence",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "5",
pages = "719--733",
month = aug,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500187",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500187",
abstract = "Parikh matrices have been extensively investigated due
to their usefulness in studying subword occurrences in
words. Due to the dependency of Parikh matrices on the
ordering of the alphabet, the notion of strong
$M$-equivalence was proposed as an order-independent
alternative to $M$-equivalence in studying words
possessing the same Parikh matrix. This paper
introduces and studies the notions of strong $ (2 \cdot
t)$ and strong $ (3 \cdot t)$ transformations in
determining when two ternary words are strongly
$M$-equivalent. The irreducibility of strong $ (2 \cdot
t)$ transformations is then scrutinized, further
exemplified by a structural characterization of
irreducible strong $ (2 \cdot 2)$ transformations. The
common limitation of these transformations in
characterizing strong $M$-equivalence is then
addressed.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2019:BSC,
author = "Gang Wang and Min-Yao Niu and Fang-Wei Fu",
title = "Bounds on Subspace Codes Based on Orthogonal Space
Over Finite Fields of Characteristic 2",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "5",
pages = "735--757",
month = aug,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500199",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500199",
abstract = "In this paper, the Sphere-packing bound,
Wang-Xing-Safavi-Naini bound, Johnson bound and
Gilbert-Varshamov bound on the subspace code of length
2 +, size M, minimum subspace distance 2j based on m
-dimensional totally singular subspace in the (2 + )
-dimensional orthogonal space 𝔽q(2 + ) over
finite fields 𝔽q of characteristic 2, denoted
by (2 +, M, 2j,m)q, are presented, where is a positive
integer, = 0, 1, 2, 0 m, 0 j m . Then, we prove that
(2 +, M, 2j,m)q codes attain the Wang-Xing-Safavi-Naini
bound if and only if they are certain Steiner
structures in (m, 0, 0; 2 + ), where (m, 0, 0; 2 + )
denotes the collection of all the m -dimensional
totally singular subspaces in the (2 + ) -dimensional
orthogonal space 𝔽q(2 + ) over 𝔽q of
characteristic 2. Finally, Gilbert-Varshamov bound and
linear programming bound on the subspace code (2 +
, M,d)q in (2 + ) are provided, where (2 + ) denotes the
collection of all the totally singular subspaces in the
(2 + ) -dimensional orthogonal space 𝔽q(2 + )
over 𝔽q of characteristic 2.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kumari:2019:ALC,
author = "Priti Kumari and Pramod Kumar Kewat",
title = "2-Adic and Linear Complexities of a Class of
{Whiteman}'s Generalized Cyclotomic Sequences of Order
Four",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "5",
pages = "759--779",
month = aug,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500205",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500205",
abstract = "Although for more than 20 years, Whiteman's
generalized cyclotomic sequences have been thought of
as the most important pseudo-random sequences, but,
there are only a few papers in which their 2-adic
complexities have been discussed. In this paper, we
construct a class of binary sequences of order four
with odd length (product of two distinct odd primes)
from Whiteman's generalized cyclotomic classes. After
that, we determine both 2-adic complexity and linear
complexity of these sequences. Our results show that
these complexities are greater than half of the period
of the sequences, therefore, it may be good
pseudo-random sequences.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ayta:2019:EDC,
author = "Aysun Ayta{\c{c}} and Bet{\"u}l Atay Atakul",
title = "Exponential Domination Critical and Stability in Some
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "5",
pages = "781--791",
month = aug,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500217",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500217",
abstract = "An exponential dominating set of graph $ G = (V, E) $
is a kind of distance domination subset $ S \subseteq
V(G) $ such that $ \sum_{u \in S}(1 / 2)^{\bar {d}(u,
v) - 1} \geq 1 $, $ \forall v \in V(G) $, where $ \bar
{d}(u, v) $ is the length of a shortest path in $
\langle V(G) - (S - \{ u \}) \rangle $ if such a path
exists, and $ \infty $ otherwise. The minimum
exponential domination number, $ \gamma_e(G) $ is the
smallest cardinality of an exponential dominating set.
The minimum exponential domination number, $
\gamma_e(G) $ can be decreased or increased by removal
of some vertices from $G$. In this paper, we
investigate of this phenomenon which is referred to
critical and stability in graphs.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhao:2019:GCB,
author = "Shu-Li Zhao and Rong-Xia Hao",
title = "The Generalized Connectivity of Bubble-Sort Star
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "5",
pages = "793--809",
month = aug,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500229",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500229",
abstract = "The connectivity plays an important role in measuring
the fault tolerance and reliability of interconnection
networks. The generalized k-connectivity of a graph G,
denoted by k(G), is an important indicator of a
network's ability for fault tolerance and reliability.
The bubble-sort star graph, denoted by BSn, is a well
known interconnection network. In this paper, we show
that 3(BSn) = 2n 4 for n 3, that is, for any three
vertices in BSn, there exist 2n 4 internally disjoint
trees connecting them in BSn for n 3, which attains
the upper bound of 3(G) (G) 1 given by Li et al. for G
= BSn .",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tokat:2019:DI,
author = "H{\"u}seyin Tokat and Alpay Kirlangi{\c{c}}",
title = "On the Domination Integrity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "811--826",
month = sep # "--" # nov,
year = "2019",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054119500230",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500230",
abstract = "The domination integrity of graph G is defined by
DI(G) ={min|S| + m(G S): S is a dominating set of G}
where m(G S) denotes the order of the largest component
in G S . This parameter is a measures of vulnerability
of a graph. In this paper, we determine the domination
integrity of middle graph of graph Bn, graph Ept and
graph Hn2 . We also obtain some results for cartesian
product and corona.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017.",
}
@Article{Campeanu:2019:P,
author = "Cezar C{\^a}mpeanu and Giovanni Pighizzini",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "827--829",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119020039",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119020039",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Almagor:2019:SCM,
author = "Shaull Almagor and Denis Kuperberg and Orna
Kupferman",
title = "Sensing as a Complexity Measure",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "831--873",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400203",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400203",
abstract = "The size of deterministic automata required for
recognizing regular and -regular languages is a
well-studied measure for the complexity of languages.
We introduce and study a new complexity measure, based
on the sensing required for recognizing the language.
Intuitively, the sensing cost quantifies the detail in
which a random input word has to be read in order to
decide its membership in the language. We study the
sensing cost of regular and -regular languages, as well
as applications of the study in practice, especially in
the monitoring and synthesis of reactive systems.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Anselmo:2019:SPA,
author = "Marcella Anselmo and Dora Giammarresi and Maria
Madonia",
title = "Sets of Pictures Avoiding Overlaps",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "875--898",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400215",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400215",
abstract = "A string set avoids overlaps if it has the property
that the prefix of each string in the set does not
coincide with the suffix of any string in the set. The
problem of avoiding overlaps in strings is extensively
investigated since it plays an important role in the
context of string matching and coding. The notion of
overlap can be extended naturally to two dimensions;
two pictures p p p and q q q have an overlap if one can
put one corner of p p p on some position in q q q in
such a way that all symbols in the common positions
coincide. A picture with no self-overlaps is called
unbordered and it is a generalization in two dimensions
of an unbordered $ (o r b i f i x - f r e e) $ string.
We first investigate the problem of generating all
unbordered pictures of fixed size. Then, we study
particular sets of unbordered pictures that are
non-overlapping each others. We show that the frame of
the pictures has a special role in defining these sets.
In particular, we prove that there exist kinds of
synchronization frames that can be put around the
pictures of any set to make it non-overlapping.
Finally, we present a construction of non-expandable
non-overlapping sets of pictures which starts from some
property of frame-completeness.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Broda:2019:ABR,
author = "Sabine Broda and Ant{\'o}nio Machiavelo and Nelma
Moreira and Rog{\'e}rio Reis",
title = "On Average Behaviour of Regular Expressions in Strong
Star Normal Form",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "899--920",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400227",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400227",
abstract = "For regular expressions in $ (s t r o n g) $ star
normal form a large set of efficient algorithms is
known, from conversions into finite automata to
characterisations of unambiguity. In this paper we
study the average complexity of this class of
expressions using analytic combinatorics. As it is not
always feasible to obtain explicit expressions for the
generating functions involved, here we show how to get
the required information for the asymptotic estimates
with an indirect use of the existence of Puiseux
expansions at singularities. We study, asymptotically
and on average, the alphabetic size, the size of the
-follow automaton and of the position automaton, as
well as the ratio and the size of these expressions to
standard regular expressions.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Brzozowski:2019:MCN,
author = "Janusz A. Brzozowski and Sylvie Davies",
title = "Most Complex Non-Returning Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "921--957",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400239",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400239",
abstract = "A regular language L L L is non-returning if in the
minimal deterministic finite automaton accepting it
there are no transitions into the initial state. Eom,
Han and Jir{\'a}skov{\'a} derived upper bounds on the
state complexity of boolean operations and Kleene star,
and proved that these bounds are tight using two
different binary witnesses. They derived tight upper
bounds for concatenation and reversal using three
different ternary witnesses. These five witnesses use a
total of six different transformations. We show that
for each n 4 n 4 n 4, there exists a ternary witness
of state complexity n n n that meets the bound for
reversal, and restrictions of this witness to binary
alphabets meet the bounds for star, product, and
boolean operations. Hence all of these operations can
be handled simultaneously with a single witness, using
only three different transformations. We also derive
tight upper bounds on the state complexity of binary
operations that take arguments with different
alphabets. We prove that the maximal syntactic
semigroup of a non-returning language has $ (n 1) $ n $
(n 1) $ n $ (n 1) $ n elements and requires at least $
(n2) $ n2 n 2 generators. We find the maximal state
complexities of atoms of non-returning languages. We
show that there exists a most complex sequence of
non-returning languages that meet the bounds for all of
these complexity measures. Furthermore, we prove there
is a most complex sequence that meets all the bounds
using alphabets of minimal size.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Dassow:2019:OAS,
author = "J{\"u}rgen Dassow",
title = "Operational Accepting State Complexity: The Unary and
Finite Case",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "959--978",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400240",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400240",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Faran:2019:PAA,
author = "Rachel Faran and Orna Kupferman",
title = "A Parametrized Analysis of Algorithms on Hierarchical
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "979--1003",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400252",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400252",
abstract = "Hierarchical graphs are used in order to describe
systems with a sequential composition of sub-systems. A
hierarchical graph consists of a vector of subgraphs.
Vertices in a subgraph may call other subgraphs. The
reuse of subgraphs, possibly in a nested way, causes
hierarchical graphs to be exponentially more succinct
than equivalent flat graphs. Early research on
hierarchical graphs and the computational price of
their succinctness suggests that there is no strong
correlation between the complexity of problems when
applied to flat graphs and their complexity in the
hierarchical setting. That is, the complexity in the
hierarchical setting is higher, but all jumps in
complexity up to an exponential one are exhibited,
including no jumps in some problems. We continue the
study of the complexity of algorithms for hierarchical
graphs, with the following contributions: $ (1) $ In
many applications, the subgraphs have a small, often a
constant, number of exit vertices, namely vertices from
which control returns to the calling subgraph. We offer
a parameterized analysis of the complexity and point to
problems where the complexity becomes lower when the
number of exit vertices is bounded by a constant. $ (2)
$ We describe a general methodology for algorithms on
hierarchical graphs. The methodology is based on an
iterative compression of subgraphs in a way that
maintains the solution to the problems and results in
subgraphs whose size depends only on the number of exit
vertices, and $ (3) $ we handle labeled hierarchical
graphs, where edges are labeled by letters from some
alphabet, and the problems refer to the languages of
the graphs.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Freund:2019:VNE,
author = "Rudolf Freund and Vladimir Rogojin and Sergey Verlan",
title = "Variants of Networks of Evolutionary Processors with
Polarizations and a Small Number of Processors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "1005--1027",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400264",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400264",
abstract = "We improve previous results obtained for networks of
evolutionary processors using the operations insertion,
deletion, and substitution on strings with elementary
polarizations 1,0,1 1,0,1 1, 0, 1 by showing that only
seven processors are needed to obtain computational
completeness. In the case of not requiring a special
output node, only five processors are shown to be
sufficient. We also prove that if the communication
structure is allowed to be a directed graph without
self-loops, then two polarizations are sufficient $ (w
i t h 12 o r 17 n o d e s, d e p e n d i n g o n t h e
d e f i n i t i o n) $. Moreover, we consider the case
of not restricting the number of polarizations, thus
obtaining the minimal number of three nodes for hybrid
systems and even only one node where all three
operations can be carried out.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Gelle:2019:RUF,
author = "Kitti Gelle and Szabolcs Iv{\'a}n",
title = "Recognizing Union--Find Trees is {NP-Complete}, Even
Without Rank Info",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "1029--1045",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400276",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400276",
abstract = "Disjoint-Set forests, consisting of Union-Find trees,
are data structures having a widespread practical
application due to their efficiency. Despite them being
well-known, no exact structural characterization of
these trees is known $ (s u c h a c h a r a c t e r i z
a t i o n e x i s t s f o r U n i o n t r e e s w h i c
h a r e c o n s t r u c t e d w i t h o u t u s i n g p
a t h c o m p r e s s i o n) $ for the case assuming
union-by-rank strategy for merging. In this paper we
provide such a characterization by means of a simple
PUSH operation and show that the decision problems
whether a $ (r a n k e d o r u n r a n k e d) $ tree is
a Union-Find tree are NP-complete, complementing our
earlier similar result for the union-by-size
strategy.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Han:2019:SAR,
author = "Yo-Sub Han and Hwee Kim and Trent A. Rogers and
Shinnosuke Seki",
title = "Self-Attraction Removal from {Oritatami} Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "1047--1067",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400288",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400288",
abstract = "RNA cotranscriptional folding refers to the phenomenon
in which an RNA transcript folds upon itself while
being synthesized out of a gene by an RNA polymerase.
Oritatami is a computational model of this phenomenon,
which lets its sequence of beads $ (a b s t r a c t m o
l e c u l e s) $ taken from a finite alphabet fold
cotranscriptionally via interactions between beads
according to its rule set. In this paper, we study the
problem of removing self-attractions, which lets a bead
interact with another bead of the same kind, from a
given Oritatami system without changing its behavior.
Self-attraction is one of the major challenges in the
construction of intrinsic Oritatami systems, which can
simulate even the dynamics of all the Oritatami
systems.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Holzer:2019:OTN,
author = "Markus Holzer and Martin Kutrib",
title = "One-Time Nondeterministic Computations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "1069--1089",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S012905411940029X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905411940029X",
abstract = "We introduce the concept of one-time nondeterminism as
a new kind of limited nondeterminism for finite state
machines and pushdown automata. Roughly speaking,
one-time nondeterminism means that at the outset the
computation is nondeterministic, but whenever it
performs a guess, this guess is fixed for the rest of
the computation. We characterize the computational
power of one-time nondeterministic finite automata $ (O
T N F A s) $ and one-time nondeterministic pushdown
devices. Moreover, we study the descriptional
complexity of these machines. For instance, we show
that for an n n n -state OTNFA with a sole
nondeterministic state, that is nondeterministic for
only one input symbol, $ (n + 1) $ n $ (n + 1) $ n $ (n
+ 1) $ n states are sufficient and necessary in the
worst case for an equivalent deterministic finite
automaton. In case of pushdown automata, the conversion
of a nondeterministic to a one-time nondeterministic as
well as the conversion of a one-time nondeterministic
to a deterministic one turn out to be non-recursive,
that is, the trade-offs in size cannot be bounded by
any recursive function.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Jirsek:2019:KAG,
author = "Jozef {Jir{\'a}sek, Jr.} and Mat{\'u} Palmovsk{\'y}
and Juraj {\v{S}}ebej",
title = "{Kuratowski} Algebras Generated by Prefix-, Suffix-,
Factor-, and Subword-Free Languages Under Star and
Complementation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "1091--1115",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400306",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400306",
abstract = "We study Kuratowski algebras generated by prefix-,
suffix-, factor-, and subword-free languages under the
operations of star and complementation. We examine 12
possible algebras, and for each of them, we decide
whether or not it can be generated by a prefix-,
suffix-, factor-, or subword-free language. In each
case when an algebra can be generated by such a
language, we show that this language can be taken to be
regular, and we compute upper bounds on the state
complexities of all the generated languages. Finally,
we find generators that maximize these complexities.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Jirskov:2019:SDA,
author = "Galina Jir{\'a}skov{\'a} and Ivana
Kraj{\v{n}}{\'a}kov{\'a}",
title = "Square on Deterministic, Alternating, and {Boolean}
Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "1117--1134",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400318",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400318",
abstract = "We investigate the state complexity of the square
operation on languages represented by deterministic,
alternating, and Boolean automata. For each k k k such
that 1 k n 2 1 k n 2 1 k n 2, we describe a binary
language accepted by an n n n -state deterministic
finite automaton with k k k final states meeting the
upper bound n2n k2n 1 n2n k2n 1 n2n k2n 1 on the state
complexity of its square. We show that in the case of
k=n 1 k=n 1 k = n 1, the corresponding upper bound
cannot be met. Using the binary deterministic witness
for square with 2n 2n 2n states where half of them are
final, we get the tight upper bounds 2n+n+1 2n+n+1 2n +
n + 1 and 2n+n 2n+n 2n + n on the complexity of the
square operation on alternating and Boolean automata,
respectively.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Keeler:2019:BMN,
author = "Chris Keeler and Kai Salomaa",
title = "Branching Measures and Nearly Acyclic {NFAs}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "1135--1155",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S012905411940032X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905411940032X",
abstract = "To get a more comprehensive understanding of the
amount of branching in computations of a
nondeterministic finite automaton $ (N F A) $, we
introduce and study the string path width and depth
path width measures. For a given NFA, the string path
width on a string w w w counts the number of all
complete computations on w w w, and the depth path
width on an integer counts the number of complete
computations on all strings of length . We give an
algorithm to decide the finiteness of the depth path
width of an NFA. Deciding finiteness of string path
width can be reduced to the corresponding question on
ambiguity. An NFA is nearly acyclic if any computation
can pass through at most one cycle. The class of nearly
acyclic NFAs consists of exactly all NFAs with finite
depth path width. Using this characterization we show
that the finite depth path width of an m m m -state NFA
over a k k k -letter alphabet is at most $ (k + 1) $ m
1 $ (k + 1) $ m 1 $ (k + 1) $ m 1 and that this bound
is tight. The nearly acyclic NFAs recognize exactly the
class of constant density regular languages.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Lavado:2019:CRR,
author = "Giovanna J. Lavado and Luca Prigioniero",
title = "Concise Representations of Reversible Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "1157--1175",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400331",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400331",
abstract = "In this paper, we present two concise representations
of reversible automata. Both representations have a
size comparable to the size of the minimum equivalent
deterministic automaton and can be exponentially
smaller than the size of the explicit representations
of corresponding reversible automata. Using these
representations it is possible to simulate the
computations of reversible automata without explicitly
writing down their complete descriptions.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Maslennikova:2019:RCI,
author = "Marina Maslennikova",
title = "Reset Complexity of Ideal Languages Over a Binary
Alphabet",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "1177--1196",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400343",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400343",
abstract = "We prove PSPACE-completeness of checking whether a
given ideal language serves as the language of reset
words for some automaton with at most four states over
a binary alphabet. We compare the reset complexity and
the state complexity for languages related to slowly
synchronizing automata.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Ng:2019:SCS,
author = "Timothy Ng and David Rappaport and Kai Salomaa",
title = "State Complexity of Suffix Distance",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "1197--1216",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400355",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400355",
abstract = "The neighbourhood of a regular language with respect
to the prefix, suffix and subword distance is always
regular and a tight bound for the state complexity of
prefix distance neighbourhoods is known. We give upper
bounds for the state complexity of the neighbourhood of
radius k k k of an n n n -state deterministic finite
automaton language with respect to the suffix distance
and the subword distance, respectively. For restricted
values of k k k and n n n we give a matching lower
bound for the state complexity of suffix distance
neighbourhoods.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Okhotin:2019:SCQ,
author = "Alexander Okhotin and Kai Salomaa",
title = "State Complexity of the Quotient Operation on
Input-Driven Pushdown Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "6--7",
pages = "1217--1235",
month = sep # "--" # nov,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119400367",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 20 10:48:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119400367",
abstract = "The quotient of a formal language $K$ by another
language $L$ is the set of all strings obtained by
taking a string from $K$ that ends with a suffix of a
string from $L$, and removing that suffix. The quotient
of a regular language by any language is always
regular, whereas the context-free languages and many of
their subfamilies, such as the linear and the
deterministic languages, are not closed under the
quotient operation. This paper establishes the closure
of the family of languages recognized by input-driven
pushdown automata (IDPDA), also known as visibly
pushdown automata, under the quotient operation. A
construction of automata representing the result of the
operation is given, and its state complexity with
respect to nondeterministic IDPDA is shown to be
exactly $ m^2 n$, where $m$ and $n$ are the numbers of
states in the automata recognizing $K$ and $L$,
respectively.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science $(IJFCS)$",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Descriptional Complexity of Formal
Systems 2017",
}
@Article{Fu:2019:CBO,
author = "Qiang Fu and Ruihu Li and Fangwei Fu and Yi Rao",
title = "On the Construction of Binary Optimal {LCD} Codes with
Short Length",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "8",
pages = "1237--1245",
month = dec,
year = "2019",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054119500242",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Dec 13 08:30:39 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500242",
abstract = "A $q$-ary linear code $ \cal C$ is called a linear
complementary dual (LCD) code if it meets its dual
trivially. Binary LCD codes play a significant role for
their advantage of low complexity for implementations
against side-channel attacks and fault injection
attacks. In this paper, the problem of finding LCD
codes over the binary field is discussed. Many new
codes and new bounds are presented, as well as a table
of optimal LCD codes (or upper and lower bounds on such
codes) of length up to 30 bits.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2019:FTP,
author = "Xirong Xu and Huifeng Zhang and Sijia Zhang and
Yuansheng Yang",
title = "Fault-Tolerant Panconnectivity of Augmented Cubes {$ A
Q_n $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "8",
pages = "1247--1278",
month = dec,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500254",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Dec 13 08:30:39 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500254",
abstract = "The augmented cube $ A Q_n $ is a variation of the
hypercube $ Q_n $. This paper considers the
fault-tolerant Panconnectivity of $ A Q_n $ . Assume
that $ F \subseteq V(A Q_n) \cup E(A Q_n) $ and $ n
\geq 4 $. We prove that for any two fault-free vertices
$u$ and $v$ with distance $d$ in $ A Q_n $, there
exists a fault-free path $ P_{uv}$ of each length from
$ \max \{ d + 2, 4 \} $ to $ 2^n - f_v - 1$ in $ A Q_n
- F $ if $ |F| \leq 2 n - 4$, where $ f_v$ is the
number of faulty vertices in $ A Q_n $. Moreover, the
bound is sharp.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mohanty:2019:IOE,
author = "Sraban Kumar Mohanty and G. Sajith",
title = "An Input\slash Output Efficient Algorithm for
{Hessenberg} Reduction",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "8",
pages = "1279--1300",
month = dec,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500266",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Dec 13 08:30:39 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500266",
abstract = "Reduction of an $ N \times N $ nonsymmetric matrix to
Hessenberg form which takes $ O(N^3) $ flops and $
O(N^3 / B) $ I/Os is a major performance bottleneck in
the computing of its eigenvalues. Usually to improve
the performance, this Hessenberg reduction is computed
in two steps: the first one reduces the matrix to a
banded Hessenberg form, and the second one further
reduces it to Hessenberg form by incorporating more
matrix-matrix operations in the computation. We analyse
the two steps of the Hessenberg reduction problem on
the external memory model (of Aggarwal and Vitter) for
their I/O complexities. We propose and analyse a tile
based algorithm for the first step of the reduction and
show that it takes $ O(N^3 / B \min \{ t, \sqrt {M} \})
$ I/Os. For the reduction of a banded Hessenberg matrix
of bandwidth $t$ to Hessenberg form, we propose an
algorithm, which uses tight packing of bulges, and
requires only $ O(t^2 N^2 / B + N^3 / t B)$ I/Os.
Combining the results of the two steps of the
reduction, we show that the Hessenberg reduction can be
performed in $ O(N^3 / \sqrt {M}B)$ I/Os, when $N$ is
sufficiently large. To the best of our knowledge, the
proposed algorithm is the first I/O optimal algorithm
for Hessenberg reduction; the worst case I/O complexity
matches the known lower bound of the problem.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2019:FTM,
author = "Liqiong Xu and Shuming Zhou and Weihua Yang",
title = "Fault-Tolerant Maximal Local-Connectivity on {Cayley}
Graphs Generated by Transpositions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "8",
pages = "1301--1315",
month = dec,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500278",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Dec 13 08:30:39 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500278",
abstract = "An interconnection network is usually modeled as a
graph, in which vertices and edges correspond to
processors and communication links, respectively.
Connectivity is an important metric for fault tolerance
of interconnection networks. A graph $G$ is said to be
maximally local-connected if each pair of vertices $u$
and $v$ are connected by $ \min \{ d_G(u), d_G(v) \} $
vertex-disjoint paths. In this paper, we show that
Cayley graphs generated by $ m (\geq 7)$ transpositions
are $ (m - 2)$-fault-tolerant maximally local-connected
and are also $ (m - 3)$-fault-tolerant one-to-many
maximally local-connected if their corresponding
transposition generating graphs have a triangle, $ (m -
2)$-fault-tolerant one-to-many maximally
local-connected if their corresponding transposition
generating graphs have no triangles. Furthermore, under
the restricted condition that each vertex has at least
two fault-free adjacent vertices, Cayley graphs
generated by $ m(\geq 7)$ transpositions are $ (m -
1)$-fault-tolerant maximally local-connected if their
corresponding transposition generating graphs have no
triangles.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dimitrijevs:2019:URP,
author = "Maksims Dimitrijevs and Abuzer Yakary{\i}lmaz",
title = "Uncountable Realtime Probabilistic Classes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "8",
pages = "1317--1333",
month = dec,
year = "2019",
DOI = "https://doi.org/10.1142/S012905411950028X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Dec 13 08:30:39 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905411950028X",
abstract = "We investigate the minimal cases for realtime
probabilistic machines that can define uncountably many
languages with bounded error. We show that logarithmic
space is enough for realtime PTMs on unary languages.
On non-unary case, we obtain the same result for double
logarithmic space, which is also tight. When replacing
the work tape with a few counters, we can still achieve
similar results for unary linear-space two-counter
automata, unary sublinear-space three-counter automata,
and non-unary sublinear-space two-counter automata. We
also show how to slightly improve the sublinear-space
constructions by using more counters.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Salehi:2019:NRV,
author = "{\"O}zlem Salehi and Abuzer Yakary{\i}lmaz and A. C.
Cem Say",
title = "New Results on Vector and {Homing} Vector Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "8",
pages = "1335--1361",
month = dec,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500291",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Dec 13 08:30:39 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500291",
abstract = "We present several new results and connections between
various extensions of finite automata through the study
of vector automata and homing vector automata. We show
that homing vector automata outperform extended finite
automata when both are defined over $ 2 \times 2 $
integer matrices. We study the string separation
problem for vector automata and demonstrate that
generalized finite automata with rational entries can
separate any pair of strings using only two states.
Investigating stateless homing vector automata, we
prove that a language is recognized by stateless blind
deterministic real-time version of finite automata with
multiplication iff it is commutative and its Parikh
image is the set of nonnegative integer solutions to a
system of linear homogeneous Diophantine equations.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mol:2019:CTA,
author = "Lucas Mol and Narad Rampersad and Jeffrey Shallit and
Manon Stipulanti",
title = "{Cobham}'s Theorem and Automaticity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "8",
pages = "1363--1379",
month = dec,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119500308",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Dec 13 08:30:39 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119500308",
abstract = "We make certain bounds in Krebs' proof of Cobham's
theorem explicit and obtain corresponding upper bounds
on the length of a common prefix of an aperiodic
$a$-automatic sequence and an aperiodic $b$ automatic
sequence, where $a$ and $b$ are multiplicatively
independent. We also show that an automatic sequence
cannot have arbitrarily large factors in common with a
Sturmian sequence.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2019:AIV,
author = "Anonymous",
title = "Author Index Volume 30 (2019)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "30",
number = "8",
pages = "1381--1387",
month = dec,
year = "2019",
DOI = "https://doi.org/10.1142/S0129054119990016",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Dec 13 08:30:39 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054119990016",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Csuhaj-Varju:2020:PSI,
author = "Erzs{\'e}bet Csuhaj-Varj{\'u} and Florin Manea",
title = "Preface --- Special Issue: A Collection of Papers in
Honour of the 60th Birthday of {Victor Mitrana}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "1",
pages = "1--6",
month = jan,
year = "2020",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054120020013",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 31 07:25:10 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120020013",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue --- A Collection of Papers in Honour of
the 60th Birthday of Victor Mitrana",
}
@Article{Montoro:2020:LTS,
author = "Fernando Arroyo Montoro and Sandra G{\'o}mez-Canaval
and Karina Jim{\'e}nez Vega and Alfonso Ortega de la
Puente",
title = "A Linear Time Solution for {$N$}-Queens Problem Using
Generalized Networks of Evolutionary Polarized
Processors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "1",
pages = "7--21",
month = jan,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120400018",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 31 07:25:10 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120400018",
abstract = "In this paper we consider a new variant of Networks of
Polarized Evolutionary Processors (NPEP) named
Generalized Networks of Evolutionary Polarized
Processors (GNPEP) and propose them as solvers of
combinatorial optimization problems. Unlike the NPEP
model, GNPEP uses its numerical evaluation over the
processed data from a quantitative perspective, hence
this model might be more suitable to solve specific
hard problems in a more efficient and economic way. In
particular, we propose a GNPEP network to solve a
well-known NP-hard problem, namely the N -queens. We
prove that this GNPEP algorithm requires a linear time
in the size of a given instance. This result suggests
that the GNPEP model is more suitable to address
problems related to combinatorial optimization in which
integer restrictions have a relevant role.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue --- A Collection of Papers in Honour of
the 60th Birthday of Victor Mitrana",
}
@Article{Bera:2020:PQM,
author = "Somnath Bera and Rodica Ceterchi and Kalpana
Mahalingam and K. G. Subramanian",
title = "{Parikh} $q$-Matrices and $q$-Ambiguous Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "1",
pages = "23--36",
month = jan,
year = "2020",
DOI = "https://doi.org/10.1142/S012905412040002X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 31 07:25:10 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412040002X",
abstract = "The Parikh matrix mapping plays an important role in
the study of words through numerical properties. The
Parikh q -matrix mapping, introduced by Egecioglu and
Ibarra (2004) as an extension of the Parikh matrix
mapping, maps words to matrices with polynomial entries
in q. A word w over an ordered alphabet {\textSigma} is
said to be q -ambiguous if there exists another word v
over {\textSigma} such that both the words have same
Parikh q -matrix. Here we derive several properties of
q -ambiguous words, in particular, for a binary
alphabet.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue --- A Collection of Papers in Honour of
the 60th Birthday of Victor Mitrana",
}
@Article{Bordihn:2020:DLS,
author = "Henning Bordihn and Gy{\"o}rgy Vaszil",
title = "Deterministic {Lindenmayer} Systems with Dynamic
Control of Parallelism",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "1",
pages = "37--51",
month = jan,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120400031",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 31 07:25:10 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120400031",
abstract = "M-rate 0L systems are interactionless Lindenmayer
systems together with a function assigning to every
string a set of multisets of productions that may be
applied simultaneously to the string. Some questions
that have been left open in the forerunner papers are
examined, and the computational power of deterministic
M-rate 0L systems is investigated, where also tabled
and extended variants are taken into consideration.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue --- A Collection of Papers in Honour of
the 60th Birthday of Victor Mitrana",
}
@Article{Bottoni:2020:NRS,
author = "Paolo Bottoni and Anna Labella and Grzegorz
Rozenberg",
title = "Networks of Reaction Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "1",
pages = "53--71",
month = jan,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120400043",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 31 07:25:10 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120400043",
abstract = "In this paper, we study the behavior (processes) of
reaction systems where the context is not arbitrary,
but it has its own structure. In particular, we
consider a model where the context for a reaction
system originates from a network of reaction systems.
Such a network is formalized as a graph with reaction
systems residing at its nodes, where each reaction
system contributes to defining the context of all its
neighbors. This paper provides a framework for
investigating the behavior of reaction systems
receiving contexts from networks of reaction systems,
provides a characterisation of their state sequences,
and considers different topologies of context
networks.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue --- A Collection of Papers in Honour of
the 60th Birthday of Victor Mitrana",
}
@Article{Dassow:2020:NEP,
author = "J{\"u}rgen Dassow and Bianca Truthe",
title = "Networks with Evolutionary Processors and Ideals and
Codes as Filters",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "1",
pages = "73--89",
month = jan,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120400055",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 31 07:25:10 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120400055",
abstract = "We study how the generative power of networks of
evolutionary processors decreases if special codes and
ideals are used as input and output filters of the
nodes instead of arbitrary regular languages. We show
that all recursively enumerable languages can be
generated if the filters are right ideals or left
ideals. With respect to codes, we obtain a hierarchy of
evolutionary language families which is almost
identical to that of the families of codes.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue --- A Collection of Papers in Honour of
the 60th Birthday of Victor Mitrana",
}
@Article{Fazekas:2020:PSD,
author = "Szil{\'a}rd Zsolt Fazekas and Robert Merca{\c{s}} and
Daniel Reidenbach",
title = "On the Prefix--Suffix Duplication Reduction",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "1",
pages = "91--102",
month = jan,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120400067",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 31 07:25:10 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120400067",
abstract = "This work answers some questions proposed by Bottoni,
Labella, and Mitrana ( Theoretical Computer Science
682, 2017) regarding the prefix--suffix reduction on
words. The operation is defined as a reduction by one
half of every square that is present as either a prefix
or a suffix of a word, leading thus to a finite set of
words associated to the starting one. The iterated case
considers consecutive applications of the operations,
on all the resulting words. We show that the classes of
linear and context-free language are closed under
iterated bounded prefix--suffix square reduction, and
that for a given word we can determine in
\SGMLentity{"1d4aa}(n2logn) time all of its primitive
prefix--suffix square roots.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue --- A Collection of Papers in Honour of
the 60th Birthday of Victor Mitrana",
}
@Article{Lopez:2020:SIM,
author = "Luis Fernando de Mingo L{\'o}pez and Nuria G{\'o}mez
Blas and Angel Luis Castellanos Pe{\~n}uela and Juan
Bautista Castellanos Pe{\~n}uela",
title = "Swarm Intelligence Models: Ant Colony Systems Applied
to {BNF} Grammars Rule Derivation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "1",
pages = "103--116",
month = jan,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120400079",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 31 07:25:10 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120400079",
abstract = "Ant Colony Systems have been widely employed in
optimization issues primarily focused on path finding
optimization, such as Traveling Salesman Problem. The
main advantage lies in the choice of the edge to be
explored, defined using the idea of pheromone. This
article proposes the use of Ant Colony Systems to
explore a Backus-Naur form grammar whose elements are
solutions to a given problem. Similar studies, without
using Ant Colonies, have been used to solve
optimization problems, such as Grammatical Swarm (based
on Particle Swarm Optimization) and Grammatical
Evolution (based on Genetic Algorithms). Proposed
algorithm opens the way to a new branch of research in
Swarm Intelligence, which until now has been almost
non-existent, using ant colony algorithms to solve
problems described by a grammar.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue --- A Collection of Papers in Honour of
the 60th Birthday of Victor Mitrana",
}
@Article{Paun:2020:USP,
author = "Andrei P{\u{a}}un and Florin-Daniel B{\^\i}lb{\^\i}e",
title = "Universality of {SNQ P} Systems Using One Type of
Spikes and Restrictive Rule Application",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "1",
pages = "117--132",
month = jan,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120400080",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 31 07:25:10 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120400080",
abstract = "We investigate the spiking neural P systems with
communication on request (SNQ P systems) that are
devices in the area of neural like P systems
abstracting the way in which neurons work and process
information. Here we discuss the SNQ P systems using
the rule application strategy as defined by Linqiang
Pan and collaborators and we are able to improve their
result of universality of such systems using two types
of spikes. In the current work, we prove that only one
type of spikes is sufficient for reaching the
computational power of Turing Machines for these
devices, bringing closer to implementation such a
device. The result holds both in maximum parallel
manner application of the rules as well as the
maximum-sequentiality application of rules.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue --- A Collection of Papers in Honour of
the 60th Birthday of Victor Mitrana",
}
@Article{Sempere:2020:CLG,
author = "Jos{\'e} M. Sempere",
title = "On Compensation Loops in Genomic Duplications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "1",
pages = "133--142",
month = jan,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120400092",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 31 07:25:10 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120400092",
abstract = "In this paper, we investigate the compensation loops,
a DNA rearrangement in chromosomes due to unequal
crossing over. We study the effect of compensation
loops over the gene duplication, and we formalize it as
a restricted case of gene duplication in general. We
study this biological process under the point of view
of formal languages, and we provide some results about
the languages defined in this way.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue --- A Collection of Papers in Honour of
the 60th Birthday of Victor Mitrana",
}
@Article{Tirnauca:2020:CSB,
author = "Cristina T{\^\i}rn{\u{a}}uc{\u{a}} and Jos{\'e} L.
Balc{\'a}zar and Domingo G{\'o}mez-P{\'e}rez",
title = "Closed-Set-Based Discovery of Representative
Association Rules",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "1",
pages = "143--156",
month = jan,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120400109",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 31 07:25:10 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120400109",
abstract = "The output of an association rule miner is often huge
in practice. This is why several concise lossless
representations have been proposed, such as the
``essential'' or ``representative'' rules. A previously
known algorithm for mining representative rules relies
on an incorrect mathematical claim, and can be seen to
miss part of its intended output; in previous work, two
of the authors of the present paper have offered a
complete but, often, somewhat slower alternative. Here,
we extend this alternative to the case of closure-based
redundancy. The empirical validation shows that, in
this way, we can improve on the original time
efficiency, without sacrificing completeness.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue --- A Collection of Papers in Honour of
the 60th Birthday of Victor Mitrana",
}
@Article{Kim:2020:TRO,
author = "Eunkyung Kim and Hyang-Sook Lee and Jeongeun Park",
title = "Towards Round-Optimal Secure Multiparty Computations:
Multikey {FHE} Without a {CRS}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "2",
pages = "157--174",
month = feb,
year = "2020",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905412050001X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "10 March 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412050001X",
abstract = "Multikey fully homomorphic encryption (MFHE) allows
homomorphic operations between ciphertexts encrypted
under different keys. In applications for secure
multiparty computation (MPC) protocols, MFHE can be
more advantageous than usual fully homomorphic
encryption (FHE) since users do not need to agree with
a common public key before the computation when using
MFHE. In EUROCRYPT 2016, Mukherjee and Wichs
constructed a secure MPC protocol in only two rounds
via MFHE which deals with a common random/reference
string (CRS) in key generation. After then, Brakerski
et al. replaced the role of CRS with the distributed
setup for CRS calculation to form a four round secure
MPC protocol. Thus, recent improvements in round
complexity of MPC protocols have been made using MFHE.
In this paper, we go further to obtain round-efficient
and secure MPC protocols. The underlying MFHE schemes
in previous works still involve the common value, CRS,
it seems to weaken the power of using MFHE to allow
users to independently generate their own keys.
Therefore, we resolve the issue by constructing an MFHE
scheme without CRS based on LWE assumption, and then we
obtain a secure MPC protocol against semi-malicious
security in three rounds. We also define a new security
notion ``multikey-CPA security'' to prove that a
multikey ciphertext cannot be decrypted unless all the
secret keys are gathered and our scheme is multikey-CPA
secure.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sun:2020:CSR,
author = "Yinxia Sun and Futai Zhang and Anmin Fu and Zhe Xia",
title = "{CCA}-Secure and Revocable Certificateless Encryption
with Ciphertext Evolution",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "2",
pages = "175--191",
month = feb,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500021",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 10 07:39:25 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500021",
abstract = "Certificateless cryptosystems have attracted great
interests in cryptographic research since its
invention. Because compared with traditional public key
cryptosystems or identity-based cryptosystems, they
could not only simplify the certificate management, but
also alleviate the key escrow problem. In
certificateless cryptosystems, user revocation is a
challenging issue. To address this issue, one popular
method is to update the key via public channels.
However, most of the existing schemes in this approach
are impractical because of the following two
shortcomings. Firstly, the user needs to maintain a
list of decryption keys, but the size of the list will
keep increasing. Secondly, the revoked user can still
recover the plaintexts of the encrypted data prior to
revocation, and this is a particular threat in some
applications. To solve these problems, this paper
presents revocable certificateless encryption with
ciphertext evolution. We give a generic construction
and then describe how it can be initialized concretely.
In our proposed scheme, the user only needs to keep one
decryption key, and once a user is revoked, it can no
longer decrypt any ciphertext in the server. Moreover,
the IND-CCA security model is defined against three
types of attacks. And our schemes are formally proved
to satisfy these security requirements.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lv:2020:SAP,
author = "Jiaxian Lv and Yi Wang and Jinshu Su and Rongmao Chen
and Wenjun Wu",
title = "Security of Auditing Protocols Against Subversion
Attacks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "2",
pages = "193--206",
month = feb,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500033",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 10 07:39:25 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500033",
abstract = "In 2013, the revelation of Edward Snowden rekindled
cryptographic researchers' interest in subversion
attacks. Since then, many works have been carried out
to explore the power of subversion attacks and feasible
effective countermeasures as well. In this work, we
investigate the study of subversion attacks against
cloud auditing protocol, which has been well-known as
useful primitive for secure cloud storage. We
demonstrate that subverted auditing protocol enables
the cloud server to recover secret information stored
on the data owner side. Particularly, we first define
an asymmetric subversion attack model for auditing
protocol. This model serves as the principle for
analyzing the undetectability and key recovery of
subversion attacks against auditing protocols. We then
show a general framework of asymmetric subversion
attacks against auditing protocols with
index-coefficient challenge. To illustrate the
feasibility of our paradigm, several concrete auditing
protocols are provided. As a feasible countermeasure,
we propose a subversion-resilient auditing protocol
with index-coefficient challenge.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bahig:2020:UMP,
author = "Hatem M. Bahig and Dieaa I. Nassr and Ashraf Bhery and
Abderrahmane Nitaj",
title = "A Unified Method for Private Exponent Attacks on {RSA}
Using Lattices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "2",
pages = "207--231",
month = feb,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500045",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 10 07:39:25 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500045",
abstract = "Let ($ n = p q $, $ e = n^\beta $) be an RSA public
key with private exponent $ d = n^\delta $, where $p$
and $q$ are large primes of the same bit size. At
Eurocrypt 96, Coppersmith presented a polynomial-time
algorithm for finding small roots of univariate modular
equations based on lattice reduction and then succeeded
to factorize the RSA modulus. Since then, a series of
attacks on the key equation $ e d - k \phi (n) = 1$ of
RSA have been presented. In this paper, we show that
many of such attacks can be unified in a single attack
using a new notion called Coppersmith's interval. We
determine a Coppersmith's interval for a given RSA
public key $ (n, e)$. The interval is valid for any
variant of RSA, such as Multi-Prime RSA, that uses the
key equation. Then we show that RSA is insecure if $
\delta < \beta + 1 / 3 \alpha - 1 / 3 \sqrt {12 \alpha
\beta + 4 \alpha^2}$ provided that we have
approximation $ p_0 \geq \sqrt {n}$ of $p$ with $ |p -
p_0 | \leq 1 / 2 n^\alpha $, $ \alpha \leq 1 / 2$. The
attack is an extension of Coppersmith's result.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Han:2020:CPE,
author = "Yuejuan Han and Lantao You and Cheng-Kuan Lin and
Jianxi Fan",
title = "Communication Performance Evaluation of the Locally
Twisted Cube",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "2",
pages = "233--252",
month = feb,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500057",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 10 07:39:25 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500057",
abstract = "The topology properties of multi-processors
interconnection networks are important to the
performance of high performance computers. The
hypercube network $ Q_n $ has been proved to be one of
the most popular interconnection networks. The
$n$-dimensional locally twisted cube $ L T Q_n$ is an
important variant of $ Q_n$. Fault diameter and wide
diameter are two communication performance evaluation
parameters of a network. Let $ D(L T Q_n)$, $ D^f_{n -
1}(L T Q_n)$ and $ D_n(L T Q_n)$ denote the diameter,
the $ n 1$ fault diameter and the wide diameter of $ L
T Q_n$, respectively. In this paper, we prove that $
D^f_{n - 1}(L T Q_n) = D n(L T Q_n) = D(L T Q_n) + 2$
if $n$ is an odd integer with $ n \geq 7$, $ D(L T Q_n)
+ 1 \leq D^f_{n - 1}(L T Q_n) \leq D_n(L T Q_n) \leq
D(L T Q_n) + 2$ if n n n is an even integer with $ n
\geq 8$",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Akutsu:2020:IHM,
author = "Tatsuya Akutsu and Avraham A. Melkman and Takeyuki
Tamura",
title = "Improved Hardness of Maximum Common Subgraph Problems
on Labeled Graphs of Bounded Treewidth and Bounded
Degree",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "2",
pages = "253--273",
month = feb,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500069",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 10 07:39:25 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500069",
abstract = "We consider the maximum common connected edge subgraph
problem and the maximum common connected induced
subgraph problem for simple graphs with labeled
vertices (or labeled edges). The former is to find a
connected graph with the maximum number of edges that
is isomorphic to a subgraph of each of the two input
graphs. The latter is to find a common connected
induced subgraph with the maximum number of vertices.
We prove that both problems are NP-hard for
3-outerplanar labeled graphs even if the maximum vertex
degree is bounded by 4. Since the reductions used in
the proofs construct graphs with treewidth at most 4,
both problems are NP-hard also for such graphs, which
significantly improves the previous hardness results
for graphs with treewidth 11. We also present improved
exponential-time algorithms for both problems on
labeled graphs of bounded treewidth and bounded vertex
degree.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Basappa:2020:CKK,
author = "Manjanna Basappa and Ramesh K. Jallu and Gautam K.
Das",
title = "Constrained $k$-Center Problem on a Convex Polygon",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "2",
pages = "275--291",
month = feb,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500070",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 10 07:39:25 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500070",
abstract = "In this paper, we consider a restricted covering
problem, in which a convex polygon $P$ with $n$
vertices and an integer $k$ are given, the objective is
to cover the entire region of $P$ using $k$ congruent
disks of minimum radius $ r_{\rm opt}$, centered on the
boundary of $P$. For $ k \geq 7$ and any $ \epsilon >
0$, we propose an $ (1 + 7 / k + 7 \epsilon / k +
\epsilon) $-factor approximation algorithm for this
problem, which runs in $ O((n + k)(| \log r_{\rm opt}|
+ \log \lceil 1 \epsilon \rceil))$ time. The best known
approximation factor of the algorithm for the problem
in the literature is 1.8841 [H. Du and Y. Xu: An
approximation algorithm for $k$-center problem on a
convex polygon, J. Comb. Optim. 27(3) (2014)
504--518].",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yang:2020:KEL,
author = "Minghui Yang and Jiejing Wen",
title = "On the $k$-error Linear Complexity of Subsequences of
$d$-ary {Sidel'nikov} Sequences Over Prime Field {$
\mathbb {F}_d$}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "03",
pages = "293--300",
month = apr,
year = "2020",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054120500082",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 5 11:03:35 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500082",
abstract = "We study the $k$-error linear complexity of
subsequences of the $d$-ary Sidel'nikov sequences over
the prime field $ \mathbb {F}_d$. A general lower bound
for the $k$-error linear complexity is given. For
several special periods, we show that these sequences
have large $k$-error linear complexity.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2020:CBS,
author = "Zhongxiao Wang and Xiangyu Wang and Tian Tian",
title = "Constructing {de Bruijn} Sequences Based on a New
Necessary Condition",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "03",
pages = "301--312",
month = apr,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500094",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 5 11:03:35 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500094",
abstract = "In this paper, we propose a new necessary condition
for feedback functions of de Bruijn sequences and
discuss its application in constructing de Bruijn
sequences. It is shown that a large number of de Bruijn
sequences could be easily constructed by precomputing
an n -stage nonlinear feedback shift register (NFSR)
with a special cycle structure --- that is, if a state
$s$ is on a cycle generated by this NFSR, then all the
states with the same Hamming weight as s are also on
this cycle. Moreover, if there are $ s + 1$ different
cycles in the state graph of the precomputed NFSR, then
we can construct \binom{n - 1k_1} \binom{n - 1k_2}
\cdots \binom{n - 1k_s} de Bruijn sequences by the
different choices of conjugate state pairs, where $ 0
\leq k_1 < k_2 < \cdots < k_s \leq n - 1$.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gu:2020:CCH,
author = "Mei-Mei Gu and Jou-Ming Chang and Rong-Xia Hao",
title = "On Component Connectivity of Hierarchical Star
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "03",
pages = "313--326",
month = apr,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500100",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 5 11:03:35 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500100",
abstract = "For an integer $ \ell \geq 2 $, the $ \ell $-component
connectivity of a graph $G$, denoted by $ \kappa \ell
(G)$, is the minimum number of vertices whose removal
from $G$ results in a disconnected graph with at least
$ \ell $ components or a graph with fewer than $ \ell $
vertices. This naturally generalizes the classical
connectivity of graphs defined in term of the minimum
vertex-cut. This kind of connectivity can help us to
measure the robustness of the graph corresponding to a
network. The hierarchical star networks $ H S_n$,
proposed by Shi and Srimani, is a new level
interconnection network topology, and uses the star
graphs as building blocks. In this paper, by exploring
the combinatorial properties and fault-tolerance of $ H
S_n$, we study the $ \ell $-component connectivity of
hierarchical star networks HS_n . We obtain the
results: $ \kappa_3 (H S_n) = 2 n - 2$, $ \kappa_4 (H
S_n) = 3 n - 3$ and $ \kappa_5 (H S_n) = 4 n - 5$ for $
n \geq 5$.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2020:CRL,
author = "Gang Wang and Min-Yao Niu and Fang-Wei Fu",
title = "Constructions of $ (r, t)$-{LRC} Based on Totally
Isotropic Subspaces in Symplectic Space Over Finite
Fields",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "03",
pages = "327--339",
month = apr,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500112",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 5 11:03:35 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500112",
abstract = "Linear code with locality $r$ and availability $t$ is
that the value at each coordinate $i$ can be recovered
from $t$ disjoint repairable sets each containing at
most $r$ other coordinates. This property is
particularly useful for codes in distributed storage
systems because it permits local repair of failed nodes
and parallel access of hot data. In this paper, two
constructions of $ (r, t)$-locally repairable linear
codes based on totally isotropic subspaces in
symplectic space $ \mathbb {F}_q(2 \nu) $ over finite
fields $ \mathbb {F}_q $ are presented. Meanwhile,
comparisons are made among the $ (r, t)$-locally
repairable codes we construct, the direct product code
in Refs. [8], [11] and the codes in Ref. [9] about the
information rate $ k / n$ and relative distance $ d /
n$.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ando:2020:TBU,
author = "Hironori Ando and Satoshi Fujita",
title = "Tight Bounds on the Upload Capacity to Enable Two-Hop
Delivery in Peer-to-Peer Video Streaming Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "03",
pages = "341--354",
month = apr,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500124",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 5 11:03:35 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500124",
abstract = "In multi-tree-structured Peer-to-Peer (P2P) video
streaming, video streams are delivered from the source
peer to subscribing peers in such a way that each
stream is divided into several sub-streams and those
sub-streams are delivered through different spanning
trees. In this paper, we focus on the delivery of all
sub-streams to $n$ subscribers through spanning trees
of depth two each, which will be referred to as the
2-hop delivery of sub-streams. The main contribution of
the current paper is the derivation of a tight lower
bound on the upload capacity of homogeneous peers so
that 2-hop delivery is possible if and only if the
upload capacity of each peer is greater than or equal
to the derived bound.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chen:2020:SAS,
author = "Ke Chen and Adrian Dumitrescu",
title = "Selection Algorithms with Small Groups",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "03",
pages = "355--369",
month = apr,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500136",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 5 11:03:35 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500136",
abstract = "We revisit the selection problem, namely that of
computing the $i$ th order statistic of $n$ given
elements, in particular the classic deterministic
algorithm by grouping and partition due to Blum, Floyd,
Pratt, Rivest, and Tarjan (1973). Whereas the original
algorithm uses groups of odd size at least 5 and runs
in linear time, it has been perpetuated in the
literature that using smaller group sizes will force
the worst-case running time to become superlinear,
namely $ \Omega (n \log n) $. We first point out that
the usual arguments found in the literature justifying
the superlinear worst-case running time fall short of
proving this claim. We further prove that it is
possible to use group size smaller than 5 while
maintaining the worst case linear running time. To this
end we introduce three simple variants of the classic
algorithm, the repeated step algorithm, the shifting
target algorithm, and the hyperpair algorithm, all
running in linear time.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2020:UMM,
author = "Jing Li and Chris Melekian and Shurong Zuo and Eddie
Cheng",
title = "Unpaired Many-to-Many Disjoint Path Covers on
Bipartite $k$-Ary $n$-Cube Networks with Faulty
Elements",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "03",
pages = "371--383",
month = apr,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500148",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 5 11:03:35 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500148",
abstract = "The $k$-ary $n$-cube network is known as one of the
most attractive interconnection networks for parallel
and distributed systems. A many-to-many $m$-disjoint
path cover ($m$-DPC for short) of a graph is a set of
$m$ vertex-disjoint paths joining two disjoint vertex
sets $S$ and $T$ of equal size $m$ that altogether
cover every vertex of the graph. The many-to-many
$m$-DPC is classified as paired if each source in $S$
is further required to be paired with a specific sink
in $T$, or unpaired otherwise. In this paper, we
consider the unpaired many-to-many $m$-DPC problem of
faulty bipartite $k$-ary $n$ cube networks $ Q_n^k$,
where the sets $S$ and $T$ are chosen in different
parts of the bipartition. We show that, every bipartite
$ Q_n^k$, under the condition that $f$ or less faulty
edges are removed, has an unpaired many-to-many $m$ DPC
for any $f$ and $ m \geq 1$ subject to $ f + m \leq 2 n
- 1$. The bound $ 2 n - 1$ is tight here.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mandal:2020:CTT,
author = "Subhrangsu Mandal and Arobinda Gupta",
title = "Convergecast Tree on Temporal Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "03",
pages = "385--409",
month = apr,
year = "2020",
DOI = "https://doi.org/10.1142/S012905412050015X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 5 11:03:35 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412050015X",
abstract = "Temporal graphs are useful tools to model dynamic
network topologies found in many applications. In this
paper, we address the problem of constructing a
convergecast tree on temporal graphs for data
collection in dynamic sensor networks. Two types of
convergecast trees, bounded arrival time convergecast
tree and minimum total arrival time convergecast tree
are defined as useful structures for low delay data
collection. An $ O(\mathcal {J} (n + m)) $ time
centralized algorithm is proposed to construct a
bounded arrival time convergecast tree, where $n$ is
the number of nodes, $m$ is the number of edges, and $
\mathcal {J}$ is the lifetime of the given temporal
graph. The algorithm presented is an offline algorithm
and assumes that all information about change in the
graph topology is known apriori. It is then shown that
the problem of constructing a minimum total arrival
time convergecast tree is NP-complete, and an $
O(\mathcal {J} (n + m))$ time centralized, offline
heuristic algorithm is proposed to address it. The
heuristic algorithm is evaluated with experiments on
four real life data sets.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kuroda:2020:MGA,
author = "Masamichi Kuroda",
title = "Monomial Generalized Almost Perfect Nonlinear
Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "03",
pages = "411--419",
month = apr,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500161",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue May 5 11:03:35 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500161",
abstract = "Generalized almost perfect nonlinear (GAPN) functions
were defined to satisfy some generalizations of basic
properties of almost perfect nonlinear (APN) functions
for even characteristic. In particular, on finite
fields of even characteristic, GAPN functions coincide
with APN functions. In this paper, we study monomial
GAPN functions for odd characteristic. We give monomial
GAPN functions whose algebraic degree are maximum or
minimum on a finite field of odd characteristic.
Moreover, we define a generalization of exceptional APN
functions and give typical examples.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sadhu:2020:EAC,
author = "Sanjib Sadhu and Sasanka Roy and Soumen Nandi and
Subhas C. Nandy and Suchismita Roy",
title = "Efficient Algorithm for Computing the Triangle
Maximizing the Length of Its Smallest Side Inside a
Convex Polygon",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "04",
pages = "421--443",
month = jun,
year = "2020",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054120500173",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 10 12:04:24 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500173",
abstract = "Given a convex polygon with n vertices, we study the
problem of identifying a triangle with its smallest
side as large as possible among all the triangles that
can be drawn inside the polygon. We show that at least
one of the vertices of such a triangle must coincide
with a vertex of the polygon. We also propose an O(n2)
time algorithm to compute such a triangle inside the
given convex polygon.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2020:ECD,
author = "Shunzhe Zhang and Dong Li and Huiqing Liu",
title = "On $g$-Extra Conditional Diagnosability of Twisted
Hypercubes under {MM}$^\star $ Model",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "04",
pages = "445--459",
month = jun,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500185",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 10 12:04:24 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500185",
abstract = "Connectivity and diagnosability are important
parameters in measuring the reliability and
fault-tolerance of an interconnection network $G$ . The
$g$-extra conditional faulty set $F$ is a faulty vertex
set such that every component of $ G - F$ has at least
$ g + 1$ vertices. The $g$-extra connectivity $ \kappa
g(G)$ of a connected graph $G$ is the minimum
cardinality of a $g$-extra conditional faulty set $F$
of $G$ such that $ G - F$ is disconnected. The $g$
extra conditional diagnosability $ t_g(G)$ of a graph
$G$ is the maximum value of $t$ such that $G$ is
$g$-extra conditionally $t$-diagnosable. The $g$-extra
connectivity of $G$ is necessary for $g$-extra
diagnosability of $G$. The $n$-dimensional twisted
hypercube $ H_n$ is a new variant of hypercubes with
asymptotically optimal diameter. In this paper, we
first give the $g$-extra connectivity of $ H_n$ for $ n
\geq 4$ and $ 0 \leq g \leq n - 3$; and then obtain the
$g$-extra conditional diagnosability of $ H_n$ for $ n
\geq 5$ and $ 0 \leq g \leq (n - 1) / 4$ under the
MM$^\star $ model.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Hittmeir:2020:RIF,
author = "Markus Hittmeir",
title = "A Reduction of Integer Factorization to Modular
Tetration",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "04",
pages = "461--481",
month = jun,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500197",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 10 12:04:24 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500197",
abstract = "Let $ a, k \in \mathbb {N} $. By $^1 a := a$ and $^k a
:= a^{k - 1_a}$, we denote the $k$ th iterate of the
exponential function $ x \mapto a^x$ evaluated at $a$,
also known as tetration. We demonstrate how an
algorithm for evaluating tetration modulo natural
numbers $N$ could be used to compute the prime
factorization of $N$ and provide heuristic arguments
for the efficiency of this reduction. Additionally, we
prove that the problem of computing the squarefree part
of integers is deterministically polynomial-time
reducible to modular tetration.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cevik:2020:PCC,
author = "Ahmet {\c{C}}evik",
title = "Palindromic Characteristic of Committed Graphs and
Some Model Theoretic Properties",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "04",
pages = "483--498",
month = jun,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500203",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 10 12:04:24 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500203",
abstract = "We bring into attention the interplay between model
theory of committed graphs (1-regular graphs) and their
palindromic characteristic in the domain of formal
languages. We prove some model theoretic properties of
committed graphs and then give a characterization of
them in the formal language domain using palindromes.
We show in the first part of the paper that the theory
of committed graphs and the theory of infinite
committed graphs differ in terms of completeness. We
give the observation that theories of finite and
infinite committed graphs are both decidable. The
former is finitely axiomatizable, whereas the latter is
not. We note that every committed graph is isomorphic
to the structure of integers. In the second part, as
our main focus of the paper and using some of the
results in the first section, we give a
characterization of committed graphs based on the
notion of finite and infinite palindrome strings.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2020:SBF,
author = "Shanding Xu and Xiwang Cao and Jiafu Mi and Chunming
Tang",
title = "Simplified Bounds on {FHSs} Set and Its Strictly
Optimal Construction",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "04",
pages = "499--513",
month = jun,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500215",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 10 12:04:24 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500215",
abstract = "Frequency-hopping sequences (FHSs) with favorite
partial Hamming correlation properties are intensively
needed in many synchronization and multiple-access
systems. Strictly optimal FHS sets are a kind of FHS
sets which has optimal Hamming correlation for any
correlation window. In this paper, firstly we present
simplified representations of the generalized
Lempel--Greenberger bound on the partial Hamming
autocorrelation of an FHS and the generalized Peng-Fan
bound on the partial Hamming correlation of an FHS set,
respectively. Secondly, we propose a direct
construction of strictly optimal FHS sets, which
interprets the previous construction proposed by Cai,
Zhou, Yang and Tang. By choosing appropriate parameters
and bijections, we present more flexible constructions
of strictly optimal FHS sets.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Nagy:2020:MPP,
author = "Benedek Nagy",
title = "On the Membership Problem of Permutation Grammars ---
A Direct Proof of {NP}-Completeness",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "04",
pages = "515--525",
month = jun,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500227",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 10 12:04:24 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500227",
abstract = "One of the most essential classes of problems related
to formal languages is the membership problem (also
called word problem), i.e., to decide whether a given
input word belongs to the language specified, e.g., by
a generative grammar. For context-free languages the
problem is solved efficiently by various well-known
parsing algorithms. However, there are several
important languages that are not context-free. The
membership problem of the context-sensitive language
class is PSPACE-complete, thus, it is believed that it
is generally not solvable in an efficient way. There
are various language classes between the above
mentioned two classes having membership problems with
various complexity. One of these classes, the class of
permutation languages, is generated by permutation
grammars, i.e., context-free grammars extended with
permutation rules, where a permutation rule allows to
interchange the position of two consecutive
nonterminals in the sentential form. In this paper, the
membership problem for permutation languages is
studied. A proof is presented to show that this problem
is NP-complete.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Madejski:2020:MPT,
author = "Grzegorz Madejski and Andrzej Szepietowski",
title = "Membership Problem for Two-Dimensional General Row
Jumping Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "04",
pages = "527--538",
month = jun,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500239",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jul 10 12:04:24 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500239",
abstract = "Two-dimensional general row jumping finite automata
were recently introduced as an interesting
computational model for accepting two-dimensional
languages. These automata are nondeterministic. They
guess an order in which rows of the input array are
read and they jump to the next row only after reading
all symbols in the previous row. In each row, they
choose, also nondeterministically, an order in which
segments of the row are read. In this paper, we study
the membership problem for these automata. We show that
each general row jumping finite automaton can be
simulated by a nondeterministic Turing machine with
space bounded by the logarithm. This means that the
fixed membership problems for such automata are in NL,
and so in P. On the other hand, we show that the
uniform membership problem is NP-complete.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kosmatopoulos:2020:SOH,
author = "Andreas Kosmatopoulos and Athanasios Tsakalidis and
Kostas Tsichlas",
title = "A Space-Optimal Hidden Surface Removal Algorithm for
Iso-Oriented Rectangles",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "05",
pages = "539--549",
month = aug,
year = "2020",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054120500240",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sun Sep 13 09:54:18 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500240",
abstract = "We investigate the problem of finding the visible
pieces of a scene of objects from a specified
viewpoint. In particular, we are interested in the
design of an efficient hidden surface removal algorithm
for a scene comprised of iso-oriented rectangles. We
propose an algorithm where given a set of n
iso-oriented rectangles we report all visible surfaces
in O((n + k)log n) time and linear space, where k is
the number of surfaces reported. The previous best
result by Bern [Journal of Computer and System Sciences
40 (1990) 49--69], has the same time complexity but
uses O(nlog n) space.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2020:MUD,
author = "Juyan Li and Chunguang Ma and Zhen Gu",
title = "Multi-use Deterministic Public Key Proxy Re-Encryption
from Lattices in the Auxiliary-Input Setting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "05",
pages = "551--567",
month = aug,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500252",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sun Sep 13 09:54:18 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500252",
abstract = "Proxy Re-Encryption (PRE) is a cryptographic primitive
that allows a proxy to turn an Alice's ciphertext into
a Bob's ciphertext on the same plaintext. All of the
PRE schemes are public key encryption and semantic
security. Deterministic Public Key Encryption (D-PKE)
provides an alternative to randomized public key
encryption in various scenarios where the latter
exhibits inherent drawbacks. In this paper, we
construct the first multi-use unidirectional D-PRE
scheme from Lattices in the auxiliary-input setting. We
also prove that it is PRIV1-INDr secure in the standard
model based on the LWR. Finally, an identity-based
D-PRE is obtained from the basic construction.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2020:LCB,
author = "Lianhua Wang and Xiaoni Du",
title = "Linear Complexity of Binary Threshold Sequences
Derived from Generalized Polynomial Quotient with
Prime-Power Modulus",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "05",
pages = "569--581",
month = aug,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500264",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sun Sep 13 09:54:18 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500264",
abstract = "In this paper, firstly we extend the polynomial
quotient modulo an odd prime p to its general case with
modulo pr and r {\textgreaterequal} 1 . From the new
quotient proposed, we define a class of pr+1 -periodic
binary threshold sequences. Then combining the Legendre
symbol and Euler quotient modulo pr together, with the
condition of 2p{\textminus}1{\^a} cents 1(modp2), we
present exact values of the linear complexity for p
{\textequivalence}{\textpm}3(mod 8), and all the
possible values of the linear complexity for p
{\textequivalence}{\textpm}1(mod 8) . The linear
complexity is very close to the period and is of
desired value for cryptographic purpose. Our results
extend the linear complexity results of the
corresponding p2 -periodic binary sequences in earlier
work.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alirezazadeh:2020:WSP,
author = "Saeid Alirezazadeh and Khadijeh Alibabaei",
title = "Weak Separation Problem for Tree Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "05",
pages = "583--593",
month = aug,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500276",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sun Sep 13 09:54:18 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500276",
abstract = "Forest algebras are defined for investigating
languages of forests [ordered sequences] of unranked
trees, where a node may have more than two [ordered]
successors. They consist of two monoids, the horizontal
and the vertical, with an action of the vertical monoid
on the horizontal monoid, and a complementary axiom of
faithfulness. A pseudovariety is a class of finite
algebras of a given signature, closed under the taking
of homomorphic images, subalgebras and finitary direct
products. By looking at the syntactic congruence for
monoids and as the natural extension in the case of
forest algebras, we could define a version of syntactic
congruence of a subset of the free forest algebra, not
just a forest language. Let A be a finite alphabet and
V be a pseudovariety of finite forest algebras. A
language L is V -recognizable if its syntactic forest
algebra belongs to V . Separation is a classical
problem in mathematics and computer science. It asks
whether, given two sets belonging to some class, it is
possible to separate them by another set of a smaller
class. Suppose that a forest language L and a forest w
are given. We want to find if there exists any proof
for that w does not belong to L just by using V
-recognizable languages, i.e. given such L and w, if
there exists a V -recognizable language K which
contains L and does not contain w . In this paper, we
present how one can use profinite forest algebra to
separate a forest language and a forest term and also
to separate two forest languages.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Alamro:2020:EIC,
author = "Hayam Alamro and Mai Alzamel and Costas S. Iliopoulos
and Solon P. Pissis and Wing-Kin Sung and Steven
Watts",
title = "Efficient Identification of $k$-Closed Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "05",
pages = "595--610",
month = aug,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500288",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sun Sep 13 09:54:18 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500288",
abstract = "A closed string contains a proper factor occurring as
both a prefix and a suffix but not elsewhere in the
string. Closed strings were introduced by Fici (WORDS
2011) as objects of combinatorial interest. This paper
addresses a new problem by extending the closed string
problem to the k -closed string problem, for which a
level of approximation is permitted up to a number of
Hamming distance errors, set by the parameter k . We
address the problem of deciding whether or not a given
string of length n over an integer alphabet is k
-closed and additionally specifying the border
resulting in the string being k -closed. Specifically,
we present an {$ \mathcal {O} $}(kn) -time and {$
\mathcal {O} $}(n) -space algorithm to achieve this
along with the pseudocode of an implementation and
proof-of-concept experimental results.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Farhadian:2020:AEV,
author = "Ameneh Farhadian",
title = "Almost Every $n$-Vertex Graph is Determined by Its $ 3
\log_2 n$-Vertex Subgraphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "05",
pages = "611--619",
month = aug,
year = "2020",
DOI = "https://doi.org/10.1142/S012905412050029X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sun Sep 13 09:54:18 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412050029X",
abstract = "This paper proves that almost every n -vertex graph
has the property that the multiset of its induced
subgraphs on 3log2n vertices is sufficient to determine
it up to isomorphism. That is, the probability that
there exists two n -vertex graphs with the same
multiset of 3log2n -vertex induced subgraphs goes to
zero as n goes to infinity.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chern:2020:NSP,
author = "Zi Jing Chern and K. G. Subramanian and Azhana Ahmad
and Wen Chean Teh",
title = "A New Study of {Parikh} Matrices Restricted to Terms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "05",
pages = "621--638",
month = aug,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500306",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sun Sep 13 09:54:18 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500306",
abstract = "Parikh matrices as an extension of Parikh vectors are
useful tools in arithmetizing words by numbers. This
paper presents a further study of Parikh matrices by
restricting the corresponding words to terms formed
over a signature. Some M -equivalence preserving
rewriting rules for such terms are introduced. A
characterization of terms that are only M -equivalent
to themselves is studied for binary signatures. Graphs
associated to the equivalence classes of M -equivalent
terms are studied with respect to graph distance.
Finally, the preservation of M -equivalence under the
term self-shuffle operator is studied.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Egecioglu:2020:KFC,
author = "{\"O}mer E{\u{g}}ecio{\u{g}}lu and Elif Sayg{\i} and
Z{\"u}lf{\"u}kar Sayg{\i}",
title = "$k$-{Fibonacci} Cubes: A Family of Subgraphs of
{Fibonacci} Cubes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "05",
pages = "639--661",
month = aug,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500318",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sun Sep 13 09:54:18 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500318",
abstract = "Hypercubes and Fibonacci cubes are classical models
for interconnection networks with interesting graph
theoretic properties. We consider k -Fibonacci cubes,
which we obtain as subgraphs of Fibonacci cubes by
eliminating certain edges during the fundamental
recursion phase of their construction. These graphs
have the same number of vertices as Fibonacci cubes,
but their edge sets are determined by a parameter k .
We obtain properties of k -Fibonacci cubes including
the number of edges, the average degree of a vertex,
the degree sequence and the number of hypercubes they
contain.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Seki:2020:SID,
author = "Shinnosuke Seki",
title = "Special Issue Developments in Language Theory 2018 ---
Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "06",
pages = "663--665",
month = sep,
year = "2020",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054120020025",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:33 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120020025",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2018",
}
@Article{Bell:2020:ANT,
author = "Jason Bell and Thomas F. Lidbetter and Jeffrey
Shallit",
title = "Additive Number Theory via Approximation by Regular
Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "06",
pages = "667--687",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120410014",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:33 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120410014",
abstract = "We prove some new theorems in additive number theory,
using novel techniques from automata theory and formal
languages. As an example of our method, we prove that
every natural number {$>$} 25 is the sum of at most
three natural numbers whose base- 2 representation has
an equal number of 0 's and 1 's.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2018",
}
@Article{Almagor:2020:WCR,
author = "Shaull Almagor and Micha{\"e}l Cadilhac and Filip
Mazowiecki and Guillermo A. P{\'e}rez",
title = "Weak Cost Register Automata are Still Powerful",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "06",
pages = "689--709",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120410026",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:33 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120410026",
abstract = "We consider one of the weakest variants of cost
register automata over a tropical semiring, namely
copyless cost register automata over {$ \mathbb {N} $}
with updates using min and increments. We show that
this model can simulate, in some sense, the runs of
counter machines with zero-tests. We deduce that a
number of problems pertaining to that model are
undecidable, namely equivalence, upperboundedness, and
semilinearity. In particular, the undecidability of
equivalence disproves a conjecture of Alur et al. from
2012. To emphasize how weak these machines are, we also
show that they can be expressed as a restricted form of
linearly-ambiguous weighted automata.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2018",
}
@Article{Filiot:2020:PLA,
author = "Emmanuel Filiot and Nicolas Mazzocchi and
Jean-Fran{\c{c}}ois Raskin",
title = "A Pattern Logic for Automata with Outputs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "06",
pages = "711--748",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120410038",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:33 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120410038",
abstract = "We introduce a logic to express structural properties
of automata with string inputs and, possibly, outputs
in some monoid. In this logic, the set of predicates
talking about the output values is parametric. We then
consider three particular automata models (finite
automata, transducers and automata weighted by integers
here called sum-automata) and instantiate the generic
logic for each of them. We give tight complexity
results for the three logics with respect to the
model-checking problem, depending on whether the
formula is fixed or not. We study the expressiveness of
our logics by expressing classical structural patterns
characterising for instance finite ambiguity and
polynomial ambiguity in the case of finite automata,
determinisability and finite-valuedness in the case of
transducers and sum-automata. As a consequence of our
complexity results, we directly obtain that these
classical properties can be decided in polynomial
time.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2018",
}
@Article{Landwehr:2020:PBT,
author = "Patrick Landwehr and Christof L{\"o}ding",
title = "Projection for {B{\"u}chi} Tree Automata with
Constraints between Siblings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "06",
pages = "749--775",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S012905412041004X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:33 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412041004X",
abstract = "We consider an extension of tree automata on infinite
trees that can use equality and disequality constraints
between direct subtrees of a node. Recently, it has
been shown that the emptiness problem for these kind of
automata with a parity acceptance condition is
decidable and that the corresponding class of languages
is closed under Boolean operations. In this paper, we
show that the class of languages recognizable by such
tree automata with a B{\"u}chi acceptance condition is
closed under projection. This construction yields a new
algorithm for the emptiness problem, implies that a
regular tree is accepted if the language is non-empty
(for the B{\"u}chi condition), and can be used to
obtain a decision procedure for an extension of monadic
second-order logic with predicates for subtree
comparisons.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2018",
}
@Article{Catalano:2020:SPF,
author = "Costanza Catalano and Rapha{\"e}l M. Jungers",
title = "The Synchronizing Probability Function for Primitive
Sets of Matrices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "06",
pages = "777--803",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120410051",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:33 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120410051",
abstract = "Motivated by recent results relating synchronizing
DFAs and primitive sets, we tackle the synchronization
process and the related longstanding {\v{C}}ern{\'y}
conjecture by studying the primitivity phenomenon for
sets of nonnegative matrices having neither zero-rows
nor zero-columns. We formulate the primitivity process
in the setting of a two-player probabilistic game and
we make use of convex optimization techniques to
describe its behavior. We develop a tool for
approximating and upper bounding the exponent of any
primitive set and supported by numerical results we
state a conjecture that, if true, would imply a
quadratic upper bound on the reset threshold of a new
class of automata.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2018",
}
@Article{Beier:2020:DRO,
author = "Simon Beier and Markus Holzer",
title = "Decidability of Right One-Way Jumping Finite
Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "06",
pages = "805--825",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120410063",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:33 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120410063",
abstract = "We continue our investigation [S. Beier, M. Holzer:
Properties of right one-way jumping finite automata. In
Proc. 20th DCFS, LNCS, 2018] on (right) one-way jumping
finite automata (ROWJFAs), a variant of jumping
automata, which is an automaton model for discontinuous
information processing. Here we focus on decision
problems for ROWJFAs. It turns out that most problems
such as, e.g., emptiness, finiteness, universality, the
word problem and variants thereof, closure under
permutation, etc., are decidable. Moreover, we show
that the containment of a language within the strict
hierarchy of ROWJFA permutation closed languages
induced by the number of accepting states as well as
whether permutation closed regular or jumping finite
automata languages can be accepted by ROWJFAs is
decidable, too. On the other hand, we prove that for
(linear) context-free languages the corresponding
ROWJFA acceptance problem becomes undecidable.
Moreover, we discuss also some complexity results for
the considered decision problems.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2018",
}
@Article{Fleischer:2020:IPF,
author = "Lukas Fleischer",
title = "The Intersection Problem for Finite Semigroups",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "06",
pages = "827--842",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120410075",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:33 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120410075",
abstract = "The intersection problem for finite semigroups asks,
given a set of regular languages, represented by
recognizing morphisms to finite semigroups, whether
there exists a word contained in their intersection. In
previous work, it was shown that is problem is PSPACE
-complete. We introduce compressibility measures as a
useful tool to classify the complexity of the
intersection problem for certain classes of finite
semigroups. Using this framework, we obtain a new and
simple proof that for groups and for commutative
semigroups, the problem (as well as the variant where
the languages are represented by finite automata) is
contained in NP . We uncover certain structural and
non-structural properties determining the complexity of
the intersection problem for varieties of semigroups
containing only trivial submonoids. More specifically,
we prove NP -hardness for classes of semigroups having
a property called unbounded order and for the class of
all nilpotent semigroups of bounded order. On the
contrary, we show that bounded order and commutativity
imply decidability in poly-logarithmic time on
alternating random-access Turing machines with a single
alternation. We also establish connections to the
monoid variant of the problem.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2018",
}
@Article{Baudru:2020:TWT,
author = "Nicolas Baudru and Pierre-Alain Reynier",
title = "From Two-Way Transducers to Regular Function
Expressions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "06",
pages = "843--873",
month = sep,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120410087",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:33 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120410087",
abstract = "Transducers constitute a fundamental extension of
automata. The class of regular word functions has
recently emerged as an important class of word-to-word
functions, characterized by means of (functional, or
unambiguous, or deterministic) two-way transducers,
copyless streaming string transducers, and
MSO-definable graph transformations. A fundamental
result in language theory is Kleene's Theorem, relating
finite state automata and regular expressions.
Recently, a set of regular function expressions has
been introduced and used to prove a similar result for
regular word functions, by showing its equivalence with
copyless streaming string transducers. In this paper,
we propose a direct, simplified and effective
translation from unambiguous two-way transducers to
regular function expressions extending the Brzozowski
and McCluskey algorithm. In addition, our approach
allows us to derive a subset of regular function
expressions characterizing the (strict) subclass of
functional sweeping transducers.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2018",
}
@Article{Shi:2020:NCC,
author = "Zexia Shi and Lei Sun and Fang-Wei Fu",
title = "New Constructions of Codebooks Nearly Meeting the
{Welch} Bound",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "07",
pages = "875--889",
month = nov,
year = "2020",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905412050032X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:34 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412050032X",
abstract = "Optimal codebooks meeting the Welch bound with
equality are desirable in many areas, such as direct
spread code division multiple access communications,
compressed sensing and so on. However, it is difficult
to construct such optimal codebooks. There have been a
number of attempts to construct codebooks nearly
meeting the Welch bound. In this paper, we introduce a
generic construction of codebooks using generalized
bent functions from {$ \mathbb {F} $ pn} to {$ \mathbb
{Z} $ pk}, where p is a prime and k is a positive
integer with 1 {$<$} k {\textlessequal} n/2 . With this
construction, we obtain two new families of codebooks
nearly meeting the Welch bound. These codebooks have
new parameters and could have a small alphabet size. In
particular, a class of regular generalized bent
functions from {$ \mathbb {F} $ pn} to {$ \mathbb {Z} $
pk} is presented.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mahalingam:2020:WCJ,
author = "Kalpana Mahalingam and Ujjwal Kumar Mishra and Rama
Raghavan",
title = "{Watson--Crick} Jumping Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "07",
pages = "891--913",
month = nov,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500331",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:34 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500331",
abstract = "Watson--Crick jumping finite automata work on tapes
which are double stranded sequences of symbols similar
to that of Watson--Crick automata. The double stranded
sequence is scanned in a discontinuous manner. That is,
after reading a double stranded string, the automata
can jump over some subsequence and continue scanning
depending on the rule. Some variants of such automata
are 1-limited, No state, All final and Simple
Watson--Crick jumping finite automata. The comparison
of the languages accepted by these variants with the
language classes in Chomsky hierarchy has been carried
out. We investigate some closure properties. We also
try to place the duplication closure of a word in
Watson--Crick jumping finite automata family. We have
discussed the closure property of Watson--Crick jumping
finite automata family under duplication operations.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jonoska:2020:SSD,
author = "Nata{\v{s}}a Jonoska and Masahico Saito and Hwee Kim
and Brad Mostowski",
title = "Symbol Separation in Double Occurrence Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "07",
pages = "915--928",
month = nov,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500343",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:34 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500343",
abstract = "A double occurrence word (DOW) is a word in which
every symbol appears exactly twice. We define the
symbol separation of a DOW w to be the number of
letters between the two copies of a symbol, and the
separation of w to be the sum of separations over all
symbols in w . We then analyze relationship among size,
reducibility and separation of DOWs. Specifically, we
provide tight bounds of separations of DOWs with a
given size and characterize the words that attain those
bounds. We show that all separation numbers within the
bounds can be realized. We present recursive formulas
for counting the numbers of DOWs with a given
separation under various restrictions, such as the
number of irreducible factors. These formulas can be
obtained by inductive construction of all DOWs with the
given separation.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ding:2020:NID,
author = "Tongtong Ding and Min Xu and Qiang Zhu",
title = "The Non-inclusive Diagnosability of Hypercubes under
the {MM*} Model",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "07",
pages = "929--940",
month = nov,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500355",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:34 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500355",
abstract = "Diagnosability is an important factor in
multiple-processor systems defined as the maximum
number of faulty nodes that a system can recognize. In
this paper, we propose a new form of diagnosability
called non-inclusive diagnosability that requires all
faulty sets to be non-inclusive. Furthermore, we study
the non-inclusive diagnosability of hypercubes under
the MM* model for n {\textgreaterequal} 1 .",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Saikia:2020:DAA,
author = "Parikshit Saikia and Sushanta Karmakar",
title = "Distributed Approximation Algorithms for {Steiner}
Tree in the {CONGESTED CLIQUE}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "07",
pages = "941--968",
month = nov,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500367",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:34 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500367",
abstract = "The Steiner tree problem is one of the fundamental and
classical problems in combinatorial optimization. In
this paper we study this problem in the CONGESTED
CLIQUE model (CCM) [29] of distributed computing. For
the Steiner tree problem in the CCM, we consider that
each vertex of the input graph is uniquely mapped to a
processor and edges are naturally mapped to the links
between the corresponding processors. Regarding output,
each processor should know whether the vertex assigned
to it is in the solution or not and which of its
incident edges are in the solution. We present two
deterministic distributed approximation algorithms for
the Steiner tree problem in the CCM. The first
algorithm computes a Steiner tree using {\~O}(n1/3)
rounds and {\~O}(n7/3) messages for a given connected
undirected weighted graph of n nodes. Note here that
{\~O}({\^a} ) notation hides polylogarithmic factors in
n . The second one computes a Steiner tree using O(S
+loglog n) rounds and O(Sm + n2) messages, where S and
m are the shortest path diameter and number of edges
respectively in the given input graph. Both the
algorithms achieve an approximation ratio of 2(1
{\textminus} 1/{\ell}), where {\ell} is the number of
leaf nodes in the optimal Steiner tree. For graphs with
S = {\textomega}(n1/3log n), the first algorithm
exhibits better performance than the second one in
terms of the round complexity. On the other hand, for
graphs with S = {\~o}(n1/3), the second algorithm
outperforms the first one in terms of the round
complexity. In fact when S = O(loglog n) then the
second algorithm achieves a round complexity of
O(loglog n) and message complexity of {\~O}(n2) . To
the best of our knowledge, this is the first work to
study the Steiner tree problem in the CCM.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kunt:2020:EIN,
author = "Aysun Asena Kunt and Zeynep Nihan Berberler",
title = "Efficient Identification of Node Importance Based on
Agglomeration in Cycle-Related Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "07",
pages = "969--978",
month = nov,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120500379",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 17 19:26:34 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120500379",
abstract = "The identification of node importance in complex
networks is of theoretical and practical significance
for improving network robustness and invulnerability.
In this paper, the importance of each node is evaluated
and important nodes are identified in cycles and
related networks by node contraction method based on
network agglomeration. This novel method considers both
the degree and the position of the node for the
identifying the importance of the node. The
effectiveness and the feasibility of this method was
also validated through experiments on different types
of complex networks.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Campeanu:2020:IAA,
author = "Cezar C{\^a}mpeanu",
title = "Implementations and Applications of {Automata 2018}:
Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "08",
pages = "979--982",
month = dec,
year = "2020",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054120020037",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 21 07:02:13 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120020037",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Implementations and Applications of
Automata (CIAA 2018)",
}
@Article{Konstantinidis:2020:RET,
author = "Stavros Konstantinidis and Nelma Moreira and
Rog{\'e}rio Reis and Joshua Young",
title = "Regular Expressions and Transducers Over
Alphabet-Invariant and User-Defined Labels",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "08",
pages = "983--1019",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120420010",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 21 07:02:13 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120420010",
abstract = "We are interested in regular expressions and
transducers that represent word relations in an
alphabet-invariant way --- for example, the set of all
word pairs u,v where v is a prefix of u independently
of what the alphabet is. Current software systems of
formal language objects do not have a mechanism to
define such objects. We define transducers in which
transition labels involve what we call set
specifications, some of which are alphabet invariant.
In fact, we give a more broad definition of
automata-type objects, called labelled graphs, where
each transition label can be any string, as long as
that string represents a subset of a certain monoid.
Then, the behavior of the labelled graph is a subset of
that monoid. We do the same for regular expressions. We
obtain extensions of a few classic algorithmic
constructions on ordinary regular expressions and
transducers at the broad level of labelled graphs and
in such a way that the computational efficiency of the
extended constructions is not sacrificed. For
transducers with set specs we obtain further algorithms
that can be applied to questions about independent
regular languages as well as a decision question about
synchronous transducers.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Implementations and Applications of
Automata (CIAA 2018)",
}
@Article{Axelsen:2020:BRP,
author = "Holger Bock Axelsen and Martin Kutrib and Andreas
Malcher and Matthias Wendlandt",
title = "Boosting Reversible Pushdown and Queue Machines by
Preprocessing",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "08",
pages = "1021--1049",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120420022",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 21 07:02:13 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120420022",
abstract = "It is well known that reversible finite automata do
not accept all regular languages, that reversible
pushdown automata do not accept all deterministic
context-free languages, and that reversible queue
automata are less powerful than deterministic real-time
queue automata. It is of significant interest from both
a practical and theoretical point of view to close
these gaps. We here extend these reversible models by a
preprocessing unit which is basically a reversible
injective and length-preserving finite state
transducer. It turns out that preprocessing the input
using such weak devices increases the computational
power of reversible deterministic finite automata to
the acceptance of all regular languages, whereas for
reversible pushdown automata the accepted family of
languages lies strictly in between the reversible
deterministic context-free languages and the real-time
deterministic context-free languages. For reversible
queue automata the preprocessing of the input leads to
machines that are stronger than real-time reversible
queue automata, but less powerful than real-time
deterministic (irreversible) queue automata. Moreover,
it is shown that the computational power of all three
types of machines is not changed by allowing the
preprocessing finite state transducer to work
irreversibly. Finally, we examine the closure
properties of the family of languages accepted by such
machines.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Implementations and Applications of
Automata (CIAA 2018)",
}
@Article{Attou:2020:BPT,
author = "Samira Attou and Ludovic Mignot and Djelloul Ziadi",
title = "The Bottom-Up Position Tree Automaton and the Father
Automaton",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "08",
pages = "1051--1068",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120420034",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 21 07:02:13 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120420034",
abstract = "The conversion of a given regular tree expression into
a tree automaton has been widely studied. However,
classical interpretations are based upon a top-down
interpretation of tree automata. In this paper, we
propose new constructions based on Gluskov's one and on
the one by Ilie and Yu using a bottom-up
interpretation. One of the main goals of this technique
is to consider as a next step the links with
deterministic recognizers, something which cannot be
done with classical top-down approaches.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Implementations and Applications of
Automata (CIAA 2018)",
}
@Article{Bartholdi:2020:NHA,
author = "Laurent Bartholdi and Thibault Godin and Ines Klimann
and Camille No{\^u}s and Matthieu Picantin",
title = "A New Hierarchy for Automaton Semigroups",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "08",
pages = "1069--1089",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120420046",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 21 07:02:13 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120420046",
abstract = "We define a new strict and computable hierarchy for
the family of automaton semigroups, which reflects the
various asymptotic behaviors of the state-activity
growth. This hierarchy extends that given by Sidki for
automaton groups, and also gives new insights into the
latter. Its exponential part coincides with a notion of
entropy for some associated automata. We prove that the
Order Problem is decidable whenever the state-activity
is bounded. The Order Problem remains open for the next
level of this hierarchy, that is, when the
state-activity is linear. Gillibert showed that it is
undecidable in the whole family. We extend the
aforementioned hierarchy via a semi-norm making it more
coarse but somehow more robust and we prove that the
Order Problem is still decidable for the first two
levels of this alternative hierarchy.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Implementations and Applications of
Automata (CIAA 2018)",
}
@Article{Berlinkov:2020:SAG,
author = "Mikhail V. Berlinkov and Cyril Nicaud",
title = "Synchronizing Almost-Group Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "08",
pages = "1091--1112",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120420058",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 21 07:02:13 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120420058",
abstract = "In this paper we address the question of synchronizing
random automata in the critical settings of
almost-group automata. Group automata are automata
where all letters act as permutations on the set of
states, and they are not synchronizing (unless they
have one state). In almost-group automata, one of the
letters acts as a permutation on n {\textminus} 1
states, and the others as permutations. We prove that
this small change is enough for automata to become
synchronizing with high probability. More precisely, we
establish that the probability that a
strongly-connected almost-group automaton is not
synchronizing is 2k{\textminus}1{\textminus}1
n2(k{\textminus}1) (1 + o(1)), for a k -letter
alphabet. We also present an efficient algorithm that
decides whether a strongly-connected almost-group
automaton is synchronizing. For a natural model of
computation, we establish a O(kn) worst-case lower
bound for this problem ( O(n) for the average case),
which is almost matched by our algorithm.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Implementations and Applications of
Automata (CIAA 2018)",
}
@Article{Brzozowski:2020:SCO,
author = "Janusz A. Brzozowski and Lila Kari and Bai Li and
Marek Szyku{\l}a",
title = "State Complexity of Overlap Assembly",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "08",
pages = "1113--1132",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S012905412042006X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 21 07:02:13 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412042006X",
abstract = "The state complexity of a regular language Lm is the
number m of states in a minimal deterministic finite
automaton (DFA) accepting Lm . The state complexity of
a regularity-preserving binary operation on regular
languages is defined as the maximal state complexity of
the result of the operation where the two operands
range over all languages of state complexities
{\textlessequal} m and {\textlessequal} n,
respectively. We determine, for m {\textgreaterequal} 2
, n {\textgreaterequal} 3, the exact value of the
state complexity of the binary operation overlap
assembly on regular languages. This operation was
introduced by Csuhaj-Varj{\'u}, Petre, and Vaszil to
model the process of self-assembly of two linear DNA
strands into a longer DNA strand, provided that their
ends ``overlap''. We prove that the state complexity of
the overlap assembly of languages Lm and Ln, where m
{\textgreaterequal} 2 and n {\textgreaterequal} 1, is
at most 2(m {\textminus} 1)3n{\textminus}1 + 2n .
Moreover, for m {\textgreaterequal} 2 and n
{\textgreaterequal} 3 there exist languages Lm and Ln
over an alphabet of size n whose overlap assembly meets
the upper bound and this bound cannot be met with
smaller alphabets. Finally, we prove that m + n is the
state complexity of the overlap assembly in the case of
unary languages and that there are binary languages
whose overlap assembly has exponential state complexity
at least m(2n{\textminus}1 {\textminus} 2) + 2 .",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Implementations and Applications of
Automata (CIAA 2018)",
}
@Article{Guillon:2020:NSE,
author = "Bruno Guillon and Giovanni Pighizzini and Luca
Prigioniero",
title = "Non-Self-Embedding Grammars, Constant-Height Pushdown
Automata, and Limited Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "08",
pages = "1133--1157",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120420071",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 21 07:02:13 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120420071",
abstract = "Non-self-embedding grammars are a restriction of
context-free grammars which does not allow to describe
recursive structures and, hence, which characterizes
only the class of regular languages. A double
exponential gap in size from non-self-embedding
grammars to deterministic finite automata is known. The
same size gap is also known from constant-height
pushdown automata and 1 -limited automata to
deterministic finite automata. Constant-height pushdown
automata and 1 -limited automata are compared with
non-self-embedding grammars. It is proved that
non-self-embedding grammars and constant-height
pushdown automata are polynomially related in size.
Furthermore, a polynomial size simulation by 1 -limited
automata is presented. However, the converse
transformation is proved to cost exponential. Finally,
a different simulation shows that also the conversion
of deterministic constant-height pushdown automata into
deterministic 1 -limited automata costs polynomial.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Implementations and Applications of
Automata (CIAA 2018)",
}
@Article{Hospodar:2020:RAS,
author = "Michal Hospod{\'a}r and Markus Holzer",
title = "The Ranges of Accepting State Complexities of
Languages Resulting from Some Operations",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "08",
pages = "1159--1177",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120420083",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 21 07:02:13 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120420083",
abstract = "We examine the accepting state complexity, i.e., the
minimal number of accepting states of deterministic
finite automata for languages resulting from unary and
binary operations on languages with accepting state
complexity given as a parameter. This is a continuation
of the work of [J. Dassow: On the number of accepting
states of finite automata, J. Autom., Lang. Comb., 21,
2016]. We solve most of the open problems mentioned
thereof. In particular, we consider the operations of
intersection, symmetric difference, right and left
quotients, reversal, and permutation (on finite
languages), where we obtain precise ranges of accepting
state complexities. We also consider symmetric
difference on unary finite languages where we obtain a
non-contiguous range of accepting state complexities.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Implementations and Applications of
Automata (CIAA 2018)",
}
@Article{Ibarra:2020:SFL,
author = "Oscar H. Ibarra and Ian McQuillan",
title = "Semilinearity of Families of Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "08",
pages = "1179--1198",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120420095",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 21 07:02:13 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120420095",
abstract = "Techniques are developed for creating new and general
language families of only semilinear languages, and for
showing families only contain semilinear languages. It
is shown that for language families {$ \cal L $} that
are semilinear full trios, the smallest full AFL
containing {$ \cal L $} that is also closed under
intersection with languages in NCM (where NCM is the
family of languages accepted by NFA s augmented with
reversal-bounded counters), is also semilinear. If
these closure properties are effective, this also
immediately implies decidability of membership,
emptiness, and infiniteness for these general families.
From the general techniques, new grammar systems are
given that are extensions of well-known families of
semilinear full trios, whereby it is implied that these
extensions must only describe semilinear languages.
This also implies positive decidability properties for
the new systems. Some characterizations of the new
families are also given.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Implementations and Applications of
Automata (CIAA 2018)",
}
@Article{Anonymous:2020:AIV,
author = "Anonymous",
title = "Author Index Volume 31 (2020)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "31",
number = "08",
pages = "1199--1204",
month = dec,
year = "2020",
DOI = "https://doi.org/10.1142/S0129054120990014",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 21 07:02:13 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054120990014",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Implementations and Applications of
Automata (CIAA 2018)",
}
@Article{Wen:2021:SLA,
author = "Tangliu Wen and Jie Peng and Jinyun Xue and Zhen You
and Lan Song",
title = "Strict Linearizability and Abstract Atomicity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "01",
pages = "1--35",
month = jan,
year = "2021",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054121500015",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 23 10:25:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500015",
abstract = "Linearizability is a commonly accepted consistency
condition for concurrent objects. Filipovi{\'c} et al.
show that linearizability is equivalent to
observational refinement. However, linearizability does
not permit concurrent objects to share memory spaces
with their client programs. We show that
linearizability (or observational refinement) can be
broken even though a client program of an object
accesses the shared memory spaces without interleaving
with the methods of the object. In this paper, we
present strict linearizability which lifts this
limitation and can ensure client-side traces and
final-states equivalence even in a relaxed program
model allowing clients to directly access the internal
states of concurrent objects. We also investigate
several important properties of strict linearizability.
At a high level of abstraction, a concurrent object can
be viewed as a concurrent implementation of an abstract
data type (ADT). We also present a correctness
criterion for relating an ADT and its concurrent
implementation, which is the combination of
linearizability and data abstraction and can ensure
observational equivalence. We also investigate its
relationship with strict linearizability.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Camargo:2021:RKC,
author = "Priscila P. Camargo and U{\'e}verton S. Souza and
Julliano R. Nascimento",
title = "Remarks on $k$-Clique, $k$-Independent Set and
$2$-Contamination in Complementary Prisms",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "01",
pages = "37--52",
month = jan,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500027",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 23 10:25:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500027",
abstract = "Complementary prism graphs arise from the disjoint
union of a graph G and its complement {\'a}{\c{}} by
adding the edges of a perfect matching joining pairs of
corresponding vertices of G and {\'a}{\c{}}. Classical
graph problems such as Clique and Independent Set were
proved to be NP-complete on such a class of graphs. In
this work, we study the complexity of both problems on
complementary prism graphs from the parameterized
complexity point of view. First, we prove that both
problems admit a kernel and therefore are
fixed-parameter tractable (FPT) when parameterized by
the size of the solution, k. Then, we show that k
Clique and k -Independent Set on complementary prisms
do not admit polynomial kernel when parameterized by k,
unless NP {\^a} coNP/poly. Furthermore, we address the
2 -Contamination problem in the context of
complementary prisms. This problem consists in
completely contaminating a given graph G using a
minimum set of initially infected vertices. For a
vertex to be contaminated, it is enough that at least
two of its neighbors are contaminated. The propagation
of the contamination follows this rule until no more
vertex can be contaminated. It is known that the
minimum set of initially contaminated vertices
necessary to contaminate a complementary prism of
connected graphs G and {\'a}{\c{}} has cardinality at
most 5. In this paper, we show that the tight upper
bound for this invariant on complementary prisms is 3,
improving a result of Duarte et al. (2017).",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2021:HCE,
author = "Chunfang Li and Shangwei Lin and Shengjia Li",
title = "{Hamiltonian} Cycle Embeddings in Faulty Hypercubes
Under the Forbidden Faulty Set Model",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "01",
pages = "53--72",
month = jan,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500039",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 23 10:25:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500039",
abstract = "In this paper, we study the fault-tolerant capability
of hypercubes with respect to the Hamiltonian property
based on the concept of forbidden faulty sets. We show,
with the assumption that each vertex is incident with
at least three fault-free edges, that an n -dimensional
hypercube contains a fault-free Hamiltonian cycle, even
if there are up to $ (4 n - 13) $ edge faults.
Moreover, we give an example to show that the result is
optimal with respect to the number of edge faults
tolerated.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Liu:2021:CCS,
author = "Jinhui Liu and Yong Yu and Bo Yang and Jianwei Jia and
Qiqi Lai",
title = "Cryptanalysis of {Cramer--Shoup} Like Cryptosystems
Based on Index Exchangeable Family",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "01",
pages = "73--91",
month = jan,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500040",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 23 10:25:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500040",
abstract = "The Cramer--Shoup (CS) like cryptosystem based on
index exchangeable family (IEF) construction is a novel
scheme introduced in Asiaccs 2016 by Li et al. Its
versatility was illustrated by building two public key
encryption (PKE) schemes, a Cramer--Shoup encryption
scheme based on IEFs, as well as an outsourcing
technique based on non-abelian analog. However, the two
schemes are not secure over the recommended linear
group of Li et al. For them, we provide a new
key-recovery attack by solving a linear equation
respectively. Furthermore, we peel off complex
encryption and decryption processes and propose more
than three different attack methods. Finally, we give a
corresponding example to illustrate the correctness of
our attack methods. Our attack methods break an
instance of claiming 80 bit security less than one
minute under a personal computer.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Levit:2021:RGS,
author = "Vadim E. Levit and David Tankus",
title = "Recognizing Generating Subgraphs Revisited",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "01",
pages = "93--114",
month = jan,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500052",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 23 10:25:28 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500052",
abstract = "A graph G is well-covered if all its maximal
independent sets are of the same cardinality. Assume
that a weight function w is defined on its vertices.
Then G is w well-covered if all maximal independent
sets are of the same weight. For every graph G, the set
of weight functions w such that G is w -well-covered is
a vector space, denoted as WCW(G). Deciding whether an
input graph G is well-covered is co-NP-complete.
Therefore, finding WCW(G) is co-NP-hard. A generating
subgraph of a graph G is an induced complete bipartite
subgraph B of G on vertex sets of bipartition BX and
BY, such that each of S {\textunion} BX and S
{\textunion} BY is a maximal independent set of G, for
some independent set S. If B is generating, then w(BX)
= w(BY) for every weight function w {\textelement}
WCW(G). Therefore, generating subgraphs play an
important role in finding WCW(G). The decision problem
whether a subgraph of an input graph is generating is
known to be NP-complete. In this article we prove NP-
completeness of the problem for graphs without cycles
of length 3 and 5, and for bipartite graphs with girth
at least 6. On the other hand, we supply polynomial
algorithms for recognizing generating subgraphs and
finding WCW(G), when the input graph is bipartite
without cycles of length 6. We also present a
polynomial algorithm which finds WCW(G) when G does not
contain cycles of lengths 3, 4, 5, and 7.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yao:2021:TCC,
author = "Ting Yao and Shixin Zhu and Binbin Pang",
title = "Triple Cyclic Codes Over {$ \mathbb {F} q + u \mathbb
{F}q $}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "02",
pages = "115--135",
month = feb,
year = "2021",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054121500064",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 23 10:25:29 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500064",
abstract = "Let R = {$ \mathbb {F} $ q} + {u$ \mathbb {F} $ q},
where q is a power of a prime number p and u2 = 0. A
triple cyclic code of length (r,s,t) over R is a set
that can be partitioned into three parts that any
cyclic shift of the coordinates of the three parts
leaves the code invariant. These codes can be viewed as
R[x] -submodules of R[x]/{\textlangle}xr {\textminus}
1{\textrangle}{\texttimes} R[x]/{\textlangle}xs
{\textminus} 1{\textrangle}{\texttimes}
R[x]/{\textlangle}xt {\textminus} 1{\textrangle}. In
this paper, we study the generator polynomials and the
minimum generating sets of this kind of codes. Some
optimal or almost optimal linear codes are obtained
from this family of codes. We present the relationship
between the generators of triple cyclic codes and their
duals. As a special class of triple cyclic codes,
separable codes over R are discussed briefly in the
end.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Guo:2021:REE,
author = "Litao Guo and Mingzu Zhang and Shaohui Zhai and
Liqiong Xu",
title = "Relation of Extra Edge Connectivity and Component Edge
Connectivity for Regular Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "02",
pages = "137--149",
month = feb,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500076",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 23 10:25:29 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500076",
abstract = "Reliability of interconnection networks is important
to design multiprocessor systems. The extra edge
connectivity and component edge connectivity are two
parameters for the reliability evaluation. The k -extra
edge connectivity {\textlambda}k(G) is the cardinality
of the minimum extra edge cut F such that G
{\textminus} F is not connected and each component of G
{\textminus} F has at least k vertices. The t
-component edge connectivity {\textlambda}t(G) of a
graph G = (V,E) is the minimum edge number of a set F
such that G {\textminus} F is not connected and G
{\textminus} F has at least t components. In this
paper, we find the relation of extra edge connectivity
and component edge connectivity for regular networks.
As an application, we determine the component edge
connectivity of BC networks, k -ary n -cubes, enhanced
hypercubes.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yang:2021:SKC,
author = "Yuxing Yang",
title = "Super {$ C_k $} and Sub-{$ C_k $} Connectivity of
$k$-Ary $n$-Cube Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "02",
pages = "151--162",
month = feb,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500088",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 23 10:25:29 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500088",
abstract = "Let G be an undirected graph. An H -structure-cut
(resp. H -substructure-cut ) of G is a set of subgraphs
of G, if any, whose deletion disconnects G, where the
subgraphs deleted are isomorphic to a certain graph H
(resp. where for any T{\prime} of the subgraphs
deleted, there is a subgraph T of G, isomorphic to H,
such that T{\prime} is a subgraph of T ). G is super
H|M -connected (resp. super sub- H|M -connected ) if
the deletion of an arbitrary minimum H -structure-cut
(resp. minimum H -substructure-cut) isolates a
component isomorphic to a certain graph M. The k -ary n
-cube Qnk is one of the most attractive interconnection
networks for multiprocessor systems. In this paper, we
prove that Qnk with n {\textgreaterequal} 3 is super
sub- Ck|K1 -connected if k {\textgreaterequal} 3 and k
is odd, and super Ck|Ck -connected if k
{\textgreaterequal} 5 and k is odd.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Koga:2021:PPT,
author = "Toshihiro Koga",
title = "A Proof of {Parikh}'s Theorem via {Dickson's Lemma}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "02",
pages = "163--173",
month = feb,
year = "2021",
DOI = "https://doi.org/10.1142/S012905412150009X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 23 10:25:29 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412150009X",
abstract = "In this paper, we give a proof of Parikh's semilinear
theorem via Dickson's lemma. It is notable that our
proof provides a clear separation between properties
derived from Dickson's lemma and tree decomposition for
context-free grammars.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ammar:2021:TBV,
author = "Ikhlass Ammar and Yamen {El Touati} and John Mullins
and Moez Yeddes",
title = "Timed Bounded Verification of Inclusion Based on Timed
Bounded Discretized Language",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "02",
pages = "175--202",
month = feb,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500106",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 23 10:25:29 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500106",
abstract = "The inclusion problem is one of the common problems in
real-time systems. The general form of this problem is
undecidable; however, the time-bounded verification of
inclusion problem is decidable for timed automata. In
this study, we propose a new discretization technique
to verify the inclusion problem. The proposed technique
is applied to a non-Zeno timed automaton with an upper
bound that does not contain a non-reachable space for
each transition. The new approach is based on the
generation of timed bounded discretized language that
represents an abstraction of timed words in the form of
a set of a countable number of discrete timed words. A
discrete timed word aggregates all timed words that
share the same actions and their execution times that
create the time continuous intervals. The lower and the
upper bounds of an interval in a discrete timed word is
defined by the minimum and maximum execution times
associated to a given transition-run. In addition, we
propose the verification schema of the inclusion
between two timed bounded discretized languages
generated by two non-Zeno timed automata.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Krebs:2021:MRP,
author = "Thijmen J. P. Krebs",
title = "A More Reasonable Proof of {Cobham}'s Theorem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "02",
pages = "203--207",
month = feb,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500118",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 23 10:25:29 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500118",
abstract = "We present a short proof of Cobham's theorem without
using Kronecker's approximation theorem, making it
suitable for generalization beyond automatic
sequences.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Asahiro:2021:GOE,
author = "Yuichi Asahiro and Jesper Jansson and Eiji Miyano and
Hirotaka Ono and T. P. Sandhya",
title = "Graph Orientation with Edge Modifications",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "02",
pages = "209--233",
month = feb,
year = "2021",
DOI = "https://doi.org/10.1142/S012905412150012X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Feb 23 10:25:29 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412150012X",
abstract = "The goal of an outdegree-constrained edge-modification
problem is to find a spanning subgraph or supergraph H
of an input undirected graph G such that either: (Type
I) the number of edges in H is minimized or maximized
and H can be oriented to satisfy some specified
constraints on the vertices' resulting outdegrees; or:
(Type II) among all subgraphs or supergraphs of G that
can be constructed by deleting or inserting a fixed
number of edges, H admits an orientation optimizing
some objective involving the vertices' outdegrees. This
paper introduces eight new outdegree-constrained
edge-modification problems related to load balancing
called (Type I) MIN-DEL-MAX, MIN-INS-MIN, MAX-INS-MAX,
and MAX-DEL-MIN and (Type II) p -DEL-MAX, p -INS-MIN, p
-INS-MAX, and p -DEL-MIN. In each of the eight
problems, the input is a graph and the goal is to
delete or insert edges so that the resulting graph has
an orientation in which the maximum outdegree (taken
over all vertices) is small or the minimum outdegree is
large. We first present a framework that provides
algorithms for solving all eight problems in polynomial
time on unweighted graphs. Next we investigate the
inapproximability of the edge-weighted versions of the
problems, and design polynomial-time algorithms for six
of the problems on edge-weighted trees.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lv:2021:EAC,
author = "Yali Lv and Cheng-Kuan Lin and Guijuan Wang",
title = "An Exchanged 3-Ary $n$-Cube Interconnection Network
for Parallel Computation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "03",
pages = "235--252",
month = apr,
year = "2021",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054121500131",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 14 07:18:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500131",
abstract = "The interconnetion network plays an important role in
a parallel system. To avoid the edge number of the
interconnect network scaling rapidly with the increase
of dimension and achieve a good balance of hardware
costs and properties, this paper presents a new
interconnection network called exchanged 3 -ary n -cube
( E3C ). Compared with the 3 -ary n -cube structures,
E3C shows better performance in terms of many metrics
such as small degree and fewer links. In this paper, we
first introduce the structure of E3C and present some
properties of E3C ; then, we propose a routing
algorithm and obtain the diameter of E3C. Finally, we
analyze the diagnosis of E3C and give the
diagnosibility under PMC model and MM* model.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2021:IFD,
author = "Rong Wang and Xiaoni Du and Cuiling Fan and Zhihua
Niu",
title = "Infinite Families of 2-Designs from a Class of Linear
Codes Related to {Dembowski--Ostrom} Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "03",
pages = "253--267",
month = apr,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500143",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 14 07:18:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500143",
abstract = "Due to their important applications to coding theory,
cryptography, communications and statistics,
combinatorial t -designs have attracted lots of
research interest for decades. The interplay between
coding theory and t -designs started many years ago. It
is generally known that t -designs can be used to
derive linear codes over any finite field, and that the
supports of all codewords with a fixed weight in a code
also may hold a t -design. In this paper, we first
construct a class of linear codes from cyclic codes
related to Dembowski-Ostrom functions. By using
exponential sums, we then determine the weight
distribution of the linear codes. Finally, we obtain
infinite families of 2 -designs from the supports of
all codewords with a fixed weight in these codes.
Furthermore, the parameters of 2 -designs are
calculated explicitly.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Berberler:2021:ABN,
author = "Zeynep Nihan Berberler and Halil {\. I}brahim Yildirim
and Tolga {\. I}lt{\"u}zer and {\. I}zzet Tun{\c{c}}",
title = "Agglomeration-Based Node Importance Analysis in
Wheel-Type Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "03",
pages = "269--288",
month = apr,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500210",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 14 07:18:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500210",
abstract = "Evaluating the importance of nodes for complex
networks is an important part of invulnerability
research. In this paper, node importance analysis is
conducted in wheel-related networks by a method of
evaluating node importance by node contraction based on
network agglomeration in communication networks. Both
degrees and positions of nodes are considered with this
method. This method was also proved to be feasible and
effective measure to identify influential nodes in a
network.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Xu:2021:FTE,
author = "Xirong Xu and Huifeng Zhang and Ziming Wang and Qiang
Zhang and Peng Zhang",
title = "$ (n - 2)$-Fault-Tolerant Edge-Pancyclicity of Crossed
Cubes {CQn}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "03",
pages = "289--304",
month = apr,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500167",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 14 07:18:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500167",
abstract = "As one of the most fundamental networks for parallel
and distributed computation, cycle is suitable for
developing simple algorithms with low communication
cost. A graph G is called k -fault-tolerant
edge-pancyclic if after deleting any faulty set F of k
vertices and/or edges from G, every correct edge in the
resulting graph lies in a cycle of every length from g
to |V (G {\textminus} F)|, inclusively, where g is the
girth of G, the length of a shortest cycle in G. The n
-dimensional crossed cube CQn is an important variant
of the hypercube Qn, which possesses some properties
superior to the hypercube. This paper investigates the
fault-tolerant edge-pancyclicity of CQn, and shows that
if CQn(n {\textgreaterequal} 5) contains at most n
{\textminus} 2 faulty vertices and/or edges then, for
any fault-free edge uv and every length {\ell} from 6
to |V (CQn {\textminus} F)| except {\ell} = 7, there is
a fault-free cycle of length {\ell} containing the edge
uv. The result is optimal in some senses.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2021:SBS,
author = "Yihong Wang and Cheng-Kuan Lin and Shuming Zhou and
Tao Tian",
title = "Subgraph-based Strong {Menger} Connectivity of
Hypercube and Exchanged Hypercube",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "03",
pages = "305--330",
month = apr,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500179",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 14 07:18:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500179",
abstract = "Large scale multiprocessor systems or multicomputer
systems, taking interconnection networks as underlying
topologies, have been widely used in the big data era.
Fault tolerance is becoming an essential attribute in
multiprocessor systems as the number of processors is
getting larger. A connected graph G is called strong
Menger (edge) connected if, for any two distinct
vertices u and v, there are {mindG(u),dG(v)} vertex
(edge)-disjoint paths between them. Exchanged hypercube
EH(s,t), as a variant of hypercube Qn, remains lots of
preferable fault tolerant properties of hypercube. In
this paper, we show that Qn {\textminus} Qk (1
{\textlessequal} k {\textlessequal} n {\textminus} 1)
and EH(s,t) {\textminus} Qk (2 {\textlessequal} k
{\textlessequal}min{s,t}) are strong Menger (edge)
connected, respectively. Moreover, as a by-product, for
dual cube Dn = EH(n {\textminus} 1,n {\textminus} 1),
one popular generalization of hypercube, Dn
{\textminus} Qk is also showed to be strong Menger
(edge) connected, where 1 {\textlessequal} k
{\textlessequal} n {\textminus} 1,{\nobreakspace}40n
{\textgreaterequal} 3.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sharma:2021:AAO,
author = "Amit Sharma and P. Venkata Subba Reddy",
title = "Algorithmic Aspects of Outer-Independent Total {Roman}
Domination in Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "03",
pages = "331--339",
month = apr,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500180",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Apr 14 07:18:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500180",
abstract = "For a simple, undirected graph G, a function h : V (G)
{\textrightarrow}{0, 1, 2} which satisfies the
following conditions is called an outer-independent
total Roman dominating function (OITRDF) of G with
weight h(V ) ={\textsummation}v{\textelement}Vh(v).
(C1) For all q {\textelement} V with h(q) = 0 there
exists a vertex r such that qr {\textelement} E and
h(r) = 2, (C2) The induced subgraph with vertex set {p
: h(p) {\textgreaterequal} 1} has no isolated vertices
and (C3) The induced subgraph with vertex set {p : h(p)
= 0} is independent. For a graph G, the smallest
possible weight of an OITRDF of G which is denoted by
{\textgrgamma}oitR(G), is known as the
outer-independent total Roman domination number of G.
The problem of determining {\textgrgamma}oitR(G) of a
graph G is called minimum outer-independent total Roman
domination problem (MOITRDP). In this article, we show
that the problem of deciding if G has an OITRDF of
weight at most l for bipartite graphs and split graphs,
a subclass of chordal graphs is NP-complete. We also
show that MOITRDP is linear time solvable for connected
threshold graphs and bounded treewidth graphs. Finally,
we show that the domination and outer-independent total
Roman domination problems are not equivalent in
computational complexity aspects.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Carpi:2021:CEA,
author = "Arturo Carpi and Flavio D'Alessandro",
title = "On the Commutative Equivalence of Algebraic Formal
Series and Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "04",
pages = "341--367",
month = jun,
year = "2021",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054121500192",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Jun 23 06:51:09 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500192",
abstract = "The problem of the commutative equivalence of
context-free and regular languages is studied.
Conditions ensuring that a context-free language of
exponential growth is commutatively equivalent with a
regular language are investigated.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Czyzowicz:2021:SLB,
author = "Jurek Czyzowicz and Konstantinos Georgiou and
Evangelos Kranakis and Danny Krizanc and Lata Narayanan
and Jaroslav Opatrny and Sunil Shende",
title = "Search on a Line by {Byzantine} Robots",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "04",
pages = "369--387",
month = jun,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500209",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Jun 23 06:51:09 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500209",
abstract = "We consider the problem of fault-tolerant parallel
search on an infinite line by n robots. Starting from
the origin, the robots are required to find a target at
an unknown location. The robots can move with maximum
speed 1 and can communicate wirelessly among
themselves. However, among the n robots, there are f
robots that exhibit byzantine faults. A faulty robot
can fail to report the target even after reaching it,
or it can make malicious claims about having found the
target when in fact it has not. Given the presence of
such faulty robots, the search for the target can only
be concluded when the non-faulty robots have sufficient
evidence that the target has been found. We aim to
design algorithms that minimize the value of Sd(n,f),
the time to find a target at a (unknown) distance d
from the origin by n robots among which f are faulty.
We give several different algorithms whose running time
depends on the ratio f/n, the density of faulty robots,
and also prove lower bounds. Our algorithms are optimal
for some densities of faulty robots.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Guan:2021:LKA,
author = "Albert Guan",
title = "A Lightweight Key Agreement Protocol with
Authentication Capability",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "04",
pages = "389--404",
month = jun,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500222",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Jun 23 06:51:09 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500222",
abstract = "Computationally lightweight and unconditionally secure
key agreement protocols are very useful for secure
communication in public networks. Recently, Guan et al.
proposed a key agreement protocol whose security is
based on the unpredictability of channel noise rather
than computationally hard problems. These protocols are
efficient, computationally lightweight, and
unconditionally secure. However, authentication was not
integrated into these protocols. In this article, we
propose a new protocol with authentication capability
that enables two nodes in the network to establish a
secret session key for secure communication. It is more
efficient, and it also preserves the lightweight and
unconditional secure features of the key agreement
protocols proposed by Guan et al. Therefore, it is more
suitable for devices with limited computing power, such
as sensors in Internet of Things (IoT).",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2021:EDH,
author = "Shiying Wang",
title = "The $r$-Extra Diagnosability of Hyper {Petersen}
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "04",
pages = "405--416",
month = jun,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500234",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Jun 23 06:51:09 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500234",
abstract = "The diagnosability of a multiprocessor system or an
interconnection network plays an important role in
measuring the fault tolerance of the network. In 2016,
Zhang et al. proposed a new measure for fault diagnosis
of the system, namely, the r -extra diagnosability,
which restrains that every fault-free component has at
least (r + 1) fault-free nodes. As a famous topology
structure of interconnection networks, the hyper
Petersen graph HPn has many good properties. It is
difficult to prove the r -extra diagnosability of an
interconnection network. In this paper, we show that
the r -extra diagnosability of HPn is {\textminus}1 2r2
+ (n {\textminus}1 2)r + n for n {\textgreaterequal} 4
and 0 {\textlessequal} r {\textlessequal} n
{\textminus} 3 in the PMC model and for n
{\textgreaterequal} 7 and 0 {\textlessequal} r
{\textlessequal} 1 2(n {\textminus} 2) in the MM {\^a}
model.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Holzer:2021:P,
author = "Markus Holzer and Martin Kutrib",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "05",
pages = "417--418",
month = aug,
year = "2021",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054121020019",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 12 06:43:00 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121020019",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Dedicated to Nelma Moreira and
Rog{\'e}rio Reis on the Occasion of Their 60th
Birthdays",
}
@Article{Nicaud:2021:RRE,
author = "Cyril Nicaud and Pablo Rotondo",
title = "Random Regular Expression Over Huge Alphabets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "05",
pages = "419--438",
month = aug,
year = "2021",
DOI = "https://doi.org/10.1142/S012905412141001X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 12 06:43:00 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412141001X",
abstract = "In this article, we study some properties of random
regular expressions of size n, when the cardinality of
the alphabet also depends on n. For this, we revisit
and improve the classical Transfer Theorem from the
field of analytic combinatorics. This provides precise
estimations for the number of regular expressions, the
probability of recognizing the empty word and the
expected number of Kleene stars in a random expression.
For all these statistics, we show that there is a
threshold when the size of the alphabet approaches n2,
at which point the leading term in the asymptotics
starts oscillating.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Dedicated to Nelma Moreira and
Rog{\'e}rio Reis on the Occasion of Their 60th
Birthdays",
}
@Article{Dassow:2021:FRO,
author = "J{\"u}rgen Dassow",
title = "Further Remarks on the Operational Nonterminal
Complexity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "05",
pages = "439--453",
month = aug,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121410021",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 12 06:43:00 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121410021",
abstract = "For a regular language L, let Var(L) be the minimal
number of nonterminals necessary to generate L by right
linear grammars. Moreover, for natural numbers
k1,k2,{\textellipsis},kn and an n -ary regularity
preserving operation f, let the range gfVar(k
1,k2,{\textellipsis},kn) be the set of all numbers k
such that there are regular languages
L1,L2,{\textellipsis},Ln with Var(Li) = ki for 1
{\textlessequal} i {\textlessequal} n and
Var(f(L1,L2,{\textellipsis},Ln)) = k. We show that, for
the circular shift operation Circ, gCircVar(n) is
infinite for all n, and we completely determine the set
gCircVar(2). Moreover, we give a precise range for the
left right quotient and a partial result for the left
quotient. Furthermore, we add some values to the range
for the operation intersection which improves the
result of [].",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Dedicated to Nelma Moreira and
Rog{\'e}rio Reis on the Occasion of Their 60th
Birthdays",
}
@Article{Konstantinidis:2021:ZAT,
author = "Stavros Konstantinidis and Mitja Mastnak and Juraj
{\v{S}}ebej",
title = "Zero-Avoiding Transducers, Length Separable Relations,
and the Rational Asymmetric Partition Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "05",
pages = "455--480",
month = aug,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121410033",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 12 06:43:00 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121410033",
abstract = "We consider the problem of partitioning effectively a
given irreflexive (and possibly symmetric) rational
relation R into two asymmetric rational relations. This
problem is motivated by a recent method of embedding an
R -independent language into one that is maximal R
-independent, where the method requires to use an
asymmetric partition of R. We solve the problem when R
is length-separable, which means that the following two
subsets of R are rational: the subset of word pairs
(u,v) where |u|{\textlessequal}|v| ; and the subset of
word pairs (u,v) where |u|{\textgreaterequal}|v|. This
property is satisfied by all recognizable, all left
synchronous, and all right synchronous relations. We
leave it as an open problem when R is not
length-separable. We also define zero-avoiding
transducers for length-separable relations, which makes
our partitioning solution constructive.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Dedicated to Nelma Moreira and
Rog{\'e}rio Reis on the Occasion of Their 60th
Birthdays",
}
@Article{Ibarra:2021:GCS,
author = "Oscar H. Ibarra and Ian McQuillan",
title = "Generalizations of Checking Stack Automata:
Characterizations and Hierarchies",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "05",
pages = "481--508",
month = aug,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121410045",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 12 06:43:00 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121410045",
abstract = "We examine different generalizations of checking stack
automata by allowing multiple input heads and multiple
stacks, and characterize their computing power in terms
of two-way multi-head finite automata and space-bounded
Turing machines. For various models, we obtain
hierarchies in terms of their computing power. Our
characterizations and hierarchies expand or tighten
some previously known results. We also discuss some
decidability questions and the space/time complexity of
the models.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Dedicated to Nelma Moreira and
Rog{\'e}rio Reis on the Occasion of Their 60th
Birthdays",
}
@Article{Ko:2021:GCL,
author = "Sang-Ki Ko and Yo-Sub Han and Kai Salomaa",
title = "Generalizations of Code Languages with Marginal
Errors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "05",
pages = "509--529",
month = aug,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121410057",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 12 06:43:00 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121410057",
abstract = "The k -prefix-free, k -suffix-free and k -infix-free
languages generalize the prefix-free, suffix-free and
infix-free languages by allowing marginal errors. For
example, a string x in a k -prefix-free language L can
be a prefix of up to k different strings in L. We also
define finitely prefix-free languages in which a string
x can be a prefix of finitely many strings. We present
efficient algorithms that determine whether or not a
given regular language is k -prefix-free, k
-suffix-free or k -infix-free, and analyze the time
complexity of the algorithms. We establish
undecidability results for deciding these properties
for (linear) context-free languages.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Dedicated to Nelma Moreira and
Rog{\'e}rio Reis on the Occasion of Their 60th
Birthdays",
}
@Article{Ko:2021:LBT,
author = "Sang-Ki Ko and Yo-Sub Han",
title = "Left is Better Than Right for Reducing Nondeterminism
of {NFAs}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "05",
pages = "531--550",
month = aug,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121410069",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 12 06:43:00 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121410069",
abstract = "We study the NFA reductions by invariant equivalences
and preorders. It is well-known that the NFA
minimization problem is PSPACE-complete. Therefore,
there have been many approaches to reduce the size of
NFAs in low polynomial time by computing invariant
equivalence or preorder relation and merging the states
within same equivalence class. Here we consider the
nondeterminism reduction of NFAs by invariant
equivalences and preorders. We, in particular, show
that computing equivalence and preorder relation from
the left is more useful than the right for reducing the
degree of nondeterminism in NFAs. We also present
experimental evidence for showing that NFA reduction
from the left achieves the better reduction of
nondeterminism than reduction from the right.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Dedicated to Nelma Moreira and
Rog{\'e}rio Reis on the Occasion of Their 60th
Birthdays",
}
@Article{Nagy:2021:UFR,
author = "Benedek Nagy",
title = "Union-Freeness Revisited --- Between Deterministic and
Nondeterministic Union-Free Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "05",
pages = "551--573",
month = aug,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121410070",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 12 06:43:00 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121410070",
abstract = "Union-free expressions are regular expressions without
using the union operation. Consequently,
(nondeterministic) union-free languages are described
by regular expressions using only concatenation and
Kleene star. The language class is also characterised
by a special class of finite automata: 1CFPAs have
exactly one cycle-free accepting path from each of
their states. Obviously such an automaton has exactly
one accepting state. The deterministic counterpart of
such class of automata defines the deterministic
union-free (d-union-free, for short) languages. In this
paper {\textlambda} -free nondeterministic variants of
1CFPAs are used to define n-union-free languages. The
defined language class is shown to be properly between
the classes of (nondeterministic) union-free and
d-union-free languages (in case of at least binary
alphabet). In case of unary alphabet the class of
n-union-free languages coincides with the class of
union-free languages. Some properties of the new
subregular class of languages are discussed, e.g.,
closure properties. On the other hand, a regular
expression is in union normal form if it is a finite
union of union-free expressions. It is well known that
every regular expression can be written in union normal
form, i.e., all regular languages can be described as
finite unions of (nondeterministic) union-free
languages. It is also known that the same fact does not
hold for deterministic union-free languages, that is,
there are regular languages that cannot be written as
finite unions of d-union-free languages. As an
important result here we show that every regular
language can be defined by a finite union of
n-union-free languages. This fact also allows to define
n-union-complexity of regular languages.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Dedicated to Nelma Moreira and
Rog{\'e}rio Reis on the Occasion of Their 60th
Birthdays",
}
@Article{Fazekas:2021:LBS,
author = "Szil{\'a}rd Zsolt Fazekas and Hwee Kim and Ryuichi
Matsuoka and Reoto Morita and Shinnosuke Seki",
title = "Linear Bounds on the Size of Conformations in Greedy
Deterministic Oritatami",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "05",
pages = "575--596",
month = aug,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121410082",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 12 06:43:00 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121410082",
abstract = "Oritatami is a computational model of RNA
cotranscriptional folding, in which an RNA transcript
is folding upon itself while being synthesized from its
template DNA. This model is known to be Turing
universal. Under the restriction on its parameters
delay and arity both being 1, however, any
deterministically foldable conformation is known to be
at most ten times as large as its initial conformation
(seed), and hence, the model becomes weaker. In this
paper, we shall improve the size upper bound from 10n
down to 4n + 5 and also provide a system that can fold
into a conformation of size 3n {\textminus} 20. These
tighter bounds result from a novel graph representation
of deterministic oritatami folding pathways. We shall
also study the case in which a transcript is trapped in
a region closed by a seed and show that under this
confinement, the upper bound is further improved to 11
3 n {\textminus} 5.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Dedicated to Nelma Moreira and
Rog{\'e}rio Reis on the Occasion of Their 60th
Birthdays",
}
@Article{Gabric:2021:INP,
author = "Daniel Gabric and Narad Rampersad and Jeffrey
Shallit",
title = "An Inequality for the Number of Periods in a Word",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "05",
pages = "597--614",
month = aug,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121410094",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Aug 12 06:43:00 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121410094",
abstract = "We prove an inequality for the number of periods in a
word x in terms of the length of x and its initial
critical exponent. Next, we characterize all periods of
the length- n prefix of a characteristic Sturmian word
in terms of the lazy Ostrowski representation of n, and
use this result to show that our inequality is tight
for infinitely many words x. We propose two related
measures of periodicity for infinite words. Finally, we
also consider special cases where x is overlap-free or
squarefree.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Dedicated to Nelma Moreira and
Rog{\'e}rio Reis on the Occasion of Their 60th
Birthdays",
}
@Article{Jonoska:2021:P,
author = "Nata{\v{s}}a Jonoska and Dmytro Savchuk",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "06",
pages = "615--617",
month = sep,
year = "2021",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054121020020",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 1 10:15:53 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121020020",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2020",
}
@Article{Fleischmann:2021:RWR,
author = "Pamela Fleischmann and Marie Lejeune and Florin Manea
and Dirk Nowotka and Michel Rigo",
title = "Reconstructing Words from Right-Bounded-Block Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "06",
pages = "619--640",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121420016",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 1 10:15:53 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121420016",
abstract = "A reconstruction problem of words from scattered
factors asks for the minimal information, like
multisets of scattered factors of a given length or the
number of occurrences of scattered factors from a given
set, necessary to uniquely determine a word. We show
that a word w {\textelement}{a,b}{\^a} can be
reconstructed from the number of occurrences of at most
min(|w|a,|w|b) + 1 scattered factors of the form aib,
where |w|a is the number of occurrences of the letter a
in w. Moreover, we generalise the result to alphabets
of the form {1,{\textellipsis},q} by showing that at
most {\textsummation}i=1q{\textminus}1|w| i(q
{\textminus} i + 1) scattered factors suffices to
reconstruct w. Both results improve on the upper bounds
known so far. Complexity time bounds on reconstruction
algorithms are also considered here.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2020",
}
@Article{Fleischer:2021:RLS,
author = "Lukas Fleischer and Jeffrey Shallit",
title = "Recognizing Lexicographically Smallest Words and
Computing Successors in Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "06",
pages = "641--662",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121420028",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 1 10:15:53 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121420028",
abstract = "For a formal language L, the problem of language
enumeration asks to compute the
length-lexicographically smallest word in L larger than
a given input w {\textelement} {\textSigma}{\^a}
(henceforth called the L -successor of w ). We
investigate this problem for regular languages from a
computational complexity and state complexity
perspective. We first show that if L is recognized by a
DFA with n states, then 2{\textTheta}(nlog n) states
are (in general) necessary and sufficient for an
unambiguous finite-state transducer to compute L
-successors. As a byproduct, we obtain that if L is
recognized by a DFA with n states, then
2{\textTheta}(nlog n) states are sufficient for a DFA
to recognize the subset S(L) of L composed of its
lexicographically smallest words. We give a matching
lower bound that holds even if S(L) is represented as
an NFA. It has been known that L -successors can be
computed in polynomial time, even if the regular
language is given as part of the input (assuming a
suitable representation of the language, such as a
DFA). In this paper, we refine this result in multiple
directions. We show that if the regular language is
given as part of the input and encoded as a DFA, the
problem is in NL. If the regular language L is fixed,
we prove that the enumeration problem of the language
is reducible to deciding membership to the
Myhill-Nerode equivalence classes of L under DLOGTIME
-uniform AC0 reductions. In particular, this implies
that fixed star-free languages can be enumerated in AC0
, arbitrary fixed regular languages can be enumerated
in NC1 and that there exist regular languages for which
the problem is NC1 -complete.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2020",
}
@Article{Kopra:2021:IDT,
author = "Johan Kopra",
title = "On the Interplay of Direct Topological Factorizations
and Cellular Automata Dynamics on Beta-Shifts",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "06",
pages = "663--683",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S012905412142003X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 1 10:15:53 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412142003X",
abstract = "We consider the range of possible dynamics of cellular
automata (CA) on two-sided beta-shifts S{\textbeta} and
its relation to direct topological factorizations. We
show that any reversible CA F : S{\textbeta}
{\textrightarrow} S{\textbeta} has an almost
equicontinuous direction whenever S{\textbeta} is not
sofic. This has the corollary that non-sofic
beta-shifts are topologically direct prime, i.e. they
are not conjugate to direct topological factorizations
X {\texttimes} Y of two nontrivial subshifts X and Y.
We also give a simple criterion to determine whether
Sn{\textgrgamma} is conjugate to Sn {\texttimes}
S{\textgrgamma} for a given integer n
{\textgreaterequal} 1 and a given real {\textgrgamma}
{$>$} 1 when S{\textgrgamma} is a subshift of finite
type. When S{\textgrgamma} is strictly sofic, we show
that such a conjugacy is not possible at least when
{\textgrgamma} is a quadratic Pisot number of degree 2
. We conclude by using direct factorizations to give a
new proof for the classification of reversible
multiplication automata on beta-shifts with integral
base and ask whether nontrivial multiplication automata
exist when the base is not an integer.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2020",
}
@Article{Kari:2021:DCS,
author = "Lila Kari and Timothy Ng",
title = "Descriptional Complexity of Semi-Simple Splicing
Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "06",
pages = "685--711",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121420041",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 1 10:15:53 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121420041",
abstract = "Splicing systems are generative mechanisms introduced
by Tom Head in 1987 to model the biological process of
DNA recombination. The computational engine of a
splicing system is the ``splicing operation'', a
cut-and-paste binary string operation defined by a set
of ``splicing rules'', quadruples r = (u1,u2; u3,u4)
where u1,u2,u3,u4 are words over an alphabet
{\textSigma}. For two strings x1u1u2y1 and x2u3u4y2,
applying the splicing rule r produces the string
x1u1u4y2. In this paper we focus on a particular type
of splicing systems, called (i,j) semi-simple splicing
systems, i = 1, 2 and j = 3, 4, wherein all splicing
rules r have the property that the two strings in
positions i and j in r are singleton letters, while the
other two strings are empty. The language generated by
such a system consists of the set of words that are
obtained starting from an initial set called ``axiom
set'', by iteratively applying the splicing rules to
strings in the axiom set as well as to intermediately
produced strings. We consider semi-simple splicing
systems where the axiom set is a regular language, and
investigate the descriptional complexity of such
systems in terms of the size of the minimal
deterministic finite automata that recognize the
languages they generate.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2020",
}
@Article{Modanese:2021:STL,
author = "Augusto Modanese",
title = "Sublinear-Time Language Recognition and Decision by
One-Dimensional Cellular Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "06",
pages = "713--731",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121420053",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 1 10:15:53 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121420053",
abstract = "After an apparent hiatus of roughly 30 years, we
revisit a seemingly neglected subject in the theory of
(one-dimensional) cellular automata: sublinear-time
computation. The model considered is that of ACAs,
which are language acceptors whose acceptance condition
depends on the states of all cells in the automaton. We
prove a time hierarchy theorem for sublinear-time ACA
classes, analyze their intersection with the regular
languages, and, finally, establish strict inclusions in
the parallel computation classes SC and (uniform) AC.
As an addendum, we introduce and investigate the
concept of a decider ACA (DACA) as a candidate for a
decider counterpart to (acceptor) ACAs. We show the
class of languages decidable in constant time by DACAs
equals the locally testable languages, and we also
determine {\textOmega}(n) as the (tight) time
complexity threshold for DACAs up to which no advantage
compared to constant time is possible.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2020",
}
@Article{Koechlin:2021:SUE,
author = "Florent Koechlin and Cyril Nicaud and Pablo Rotondo",
title = "Simplifications of Uniform Expressions Specified by
Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "06",
pages = "733--760",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121420065",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 1 10:15:53 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121420065",
abstract = "In this article, we study the impact of applying
simple reduction rules to random syntactic formulas
encoded as trees. We assume that there is an operator
that has an absorbing pattern and prove that if we use
this property to simplify a uniform random expression
with n nodes, then the expected size of the result is
bounded by a constant. The same holds for higher
moments, establishing the lack of expressivity of
uniform random expressions. Our framework is quite
general as we consider expressions defined by systems
of combinatorial equations. For our proofs, we rely on
Drmota's multidimensional theorem for systems of
generating functions.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2020",
}
@Article{Lobel:2021:BTW,
author = "Raphaela L{\"o}bel and Michael Luttenberger and Helmut
Seidl",
title = "On the Balancedness of Tree-to-Word Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "06",
pages = "761--783",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121420077",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 1 10:15:53 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121420077",
abstract = "A language over an alphabet B = A
{\textunion}A{\textasciimacron} of opening ( A ) and
closing ( A{\textasciimacron} ) brackets, is balanced
if it is a subset of the Dyck language {$ \mathbb {D}
$B} over B, and it is well-formed if all words are
prefixes of words in {$ \mathbb {D} $B}. We show that
well-formedness of a context-free language is decidable
in polynomial time, and that the longest common reduced
suffix can be computed in polynomial time. With this at
a hand we decide for the class 2- TW of non-linear tree
transducers with output alphabet B whether or not the
output language is balanced.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2020",
}
@Article{Bleak:2021:NAS,
author = "Collin Bleak",
title = "Normalish Amenable Subgroups of the {R. Thompson}
Groups",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "06",
pages = "785--800",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121420089",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 1 10:15:53 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121420089",
abstract = "Results in C{\^a} algebras, of Matte Bon and Le
Boudec, and of Haagerup and Olesen, apply to the R.
Thompson groups F {\textlessequal} T {\textlessequal} V
. These results together show that F is non-amenable if
and only if T has a simple reduced C{\^a} -algebra. In
further investigations into the structure of C{\^a}
-algebras, Breuillard, Kalantar, Kennedy, and Ozawa
introduce the notion of a normalish subgroup of a group
G. They show that if a group G admits no non-trivial
finite normal subgroups and no normalish amenable
subgroups then it has a simple reduced C{\^a} -algebra.
Our chief result concerns the R. Thompson groups F
{$<$} T {$<$} V ; we show that there is an elementary
amenable group E {$<$} F [where here, E{\^a}
{\textellipsis}) {\^a} {$ \mathbb {Z} $}) {\^a} {$
\mathbb {Z} $}) {\^a} {$ \mathbb {Z} $} ] with E
normalish in V. The proof given uses a natural partial
action of the group V on a regular language determined
by a synchronising automaton in order to verify a
certain stability condition: once again highlighting
the existence of interesting intersections of the
theory of V with various forms of formal language
theory.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2020",
}
@Article{Ibarra:2021:SCS,
author = "Oscar H. Ibarra and Jozef {Jir{\'a}sek, Jr.} and Ian
McQuillan and Luca Prigioniero",
title = "Space Complexity of Stack Automata Models",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "06",
pages = "801--823",
month = sep,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121420090",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Oct 1 10:15:53 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121420090",
abstract = "This paper examines several measures of space
complexity of variants of stack automata: non-erasing
stack automata and checking stack automata. These
measures capture the minimum stack size required to
accept every word in the language of the automaton
(weak measure), the maximum stack size used in any
accepting computation on any accepted word (accept
measure), and the maximum stack size used in any
computation (strong measure). We give a detailed
characterization of the accept and strong space
complexity measures for checking stack automata.
Exactly one of three cases can occur: the complexity is
either bounded by a constant, behaves like a linear
function, or it can not be bounded by any function of
the length of the input word (and it is decidable which
case occurs). However, this result does not hold for
non-erasing stack automata; we provide an example where
the space complexity grows proportionally to the square
root of the length of the input. Furthermore, we study
the complexity bounds of machines which accept a given
language, and decidability of space complexity
properties.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Developments in Language Theory 2020",
}
@Article{Ibarra:2021:A,
author = "Oscar H. Ibarra and Sartaj K. Sahni",
title = "Announcement",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "07",
pages = "??--??",
month = nov,
year = "2021",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054121010012",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 27 06:45:23 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121010012",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ibrahimov:2021:EFA,
author = "Rishat Ibrahimov and Kamil Khadiev and
Kri{\v{s}}j{\=a}nis Pr{\=u}sis and Abuzer
Yakary{\i}lmaz",
title = "Error-Free Affine, Unitary, and Probabilistic
{OBDDs}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "07",
pages = "827--847",
month = nov,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500246",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 27 06:45:23 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500246",
abstract = "We introduce the affine OBDD model and show that
zero-error affine OBDDs can be exponentially narrower
than bounded-error unitary and probabilistic OBDDs on
certain problems. Moreover, we show that Las-Vegas
unitary and probabilistic OBDDs can be quadratically
narrower than deterministic OBDDs. We also obtain the
same results for the automata counterparts of these
models.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cao:2021:KMB,
author = "Mengyue Cao and Tongtong Ding and Min Xu",
title = "The $ (n, k)$-Modified-Bubble-Sort Graph: a
Generalized Modified-Bubble-Sort Graph",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "07",
pages = "849--860",
month = nov,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500258",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 27 06:45:23 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500258",
abstract = "In this paper, we present a new interconnection
topology, called the (n,k) -modified-bubble-sort graph,
which is a generalization of the modified-bubble-sort
graph. Additionally, we show many of its properties,
such as its hierarchical structure, vertex
transitivity, connectivity, edge-connectivity, super
connectivity and super edge-connectivity. The (n,k)
-modified-bubble-sort graph presents more flexibility
than the modified-bubble-sort graph in terms of its
major design properties.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wen:2021:CMC,
author = "Jiejing Wen and Fang-Wei Fu",
title = "On the Construction of Multiply Constant-Weight
Codes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "07",
pages = "861--870",
month = nov,
year = "2021",
DOI = "https://doi.org/10.1142/S012905412150026X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 27 06:45:23 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412150026X",
abstract = "Multiply constant-weight codes (MCWCs) were introduced
recently to improve the reliability of certain
physically unclonable function response. In this paper,
two methods of constructing MCWCs are presented
following the concatenation methodology. In other
words, MCWCs are constructed by concatenating
approximate outer codes and inner codes. Besides,
several classes of optimal MCWCs are derived from these
methods. In the first method, the outer codes are q
-ary codes and the inner codes are constant-weight
codes over GF(2). Furthermore, if the outer code
achieves the Plotkin bound and the inner code achieves
Johnson bound, then the resulting MCWC is optimal. In
the second method, the outer codes are q -ary codes and
the inner codes are MCWCs. Furthermore, if the outer
code achieves the Plotkin bound and the inner code
achieves the Johnson bound, then the resulting MCWC is
optimal.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Egecioglu:2021:ALC,
author = "{\"O}mer E{\u{g}}ecio{\u{g}}lu and Elif Sayg{\i} and
Z{\"u}lf{\"u}kar Sayg{\i}",
title = "Alternate {Lucas} Cubes",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "07",
pages = "871--899",
month = nov,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500271",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 27 06:45:23 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500271",
abstract = "We introduce alternate Lucas cubes, a new family of
graphs designed as an alternative for the well known
Lucas cubes. These interconnection networks are
subgraphs of Fibonacci cubes and have a useful
fundamental decomposition similar to the one for
Fibonacci cubes. The vertices of alternate Lucas cubes
are constructed from binary strings that are encodings
of Lucas representation of integers. As well as
ordinary hypercubes, Fibonacci cubes and Lucas cubes,
alternate Lucas cubes have several interesting
structural and enumerative properties. In this paper we
study some of these properties. Specifically, we give
the fundamental decomposition giving the recursive
structure, determine the number of edges, number of
vertices by weight, the distribution of the degrees; as
well as the properties of induced hypercubes, q -cube
polynomials and maximal hypercube polynomials. We also
obtain the irregularity polynomials of this family of
graphs, determine the conditions for Hamiltonicity, and
calculate metric properties such as the radius,
diameter, and the center.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Finkel:2021:TEP,
author = "Olivier Finkel",
title = "Two Effective Properties of $ \omega $-Rational
Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "07",
pages = "901--920",
month = nov,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500283",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 27 06:45:23 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500283",
abstract = "We prove two new effective properties of rational
functions over infinite words which are realized by
finite state B{\"u}chi transducers. Firstly, for each
such function F : {\textSigma}{\textomega}
{\textrightarrow}{\textGamma}{\textomega}, one can
construct a deterministic B{\"u}chi automaton {$
\mathcal {A} $} accepting a dense {\textPi}20 -subset
of {\textSigma}{\textomega} such that the restriction
of F to L({$ \mathcal {A} $}) is continuous. Secondly,
we give a new proof of the decidability of the first
Baire class for synchronous {\textomega} -rational
functions from which we get an extension of this result
involving the notion of Wadge classes of regular
{\textomega} -languages.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhou:2021:ERV,
author = "Bo Zhou and Zhenan Li and Haiyan Guo",
title = "Extremal Results on Vertex and Link Residual
Closeness",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "08",
pages = "921--941",
month = dec,
year = "2021",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054121500295",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 27 06:45:24 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500295",
abstract = "Robustness of the network topology is a key aspect in
the design of computer networks. Vertex (Link,
respectively) residual closeness is a new
graph-theoretic concept defined as a measure of network
robustness due to the failure of individual vertices
(links, respectively). In this paper, we identify the
trees and unicyclic graphs with the first a few
smallest vertex residual closeness, and determine the
graphs that minimize or maximize the vertex (link,
respectively) residual closeness over some classes of
graphs.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lu:2021:UMM,
author = "Huazhong L{\"u} and Tingzeng Wu",
title = "Unpaired Many-to-Many Disjoint Path Cover of Balanced
Hypercubest",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "08",
pages = "943--956",
month = dec,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500301",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 27 06:45:24 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500301",
abstract = "A many-to-many k -disjoint path cover ( k -DPC) of a
graph G is a set of k vertex-disjoint paths joining k
distinct pairs of source and sink in which each vertex
of G is contained exactly once in a path. The balanced
hypercube BHn, a variant of the hypercube, was
introduced as a desired interconnection network
topology. Let S =
{s1,s2,{\textellipsis},s2n{\textminus}2} and T =
{t1,t2,{\textellipsis},t2n{\textminus}2} be any two
sets of vertices in different partite sets of BHn ( n
{\textgreaterequal} 2 ). Cheng et al. in [ Appl. Math.
Comput. 242 (2014) 127--142] proved that there exists
paired many-to-many 2-disjoint path cover of BHn when
|S| = |T| = 2. In this paper, we prove that there
exists unpaired many-to-many (2n {\textminus} 2)
-disjoint path cover of BHn ( n {\textgreaterequal} 2 )
from S to T, which has improved some known results. The
upper bound 2n {\textminus} 2 is best possible in terms
of the number of disjoint paths in unpaired
many-to-many k -DPC of BHn.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Shen:2021:NHA,
author = "Chenli Shen and Wensong Lin",
title = "{NP}-Hardness and Approximation Algorithms for
Iterative Pricing on Social Networks with
Externalities",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "08",
pages = "957--979",
month = dec,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500313",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 27 06:45:24 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500313",
abstract = "We study how a monopolist seller should price an
indivisible product iteratively to the consumers who
are connected by a known link-weighted directed social
network. For two consumers u and v, there is an arc
directed from u to v if and only if v is a fashion
leader of u. Assuming complete information about the
network, the seller offers consumers a sequence of
prices over time and the goal is to obtain the maximum
revenue. We assume that the consumers buy the product
as soon as the seller posts a price not greater than
their valuations of the product. The product's value
for a consumer is determined by three factors: a fixed
consumer specified intrinsic value and a variable
positive (resp. negative) externality that is exerted
from the consumer's out(resp. in)-neighbours. The
setting of positive externality is that the influence
of fashion leaders on a consumer is the total weight of
links from herself to her fashion leaders who have
owned the product, and more fashion leaders of a
consumer owning the product will increase the influence
(external value) on the consumer. And the setting of
negative externalities is that the product's value of
showing off for a consumer is the total weight of links
from her followers who do not own the product to
herself, and more followers of a consumer owning the
product will decrease this external value for the
consumer. We confirm that finding an optimal iterative
pricing is NP-hard even for acyclic networks with
maximum total degree 3 and with all intrinsic values
zero. We design a greedy algorithm which achieves (n
{\textminus} 1) -approximation for networks with all
intrinsic values zero and show that the approximation
ratio n {\textminus} 1 is tight. Complementary to the
hardness result, we design a (1.8 +
\SGMLentity{"1d716}) -approximation algorithm for
Barab{\'a}si--Albert networks.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ryabko:2021:PRG,
author = "Boris Ryabko",
title = "A Pseudo-Random Generator Whose Output is a Normal
Sequence",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "08",
pages = "981--989",
month = dec,
year = "2021",
DOI = "https://doi.org/10.1142/S0129054121500325",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 27 06:45:24 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500325",
abstract = "",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Pseudo-random number generators (PRNGs) are widely
used in computer simulation, cryptography, and many
other fields. In this paper, we describe a PRNG class,
which, firstly, has been successfully tested using the
most powerful modern test batteries, and secondly, is
proved to consist of generators that generate normal
sequences. The latter property means that, for any
generated sequence $ x_1, x_2, \ldots {} $ and any
binary word $w$, we have $ \lim_{t \to \inf }_t(w) / (t
|w|) = 2^{ |w|}$, where $_t(w)$ is the number of
occurrences of $w$ in the sequence $ x_1, \ldots {},
x_{|w|}, x_2, \ldots {}, x_{|w| + 1}, \ldots {}, x_{t
|w| + 1}, \ldots {} x_t$.",
}
@Article{Anonymous:2021:AIV,
author = "Anonymous",
title = "Author Index Volume 32 (2021)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "32",
number = "08",
pages = "991--995",
month = dec,
year = "2021",
DOI = "https://doi.org/10.1142/S012905412199001X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 27 06:45:24 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412199001X",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Renjith:2022:HCK,
author = "P. Renjith and N. Sadagopan",
title = "{Hamiltonian} Cycle in {$ K_{1, r} $}-Free Split
Graphs --- a Dichotomy",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "01",
pages = "1--32",
month = jan,
year = "2022",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054121500337",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 21 06:18:43 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500337",
abstract = "For an optimization problem known to be NP-Hard, the
dichotomy study investigates the reduction instances to
determine the line separating polynomial-time solvable
vs NP-Hard instances (easy vs hard instances). In this
paper, we investigate the well-studied Hamiltonian
cycle problem (HCYCLE), and present an interesting
dichotomy result on split graphs. T. Akiyama et al.
(1980) have shown that HCYCLE is NP-complete on planar
bipartite graphs with maximum degree 3. We use this
result to show that HCYCLE is NP-complete for K1,5
-free split graphs. Further, we present polynomial-time
algorithms for Hamiltonian cycle in K1,3 -free and K1,4
-free split graphs. We believe that the structural
results presented in this paper can be used to show
similar dichotomy result for Hamiltonian path problem
and other variants of Hamiltonian cycle (path)
problems.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2022:FEC,
author = "Pingshan Li and Rong Liu and Xianglin Liu",
title = "The {(E)FTSM-(edge)} Connectivity of {Cayley} Graphs
Generated by Transposition Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "01",
pages = "33--43",
month = jan,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054121500349",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 21 06:18:43 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500349",
abstract = "The Cayley graph generated by a transposition tree
{\textGamma}n is a class of Cayley graphs that contains
the star graph and the bubble sort graph. A graph G is
called strongly Menger (SM for short) (edge) connected
if each pair of vertices x,y are connected by
{mindG(x),dG(y)} (edge)-disjoint paths, where
dG(x),dG(y) are the degree of x and y respectively. In
this paper, the maximally edge-fault-tolerant and the
maximally vertex-fault-tolerant of {\textGamma}n with
respect to the SM-property are found and thus
generalize or improve the results in [19, 20, 22, 26]
on this topic.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Costa:2022:OGB,
author = "Jos{\'e} Carlos Costa and Concei{\c{c}}{\~a}o Nogueira
and Maria Lurdes Teixeira",
title = "The Overlap Gap Between Left-Infinite and
Right-Infinite Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "01",
pages = "45--53",
month = jan,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054121500350",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 21 06:18:43 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500350",
abstract = "We study ultimate periodicity properties related to
overlaps between the suffixes of a left-infinite word
{\textlambda} and the prefixes of a right-infinite word
{\textrho}. The main theorem states that the set of
minimum lengths of words x and x{\prime} such that
x{\textlambda}n = {\textrho}nx{\prime} or
{\textlambda}nx = x{\prime}{\textrho} n is finite,
where n runs over positive integers and {\textlambda}n
and {\textrho}n are respectively the suffix of
{\textlambda} and the prefix of {\textrho} of length n
, if and only if {\textlambda} and {\textrho} are
ultimately periodic words of the form {\textlambda} =
u{\textminus}{\textinfinity} v and {\textrho} =
wu{\textinfinity} for some finite words u, v and w.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chen:2022:CSI,
author = "Yen Hung Chen",
title = "The Clustered Selected-Internal {Steiner} Tree
Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "01",
pages = "55--66",
month = jan,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054121500362",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 21 06:18:43 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500362",
abstract = "Given a complete graph G = (V,E), with nonnegative
edge costs, two subsets R \subset V and R{\prime}
\subset R, a partition {$ \cal R $} =
{R1,R2,{\textellipsis},Rk} of R, Ri {\textintersection}
Rj = \phi, i{\textnotequal}j and {$ \cal R $}{\prime} =
{R 1{\prime},R 2{\prime},{\textellipsis},R k{\prime}}
of R{\prime}, Ri{\prime} \subset R i, a clustered
Steiner tree is a tree T of G that spans all vertices
in R such that T can be cut into k subtrees Ti by
removing k {\textminus} 1 edges and each subtree Ti
spans all vertices in Ri, 1 {\textlessequal} i
{\textlessequal} k. The cost of a clustered Steiner
tree is defined to be the sum of the costs of all its
edges. A clustered selected-internal Steiner tree of G
is a clustered Steiner tree for R if all vertices in
Ri{\prime} are internal vertices of Ti. The clustered
selected-internal Steiner tree problem is concerned
with the determination of a clustered selected-internal
Steiner tree T for R and R{\prime} in G with minimum
cost. In this paper, we present the first known
approximation algorithm with performance ratio
({\textrho} + 4) for the clustered selected-internal
Steiner tree problem, where {\textrho} is the
best-known performance ratio for the Steiner tree
problem.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhuang:2022:CDG,
author = "Hongbin Zhuang and Wenzhong Guo and Xiaoyan Li and
Ximeng Liu and Cheng-Kuan Lin",
title = "The Component Diagnosability of General Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "01",
pages = "67--89",
month = jan,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054121500374",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Jan 21 06:18:43 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054121500374",
abstract = "The processor failures in a multiprocessor system have
a negative impact on its distributed computing
efficiency. Because of the rapid expansion of
multiprocessor systems, the importance of fault
diagnosis is becoming increasingly prominent. The h
-component diagnosability of G, denoted by cth(G), is
the maximum number of nodes of the faulty set F that is
correctly identified in a system, and the number of
components in G {\textminus} F is at least h. In this
paper, we determine the (h + 1) -component
diagnosability of general networks under the PMC model
and MM$^\star $ model. As applications, the component
diagnosability is explored for some well-known
networks, including complete cubic networks,
hierarchical cubic networks, generalized exchanged
hypercubes, dual-cube-like networks, hierarchical
hypercubes, Cayley graphs generated by transposition
trees (except star graphs), and DQcube as well.
Furthermore, we provide some comparison results between
the component diagnosability and other fault
diagnosabilities.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{BoavidaDeBrito:2022:PMC,
author = "Vasco {Boavida De Brito} and Jos{\'e} F{\'e}lix Costa
and Diogo Po{\c{c}}as",
title = "The Power of Machines That Control Experiments",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "02",
pages = "91--118",
month = feb,
year = "2022",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054122500010",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 10 06:21:57 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500010",
abstract = "We consider the experimenter (e.g. the experimental
physicist) as a Turing machine --- the digital
component --- and the experiment of measurement --- the
analog component --- as an oracle to the Turing
machine. The algorithm running in the machine abstracts
the experimental method of measurement (encoding the
recursive structure of experimental actions) chosen by
the experimenter. In this paper we prove that the
central analogue-digital complexity classes P, P/poly
and P/poly{\textintersection}REC can be characterized
in terms of protocols to perform measurements
controlled by standard Turing machines.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Tran:2022:SCW,
author = "Tien Tran and Dung T. Huynh",
title = "Symmetric Connectivity in Wireless Sensor Networks
with $ \pi / 3 $ Directional Antennas",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "02",
pages = "119--140",
month = feb,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122500022",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 10 06:21:57 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500022",
abstract = "Directional Wireless Sensor Networks (DWSNs) have been
a very active research topic as they have a wide range
of applications in both military and civilian areas. In
this paper, we study the Antenna Orientation ( AO ) and
Antenna Orientation and Power Assignment ( AOPA )
problems, two important issues in DWSNs. In the AO
problem, given a set V of sensors equipped with
directional antennas with beam-width
\SGMLentity{"1d703} = {\textpi}/3, the objective is to
determine an orientation of the antennas and a minimum
transmission range r = O(1) such that the induced
symmetric communication graph is connected. We prove
that the AO problem is NP-hard. We then extend our
proof technique and show that the AOPA problem for
DWSNs equipped with {\textpi}/3 directional antennas is
also NP-hard where we have to determine an orientation
of the antennas as well as a power assignment r to the
nodes such that the resulting symmetric communication
graph is connected, and (2)
{\textSigma}u{\textelement}Sr(u){\textbeta} is
minimized ( {\textbeta} is the distance-power gradient,
2 {\textlessequal} {\textbeta} {\textlessequal} 6 ). We
propose an O(n2) heuristic algorithm and demonstrate by
simulation that our method is better than the Ice-cream
method.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lin:2022:OPD,
author = "Chih-Yuan Lin and Jia-Jie Liu and Yue-Li Wang and
William Chung-Kung Yen and Chiun-Chieh Hsu",
title = "The Outer-Paired Domination of Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "02",
pages = "141--148",
month = feb,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122500034",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 10 06:21:57 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500034",
abstract = "In this paper, we introduce a new variant of
domination called the outer-paired domination. For a
graph G = (V,E), an outer-paired dominating set D
{\^a} V is a dominating set of G such that the induced
subgraph of V {\^a} D contains a perfect matching. The
outer-paired domination number of a graph G is the
cardinality of a minimum outer-paired dominating set of
G . We show that finding the outer-paired domination
number of a graph G is NP-hard on bipartite graphs,
chordal graphs, and planar graphs. We also propose a
linear-time algorithm for solving the outer-paired
domination problem on trees.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhou:2022:SCO,
author = "Hongyu Zhou and Xinmin Hou",
title = "Strongly Connected Orientation with Minimum
Lexicographic Order of Indegrees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "02",
pages = "149--153",
month = feb,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122500046",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 10 06:21:57 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500046",
abstract = "Given a simple undirected graph G, an orientation of
G is to assign every edge of G a direction. Borradaile
et al gave a greedy algorithm SC-Path-Reversal (in
polynomial time) which finds a strongly connected
orientation that minimizes the maximum indegree, and
conjectured that SC-Path-Reversal is indeed optimal for
the ''minimizing the lexicographic order'' objective as
well. In this note, we give a positive answer to the
conjecture, which is that we show that the algorithm
SC-PATH-REVERSAL finds a strongly connected orientation
that minimizes the lexicographic order of indegrees.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cheng:2022:ECS,
author = "Dongqin Cheng",
title = "Extra Connectivity and Structure Connectivity of
2-Dimensional Torus Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "02",
pages = "155--173",
month = feb,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122500058",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Mar 10 06:21:57 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500058",
abstract = "The 2-dimensional torus networks, denoted by T(m,n),
is a special case of the famous n -dimensional torus
network. The extra connectivity, structure connectivity
and sub-structure connectivity are generalized
connectivity to measure the fault-tolerance of the
networks. In this paper, we show the 1-extra
connectivity of T(m,n) for m {\textgreaterequal} 3 and
n {\textgreaterequal} 4 and 2-extra connectivity of
T(3,n) for n {\textgreaterequal} 4 . We also determine
the H -structure connectivity and H -substructure
connectivity of 2-dimensional torus network T(m,n) ( m
{\textgreaterequal} 3 and n {\textgreaterequal} 4 )
when the structure subgraph H {\textelement}{K1,r,Pk},
where 2 {\textlessequal} r {\textlessequal} 4 and 4
{\textlessequal} k {\textlessequal} 8 . These results
are sharp since the connectivity of T(m,n) ( m
{\textgreaterequal} 3,n {\textgreaterequal} 3 ) is 4.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Csuhaj-Varju:2022:P,
author = "Erzs{\'e}bet Csuhaj-Varj{\'u} and P{\'a}l
D{\"o}m{\"o}si and Gy{\"o}rgy Vaszil",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "3--4",
pages = "175--178",
month = apr # "--" # jun,
year = "2022",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054122020014",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat May 21 10:52:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122020014",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: 15th International Conference on
Automata and Formal Languages",
}
@Article{Alhazov:2022:TPS,
author = "Artiom Alhazov and Rudolf Freund and Sergiu Ivanov and
Sergey Verlan",
title = "Tissue {P} Systems with Vesicles of Multisets",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "3--4",
pages = "179--202",
month = apr # "--" # jun,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122410015",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat May 21 10:52:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122410015",
abstract = "We consider tissue P systems working on vesicles of
multisets with the very simple operations of insertion,
deletion, and substitution of single objects. With the
whole multiset being enclosed in a vesicle, sending it
to a target cell can be indicated in those simple rules
working on the multiset. As derivation modes we
consider the sequential derivation mode, where, if
possible, one rule is applied in a derivation step, and
the set maximally parallel derivation mode, where in
each derivation step a non-extendable set of rules
indicating the same target cell is applied. With the
set maximally parallel derivation mode, computational
completeness can already be obtained with tissue P
systems having a tree structure, whereas tissue P
systems even with an arbitrary communication structure
are not computationally complete when working in the
sequential mode. Adding polarizations --- only the
three polarizations $ - 1, 0, 1 $ are sufficient ---
allows for obtaining computational completeness even
for tissue P systems working in the sequential mode.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: 15th International Conference on
Automata and Formal Languages",
}
@Article{Blanchet-Sadri:2022:DWL,
author = "Francine Blanchet-Sadri and Kun Chen and Kenneth
Hawes",
title = "{Dyck} Words, Lattice Paths, and {Abelian} Borders",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "3--4",
pages = "203--226",
month = apr # "--" # jun,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122410027",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat May 21 10:52:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122410027",
abstract = "We use results on Dyck words and lattice paths to
derive a formula for the exact number of binary words
of a given length with a given minimal abelian border
length, tightening a bound on that number from
Christodoulakis et al. (Discrete Applied Mathematics,
2014). We extend to any number of distinct abelian
borders a result of Rampersad et al. (Developments in
Language Theory, 2013) on the exact number of binary
words of a given length with no abelian borders. We
also generalize these results to partial words.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: 15th International Conference on
Automata and Formal Languages",
}
@Article{Droste:2022:TPC,
author = "Manfred Droste and Zolt{\'a}n {\'E}sik and Werner
Kuich",
title = "The Triple-Pair Construction for Weighted $ \omega
$-Pushdown Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "3--4",
pages = "227--246",
month = apr # "--" # jun,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122410039",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat May 21 10:52:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122410039",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: 15th International Conference on
Automata and Formal Languages",
}
@Article{Gelle:2022:DCR,
author = "Kitti Gelle and Szabolcs Iv{\'a}n",
title = "Descriptive Complexity of Reversible Languages Having
Finitely Many Reduced Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "3--4",
pages = "247--262",
month = apr # "--" # jun,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122410040",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat May 21 10:52:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122410040",
abstract = "Reversible forms of computations are often interesting
from an energy efficiency point of view. When the
computation device in question is an automaton, it is
known that the minimal reversible automaton recognizing
a given language is not necessarily unique, moreover,
there are languages having arbitrarily large reversible
recognizers possessing no nontrivial ``reversible''
congruence. Building atop on our earlier result, we
show that the corresponding decision problem is
NL-complete, and that even in the case when there are
only finitely many such reversible recognizers, the
largest one among them can be exponentially larger than
the minimal automaton. Both results hold for the case
of binary alphabets.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: 15th International Conference on
Automata and Formal Languages",
}
@Article{Guillon:2022:WSI,
author = "Bruno Guillon and Giovanna J. Lavado and Giovanni
Pighizzini and Luca Prigioniero",
title = "Weakly and Strongly Irreversible Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "3--4",
pages = "263--284",
month = apr # "--" # jun,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122410052",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat May 21 10:52:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122410052",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: 15th International Conference on
Automata and Formal Languages",
}
@Article{Holzer:2022:IDD,
author = "Markus Holzer and Martin Kutrib and Andreas Malcher
and Matthias Wendlandt",
title = "Input-Driven Double-Head Pushdown Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "3--4",
pages = "285--311",
month = apr # "--" # jun,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122410064",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat May 21 10:52:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122410064",
abstract = "We introduce and study input-driven deterministic and
nondeterministic double-head pushdown automata. A
double-head pushdown automaton is a slight
generalization of an ordinary pushdown automaton
working with two input heads that move in opposite
directions on the common input tape. In every step one
head is moved and the automaton decides on acceptance
if the heads meet. Demanding the automaton to work
input-driven it is required that every input symbol
uniquely defines the action on the pushdown store
(push, pop, state change). Normally this is modeled by
a partition of the input alphabet and is called a
signature. Since our automaton model works with two
heads either both heads respect the same signature or
each head owes its own signature. This results in two
variants of input-driven double-head pushdown automata.
The induced language families on input-driven
double-head pushdown automata are studied from the
perspectives of their language describing capability,
their closure properties, and decision problems.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: 15th International Conference on
Automata and Formal Languages",
}
@Article{Marais:2022:DCN,
author = "Laurette Marais and Lynette van Zijl",
title = "Descriptional Complexity of Non-Unary Self-Verifying
Symmetric Difference Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "3--4",
pages = "313--333",
month = apr # "--" # jun,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122410076",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat May 21 10:52:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122410076",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: 15th International Conference on
Automata and Formal Languages",
}
@Article{Martisko:2022:CGS,
author = "Jakub Marti{\v{s}}ko and Alexander Meduna and
Zbyn{\v{e}}k K{\v{r}}ivka",
title = "{CD} Grammar Systems with Two Propagating Scattered
Context Components Characterize the Family of Context
Sensitive Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "3--4",
pages = "335--348",
month = apr # "--" # jun,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122410088",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat May 21 10:52:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122410088",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: 15th International Conference on
Automata and Formal Languages",
}
@Article{Nakanishi:2022:EAC,
author = "Masaki Nakanishi and Kamil Khadiev and Krisjanis
Prusis and Jevgenijs Vihrovs and Abuzer
Yakary{\i}lmaz",
title = "Exact Affine Counter Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "3--4",
pages = "349--370",
month = apr # "--" # jun,
year = "2022",
DOI = "https://doi.org/10.1142/S012905412241009X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat May 21 10:52:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412241009X",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: 15th International Conference on
Automata and Formal Languages",
}
@Article{Platek:2022:OWR,
author = "Martin Pl{\'a}tek and Friedrich Otto and
Franti{\v{s}}ek Mr{\'a}z",
title = "One-Way Restarting Automata and Their Sensitivities",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "3--4",
pages = "371--387",
month = apr # "--" # jun,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122410106",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat May 21 10:52:13 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122410106",
abstract = "Here we establish and study some rigorous tools
suitable for the lexicalized syntactic analysis (LSA)
of natural and formal languages. Motivated by the
linguistic method of analysis by reduction, we are
interested in correctness preserving LSA. We introduce
a suitable model of automata, the h-lexicalized one-way
restarting automata (h-RRWW), and compare the
properties of their input languages, which are the
languages considered traditionally in automata theory,
to the properties of the so-called basic and h-proper
languages. These languages form the basic components
for LSA. With respect to their input languages,
h-RRWW-automata are not sensitive to the size of the
read/write window and they allow computations that are
far from being correctness preserving. On the other
hand, for their basic and h-proper languages,
h-RRWW-automata ensure that the resulting computations
are completely correctness preserving, and they yield
infinite ascending hierarchies of language classes
within the regular, the context-free, and the
context-sensitive languages that are based on the size
of the read/write window.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: 15th International Conference on
Automata and Formal Languages",
}
@Article{Mahalingam:2022:HPT,
author = "Kalpana Mahalingam and Palak Pandoh",
title = "{HV}-Palindromes in Two-Dimensional Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "05",
pages = "389--409",
month = aug,
year = "2022",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905412250006X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 2 11:22:43 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412250006X",
abstract = "A two-dimensional (2D) word is a 2D palindrome if it
is equal to its reverse and it is an HV-palindrome if
all its columns and rows are 1D palindromes. We
characterize such words and study some of their
combinatorial and structural properties. We also find
the number of possible palindromic conjugates of a 2D
word. We investigate an upper bound on the number of
distinct non-empty HV-palindromic subwords in any
finite 2D word, thus, proving the conjecture given by
Anisiu et al. We also identify the minimum number of
HV-palindromic subwords in an infinite 2D word over a
finite alphabet.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Han:2022:MEP,
author = "Yijie Han and Xin He",
title = "More Efficient Parallel Integer Sorting",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "05",
pages = "411--427",
month = aug,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122500071",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 2 11:22:43 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500071",
abstract = "We present a more efficient CREW PRAM algorithm for
integer sorting. This algorithm sorts n integers in {0,
1, 2,{\textellipsis},n1/2} in O((log n)3/2/loglog n)
time and O(n(log n/ loglog n)1/2) operations. It also
sorts n integers in {0, 1, 2,{\textellipsis},n
{\textminus} 1} in O((log n)3/2/ loglog n) time and
O(n(log n/loglog n)1/2logloglog n) operations. Previous
best algorithm [15] on both cases has time complexity
O(log n) but operation complexity O(n(log n)1/2) .",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yildirim:2022:IRT,
author = "Halil {\. I}brahim Yildirim and Zeynep Nihan
Berberler",
title = "Isolated Rupture in Thorny Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "05",
pages = "429--438",
month = aug,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122500083",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 2 11:22:43 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500083",
abstract = "The robustness evaluates the capability of networks in
resisting failures or attacks on some parts of
networks. The concept of vulnerability is very
important in network analysis. Isolated rupture degree
is a novel graph-theoretic concept defined as a measure
of network vulnerability. In this paper, the
relationships between isolated rupture degree and some
other vulnerability parameters such as isolated
scattering number and isolated toughness are
established. Exact values for isolated rupture degree
of thorny networks are obtained.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Feng:2022:SPK,
author = "Kai Feng",
title = "Subnetwork Preclusion of $ (n, k) $-Star Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "05",
pages = "439--451",
month = aug,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122500095",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 2 11:22:43 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500095",
abstract = "The (n,k) -star graph Sn,k, which is introduced to
address scaling issues of the star graph, is recognized
as an attractive interconnection network topology for
building multiprocessor systems because of its
desirable properties. Let Fm(Sn,k) be the minimum
number of faulty vertices that make every subgraph
isomorphic to Sn{\textminus}m,k{\textminus}m faulty in
Sn,k under vertex-failure model, where 0
{\textlessequal} m {\textlessequal} k {\textminus} 1 .
In this paper, we prove that F0(Sn,k) = 1, F1(Sn,k) =
n, Fk{\textminus}1(Sn,k) = n!/(n {\textminus} k + 1)!
, and n!/(n {\textminus} m)! {\textlessequal} Fm(Sn,k)
{\textlessequal} k{\textminus}2 m{\textminus}1n!/(n
{\textminus} m)! {\textminus} 2 k{\textminus}3
m{\textminus}1n!/(n {\textminus} m + 1)! for 1
{\textlessequal} k {\textlessequal} n {\textminus} 2
and 2 {\textlessequal} m {\textlessequal} k
{\textminus} 2 .",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Kumar:2022:NAT,
author = "Sunil Kumar and Harshdeep Singh and Gaurav Mittal",
title = "A Novel Approach Towards Degree and {Walsh}-Transform
of {Boolean} Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "05",
pages = "453--479",
month = aug,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122500101",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Sep 2 11:22:43 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500101",
abstract = "Boolean functions are fundamental bricks in the
development of various applications in Cryptography and
Coding theory by making benefit from the weights of
related Boolean functions (Walsh spectrum). Towards
this, the discrete Fourier transform (Walsh--Hadamard)
plays a pivotal tool. The work in this paper is
dedicated towards the algebraic and numerical degrees,
together with the relationship between weights of
Boolean function and their Walsh transforms. We
introduce Walsh matrices and generalize them to any
arbitrary Boolean function. This improves the
complexity in computation of Walsh--Hadamard and
Fourier transform in certain cases. We also discuss
some useful results related to the degree of the
algebraic normal form using Walsh--Hadamard
transform.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Liu:2022:P,
author = "Jia-Bao Liu and Muhammad Javaid and Mohammad Reza
Farahani",
title = "Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "481--487",
month = sep # "--" # nov,
year = "2022",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054122020026",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122020026",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Raju:2022:SEM,
author = "Konduru Upendra Raju and Amutha Prabha Nagarajan",
title = "A Steganography Embedding Method Based on {CDF-DWT}
Technique for Reversible Data Hiding Application Using
{Elgamal} Algorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "489--512",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420011",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420011",
abstract = "Steganography is a data hiding method mainly used in
the security purposes. While hiding more data in the
embedding process the data may be lost and also cause
some security problems. To avoid this problem a
Steganography Embedding method is used. In this
manuscript, Steganography Embedding method based on
Cohen--Daubechies--Feauveau Discrete Wavelet Transform
(CDF-DWT) technique to data hiding application using
Elgamal algorithm is proposed. In this the cover image
is taken for hiding the secret data. Then the cover
image edges are detected and filtered with Speeded-Up
Robust Features (SURF) method. Then the input secret
data is encrypted with Elgamal algorithm. Then the
secret data is hided under cover image for obtaining
the stego image by process of Embedding using CDF DWT
technique. In this data in the stego images are
unreadable. To get readable secured data is extracted
from the stego image and the data's are decrypted to
get secured secret data. The objective of this method
is to safe guard the secret using Steganography method
and to increase embedding efficiency, Embedding
capacity and carrier capacity and to reduce the
execution time. The MATLAB simulation results of the
proposed CDF DWT technique with Elgamal algorithm
portrays better outcomes such as Peak to Signal Noise
Ratio (PSNR), Mean Square Error (MSE) (lower), Bit
Error Rate (BER) was Lower, Execution time provides is
lower, Carrier Capacity and Embedding Capacity are much
higher and the values are compared with the existing
method such as Elliptic Galois in cryptography and in
the Steganography method with Adaptive Firefly
Algorithm (EGC-AFA), Reversible Data hiding within
Encrypted images Via Adaptive Embedding Strategy with
block selection (RDHEI-AES), Double Linear Regression
Prediction based Reversible Data Hiding in Encrypted
Image (DLRP-RDHEI) respectively.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Ibrahim:2022:MMC,
author = "Salisu Ibrahim",
title = "Mathematical Modelling and Computational Analysis of
{Covid-19} Epidemic in {Erbil Kurdistan} Using Modified
{Lagrange} Interpolating Polynomial",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "513--529",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420023",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420023",
abstract = "In 2020 world commonly faced a kind of epidemic virus,
which is known as COVID-19 and it was the reason of
many people's death in the world that leads to hard
economic situation all over the country, also Iraq was
part of the infected country most especially Erbil.
Data was collected for the months of July, August, and
September regarding the test, positive, recovery, and
dead results for covid-19 cases in Erbil, Iraq. Based
on the obtained data's, new modified Lagrange
Interpolating polynomial method was derived and proof.
The modified Lagrange interpolation polynomial method
is very important tool for analyzing, predicting,
forecasting, and interpolating high-order polynomials.
Moreover, we model, predict, and investigate the test,
positive, recovery, and dead results for covid-19 cases
in Erbil, Iraq within certain period of time. Our
results are well validated and supported by MATLAB.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Saad:2022:SSC,
author = "Aldosary Saad and Abdullah Alharbi",
title = "Securing Smart City Services in Cyber-Physical Systems
Using the Computation Annealed Selection Process",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "531--557",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420035",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420035",
abstract = "Cyber-physical systems in a smart city environment
offer secure computations in addition to robust
resources and secure information exchanges. From the
security aspect, the selection of legitimate computing
resources is considered the most trustworthy measure
for preserving user and data privacy. However, the
outlier information results in false computations and
time-consuming privacy measures for smart city users.
This article introduces the Computation Annealed
Selection Process (CASP) for combating outlier
information in cyber-physical system networks. This
process is assimilated with different infrastructure
units in the smart city in an adaptable fashion. The
adaptive measure administers information and user
privacy through mutual time-key-based authentication.
Information privacy is endured until the smart city
provider provides a valid service interval. W2The
service interval is evaluated for its consistency in
maintaining the privacy and is validated using
decision-tree learning. The decision tree performs
interval classification and key assignment
recommendations. Based on the decisions, the privacy is
either prolonged or withdrawn for the information
exchanged between the users and service providers. This
process is repeated until the end of the service
interval, identifying the outlier information in
legitimate intervals. The proposed process improves
detection, legitimacy rate, interval time, and interval
rate by 7.57\%, 10.4\%, 13.15\%, and 7.59\%,
respectively.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Raghavendra:2022:MSP,
author = "S. Raghavendra and A. Harshavardhan and S. Neelakandan
and R. Partheepan and Ranjan Walia and V. Chandra
Shekhar Rao",
title = "Multilayer Stacked Probabilistic Belief Network-Based
Brain Tumor Segmentation and Classification",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "559--582",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420047",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420047",
abstract = "One of the deadliest diseases in the world is brain
cancer. Children and adults are also susceptible to
this malignancy. It also has the poorest rate of
survival and comes in a variety of shapes, textures,
and sizes, depending on where it is found. Bad things
will happen if the tumour brain is misclassified. As a
reason, early detection of the right kind and grade of
tumour is critical in determining the best treatment
strategy. Brain tumours may be identified by looking at
magnetic resonance imaging (MRI) pictures of the
patient's brain. The manual method becomes
time-consuming and may lead to human mistakes due to
the huge quantities of data and the different kinds of
brain tumours. As a result, a computer-assisted
diagnostic (CAD) system is needed. Image categorization
methods have advanced significantly in recent years,
particularly deep learning networks, which have
achieved success in this field. In this case, we used a
multilayer stacked probabilistic belief network to
accurately classify brain tumors. Here the MRI brain
images are Pre-processed using the Hybrid Butter worth
Anisotropic filter and contrast Blow up Histogram
Equalization. Followed by pre-processing, the denoised
image can be segmented by using the bounding box U-NET
segmentation methodology. Then after segmenting the
target, the specialized features regarding the tumor
can be extracted using the In-depth atom embedding
method. Then they obtained can reduce feature
dimensionality by using the Backward feature
eliminating green wing optimization. The extracted
features can be given as input for the classification
process. A Multilayer stacked probabilistic belief
network is then used to classify the tumour as
malignant or benign. The suggested system's efficacy
was tested on the BraTS dataset, which yielded a high
level of accuracy. Subjective comparison study is also
performed out among the suggested technique and certain
state-of-the-art methods, according to the work
presented. Experiments show that the proposed system
outperforms current methods in terms of assisting
radiologists in identifying the size, shape, and
location of tumors in the human brain.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Liu:2022:MMM,
author = "Changwei Liu and Kexin Wang and Aman Wu",
title = "Management and Monitoring of Multi-Behavior
Recommendation Systems Using Graph Convolutional Neural
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "583--601",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420059",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420059",
abstract = "Different recommendation algorithms, which often use
only a single type of user-item engagement, are plagued
by imbalanced datasets and cold start problems.
Multi-behavior recommendations, which takes advantage
of a variety of customer interaction including click
and favorites, can be a good option. Early attempts at
multi-behavior suggestion tried to consider the varying
levels of effect each behavior has on the target
behavior. They also disregard the meanings of
behaviors, which are implicit in multi-behavior
information. Because of these two flaws, the
information isn't being completely utilized to improve
suggestion performance on the specific behavior. In
this paper, we take a novel response to the situation
by creating a unified network to capture multi-behavior
information and displaying the MBGCNNN model
(Multi-Behavior Graph Convolutional Neural Network).
MBGCNN may effectively overcome the constraints of
prior studies by learning behavior intensity via the
user-item dissemination level and collecting behavior
interpretation via the items dissemination level.
Practical derives from various data sets back up our
model's order to leverage multi-behavior data. On real
methods, our approach beats the average background by
25.02 percent and 6.51 percent, respectively.
Additional research on cold-start consumers supports
the viability of our suggested approach.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Li:2022:FCB,
author = "Kun Li and Yanjun Chen",
title = "Fuzzy Clustering-Based Financial Data Mining System
Analysis and Design",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "603--624",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420060",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420060",
abstract = "This paper is based on fuzzy clustering algorithm on
financial data, design of financial data mining system
and analysis of financial data, analysis of financial
data on the financial decision-making mechanism, from
financial data how to enhance the information base of
the forecast, financial data how to improve the
pertinence of decision-making, financial data how to
build a new competitive advantage, financial data how
to promote the dynamic decision-making of four, through
the analysis of data in financial decision-making
specific implementation cases, focusing on the
real-life problems faced by the management and the
effect of financial data platform to solve problems;
finally, through this paper, we hope to provide
reference and reference for other similar enterprises
to apply financial data for financial decision-making.
This paper first describes the theory of financial
data, analyzes the mechanism of financial data and
financial decision-making, how financial data enhance
the information base of forecasting, how financial data
improve the pertinence of decision-making, how
financial data build a new competitive advantage, how
financial data promote dynamic decision-making four
dimensions to summarize.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Priya:2022:IQS,
author = "R. Priya and N. Sivakumar",
title = "Improving the Quality of Service {(QoS)} and Resource
Allocation in Vehicular Platoon Using Meta-Heuristic
Optimization Algorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "625--647",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420072",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420072",
abstract = "The concept of vehicular platooning is emerging due to
its self-driving capability, whereas a set of cars are
arranged closely and that can drive safely even in high
speed. Moreover the communication can also takes place
between two platoons and hence the platoon leader can
control the speed and direction. Traffic difficulties,
like as collisions and delay at road junctions, need
the use of platoon mechanisms. The most efficient
vehicle traffic management in platoons is acknowledged
in Intelligent Transportation System (ITS) for
improving energy efficiency, road capacity, and road
safety. Essentially, it is critical to analyse the
connection characteristic of any two platoons in order
to improve connectivity. As a result, under
bi-directional platoon architecture, the possibility of
connectivity between platoon members and Road Side
Units (RSUs) is generated. Providing Quality of Service
(QoS) to automotive network is difficult issue because
elements such as asynchronous transmission or high
mobility, crowded and fragmented channels, hardware
defects, and various vehicular gadgets. As a result, it
is extremely desired to utilize and distribute
resources efficiently. Despite the existence of other
bio-inspired meta-heuristic optimization methods, the
Bacterial Foraging Algorithm has the benefit of
simplicity and efficiency, and so may be used to a wide
range of engineering applications. However, in the
event of sophisticated analysis, the constraint is a
lower convergence rate. To improve resource allocation,
this study employs the Improved Bacterial Foraging
Optimization based Channel Allocation (IBFOCA)
technique. Set of channels allocated to platoon members
are signified as bacteria's position. By using latency,
Signal-to-Interference Ratio (SINR) and Quality of
Service (QoS), available channel is initially
determined. This approach is used to find a channel
that is acceptable for platoon members. Simulation
results are used to examine the presentation of
multi-channel distributions in platoons utilizing
suggested optimization strategy. Signal-to-interference
ratio is lowered by 29 decibel, throughput is raised by
69 kilobits per second, collision probability is
reduced by 21.4 percent, and average batch size is 57
percent with a delay of 49 milliseconds.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Shi:2022:FDO,
author = "Feng Shi and Xiaomei Hu",
title = "Fuzzy Dynamic Obstacle Avoidance Algorithm for
Basketball Robot Based on Multi-Sensor Data Fusion
Technology",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "649--666",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420084",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420084",
abstract = "This paper uses multi-sensor data fusion technology to
design and develop a multi-sensor based basketball
robot's target recognition and positioning system in an
unknown environment. We establish the movement model of
the basketball robot, and combine the hardware
configuration of the basketball robot, analyse the
methods of speed control, position control, and
direction control, propose a fuzzy obstacle avoidance
strategy in the basketball robot movement process, and
simulate the obstacle avoidance strategy. The
simulation results show that the proposed fuzzy
obstacle avoidance strategy is effective. Carry out the
experiment of basketball robot target calibration,
build the basketball robot monitoring system, and
realize data transmission and real-time image
processing. Experiments show that the basketball robot
can achieve target recognition and positioning tasks in
an unknown environment (obstacle comparison rules). It
proves the effectiveness and robustness of the proposed
following algorithm. It illustrates the effectiveness
of the system designed in this paper.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Nadeem:2022:LNB,
author = "Muhammad Faisal Nadeem and Waqar Ali and Hafiz
Muhammad Afzal Siddiqui",
title = "Locating Number of Biswapped Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "667--690",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420096",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420096",
abstract = "A biswapped network is an interconnection network in
multiprocessor systems. These are networks of devices
or processors and connections of these devices or
processors. Here network can be expressed in the form
of a graph. Devices or processors represent vertices,
and the connection of devices or processors represents
edges. The subset of the nodes set is called the
resolving set if all the representations or codes are
different w.r.t. this subset gives the information
about the complete network. The minimum cardinality of
the resolving set is called the locating number. In
this article, we find the locating number of biswapped
interconnection networks. In this paper, We compute the
exact values of locating numbers for biswapped networks
generated by different families of underlying basis
networks like path, cycle, power of path, and complete.
We have also given the bounds of locating number of any
biswapped network generated by any underlying basis
network that consists of its clusters.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Zhang:2022:SACa,
author = "Qi Zhang and Guang Wen and Zhixin Chen and Qin Zhou
and Guoqi Xiang and Guangchun Yang and Xuegang Zhang",
title = "Sensitivity Analysis Contact Reliability of {VH-CATT}
Cylindrical Gear and Its Reliability with Material
Strength Degradation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "691--716",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420102",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420102",
abstract = "VH-CATT cylindrical gear is a new transmission
mechanism. In order to study the influence of design
parameters and material strength degradation of the
VH-CATT cylindrical gear on its transmission
reliability. The Kriging surrogate model based on
improved quantum particle swarm optimization (QPSO)
algorithm was used to establish the limit state
equation of contact stress for the VH-CATT cylindrical
gear based on the stress-strength interference theory.
The state equation of contact stress of the VH-CATT
cylindrical gear was obtained with higher precision.
Also, the strength degradation model with gamma
distribution was established by using the P-S-N curve
to estimate the parameters of the strength degradation
model with gamma distribution. The reliability
sensitivity of the VH-CATT cylindrical gear was
analyzed by improved first order second moment method
(AFOSM) based on the limit state equation of contact
stress of the VH-CATT cylindrical gear, the reliability
of gear considering strength degradation was studied by
using the improved first order second moment method
(AFOSM). The analysis results show that the failure
rate decreases with the increase of pressure Angle,
tooth width, modulus and tooth radius. The failure rate
increases with increasing torque. Strength degradation
has a certain influence on the reliability of gear and
opinion. And the reliability of the gear is lower than
that of the opinion, Strength degradation has a greater
influence on the failure probability of gear, at the
same time, the reliability of the gear pair decreases
with the strength degradation. After 15000 hours of
operation, the reliability of the gear pair is only
0.63155.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Zheng:2022:OOL,
author = "Yangfeng Zheng and Zheng Shao and Zhanghao Gao and
Mingming Deng and Xuesong Zhai",
title = "Optimizing the Online Learners' Verbal Intention
Classification Efficiency Based on the Multi-Head
Attention Mechanism Algorithm",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "717--733",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420114",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420114",
abstract = "To analyse speech intention based on discussion texts
in online collaborative discussions, automatic
classification of discussion texts is conducted to
assist teachers improve their abilities to diagnose and
analyse the discussion process. The current study
proposes a deep learning network model that
incorporates multi-head attention mechanism with
bidirectional long short-term memory (MA-BiLSTM). The
proposed algorithm acquires contextual semantic
connections from a global perspective and the role of
key feature words within sentences from a local
perspective to further strengthen the semantic features
of the texts. The proposed model was employed to
classify 12,000 interactive texts generated during
online collaborative discussion activities. Results
show that MA-BiLSTM achieved an overall classification
accuracy of 83.25\%, which is at least 2.83\% higher than
those of other baseline models. However, the
classification of consultative and administrative
interactive texts is minimally effective. MA-BiLSTM
achieved better than the existing classification
methods for interactive text classification.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Ni:2022:RPC,
author = "Zeqiang Ni and Lei Zhang and Junqing He",
title = "Recomputation of Public Capital Based on {PIM} and the
Effect on {China} Regional Economic Growth",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "735--753",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420126",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420126",
abstract = "This paper first reestimates the public capital stock
of each China province from 1994 to 2019 by improving
the computing method of the components of the perpetual
inventory method (PIM). Then, it brings the public
investment and public capital into the extended
Cobb--Douglas production function and explores the
mechanism of public investment affecting economic
growth from the regional perspective. Furthermore,
through the analysis of the Local Government Financing
Vehicles (LGFVs) as the major investor of local public
investment during the last two decades, This paper
confirms the importance of complementary factors such
as institutional innovation and effective management of
the public infrastructure in making public investment
an ``effective catalyst for growth'' (Kessides,
1993).",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Zhang:2022:SACb,
author = "Jiajing Zhang and Tingting Zhang and Jinlan Chen",
title = "Sentiment Analysis of {Chinese} Reviews Based on
{BiTCN}-Attention Model",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "755--770",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420138",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420138",
abstract = "It is of great significance for individuals,
enterprises, and government departments to analyze and
excavate the sentiment in the comments. Many deep
learning models are used for text sentiment analysis,
and the BiTCN model has good efficacy on sentiment
analysis. However, in the actual semantic expression,
the contribution of each word to the sentiment tendency
is different, BiTCN treats it fairly and does not pay
more attention to the key sentiment words. For this
problem, a sentiment analysis model based on the
BiTCN-Attention is proposed in this paper. The
Self-Attention mechanism and Multi-Head Self-Attention
mechanism are added to BiTCN respectively to form
BiTCN-SA and BiTCN-MHSA, which improve the weight of
sentiment words and the accuracy of feature extraction,
to increase the effect of sentiment analysis. The
experimental results show that the model accuracies of
BiTCN-SA and BiTCN-MHSA in the JingDong commodity
review data set are 3.96\% and 2.41\% higher than that of
BiTCN, respectively. In the comment data set of
DianPing, the accuracy of BiTCN-SA and BiTCN-MHSA
improved by 4.62\% and 3.49\%, respectively, compared
with that of BiTCN.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Wu:2022:GCN,
author = "Jian Wu and Chaoyu Yang",
title = "Graph Convolutional Network-Guided Mine Gas
Concentration Predictor",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "771--785",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S012905412242014X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412242014X",
abstract = "Coal mining work has always been a high-risk job,
although mining technology is now regularly very
mature, many accidents still occur every year in
various countries around the world, most of which are
due to gas explosions, poisoning, asphyxiation and
other accidents. Therefore it is important to monitor
and predict both underground mine air quality. In this
paper, we use the GCN spatio-temporal graph convolution
method based on spectral domain for multivariate time
series prediction of underground mine air environment.
The correlation of these sequences is learned by a
self-attentive mechanism, without a priori graph, and
the adjacency matrix with an attention mechanism is
created dynamically. The temporal and spatial features
are learned by graph Fourier transform and inverse
Fourier transform in TC module (temporal convolution)
and GC module (graph convolution), respectively.
Besides, the corresponding experimental predictions are
performed on other public datasets. And a new loss
function is designed based on the idea of residuals,
which greatly improves the prediction accuracy. In
addition, the corresponding experimental predictions
were performed on other public datasets. The results
show that this model has outstanding prediction ability
and high prediction accuracy on most time-series
prediction data sets. Through experimental
verification, this model has high prediction accuracy
for dealing with multivariate time series prediction
problems, both for long-term and short-term
prediction.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Ni:2022:HEB,
author = "Baixiu Ni and Ying Wang and Jingfu Huang and Guocheng
Li",
title = "Hybrid Enhanced Binary Honey Badger Algorithm with
Quadratic Programming for Cardinality Constrained
Portfolio Optimization",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "787--803",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420151",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420151",
abstract = "A portfolio selection problem with cardinality
constraints has been proved to be an NP-hard problem,
and it is difficult to solve by the traditional
optimization methods. This study considers it to be a
hybrid of a classical feature selection problem and a
standard mean-variance (MV) portfolio selection model.
In particular, we propose a new hybrid meta-heuristic
algorithm that combines an enhanced binary honey badger
algorithm (EBHBA) with quadratic programming to address
this issue. First, we employ the proposed EBHBA
algorithm to select a portfolio of K stocks from N
candidate stocks. Second, based on its choice we
transform the problem into a mean-variance model, whose
objective function could be defined as the fitness
function of EBHBA. Finally, the optimal solution to the
model could be found with the quadratic programming
method. We also test our approach using the benchmark
data sets available at the OR-Library involving real
capital markets, where indices are derived from major
stock markets around the world. Computational results
demonstrate that the proposed method can achieve a
satisfactory result for portfolio selection with
cardinality constraints and perform well in searching
non-dominated portfolios with high expected returns.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Sun:2022:RPH,
author = "Ziyi Sun and Jing Zhang",
title = "Research on Prediction of Housing Prices Based on
{GA-PSO-BP} Neural Network Model: Evidence from
{Chongqing, China}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "805--818",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420163",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420163",
abstract = "Since 2000, the real estate industry has experienced
rapid development, and at the same time, it has driven
the rapid growth of housing prices, and the trend of
housing prices has attracted attention. This paper
integrates genetic algorithm and particle swarm
algorithm to optimize BP neural network, and
establishes a housing price prediction model based on
mixed genetic particle swarm BP neural network. The
average data of housing prices in Chongqing, China from
2000 to 2020 and several main factors affecting the
trend of housing prices were selected as experimental
data. Through the training and simulation prediction
based on the mixed particle swarm BP neural network,
the error between the predicted value and the actual
value was within 0.5\%, the validity and accuracy of the
model are proved. At the same time, this paper predicts
the average price of residential commercial housing in
Chongqing in 2021, which provides a reference for the
government's macro-control and sellers to carry out
residential commercial housing.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Yu:2022:SAP,
author = "Liting Yu and Dongyan Liu and Nairu Xu",
title = "Special Aquatic Products Supply Chain Coordination
Considering Bilateral Green Input in the Context of
High-Quality Development",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "819--844",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420175",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420175",
abstract = "The high-quality development of fishery puts forward
two requirements for the supply of Aquatic
Products(AP): The first is to increase the supply of
high-quality, high-end and safe AP based on market
demand;The second is to promote green aquaculture.
Under this background, Special aquatic products (SAP)
have become the main force of green aquaculture due to
their higher nutritional value and good quality, the
green development of Special aquatic products supply
chain (SAPSC) can solve the urgent needs of consumers
for ``quality and healthy'' AP. Combining with the
characteristics that SAP farming is dominated by
producers, we construct the Stackelberg Model of
producer-dominated SAP, and analyze the different
operation results of SAP in traditional aquaculture
model(TAM) and green aquaculture model(GAM).
Furthermore, the paper studies the optimal
decision-making of supply chain based on the bilateral
green input of producers and retailers, and designs a
revenue-sharing contract(RSC) to coordinate the SAPSC.
The main results are as follows: Compared with TAM, the
demand for products under GAM is greater. And the
producers and retailers are more profitable. The basic
greenness and marketing level of the products have a
driving effect on green development of SAPSC. The RSC
is conducive to encouraging supply chain members to
make green inputs. Finally, by analyzing the contract
parameters and supply chain parameters, the validity of
the contract and the correctness of the conclusion are
verified.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Zhang:2022:ICO,
author = "Wei Zhang and Zhiguang Li",
title = "Identifying the Configurations to Operating Efficiency
in {China}'s Life Insurance Industry Using Fuzzy-Set
Qualitative Comparative Analysis",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "845--865",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420187",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420187",
abstract = "This paper aims to measure the operating efficiency of
22 Chinese domestic and foreign-funded life insurance
companies from 2013 to 2017 and outline the path to
achieve high-quality development. The DEA-Malmquist was
used to evaluate the total factor productivity on the
sample of 22 Chinese domestic and foreign-funded life
insurance companies. A fuzzy set qualitative
comparative analysis (fsQCA) was also used to analyze
the configuration of determinants affecting technical
efficiency. The results show that the overall operating
efficiency of life insurance companies in China is
relatively satisfying. The changes in total factor
productivity are mainly caused by changes in technical
efficiency and changes in efficiency. However, changes
in scale efficiency have little effect on Chinese
domestic and foreign-funded life insurance companies.
There is a significant difference in the operating
efficiency between Chinese domestic and foreign-funded
life insurance companies. In contrast, the operating
efficiency is slightly higher than that of
foreign-funded life insurance companies, which is
mainly reflected in the difference in pure technical
efficiency. The realization path of a life insurance
company's operating efficiency is primarily composed of
high employee education and low overclosing ratio, high
employee education and low reinsurance ratio, and
all-factor positive investment. The weak employee
quality and excessive overclosing are the main reasons
for the low operating efficiency of some enterprises.
This paper systematically analyzes the impact of the
organization's internal structure on the operating
efficiency of life insurance companies. Finally, based
on the configuration perspective, we explain the
internal logic and path of achieving better operating
efficiency. In the end, we also provide decision-making
references for further improving the efficient
operation of life insurance companies in China.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Xu:2022:ADA,
author = "Li-Jun Xu and Shou-Yu Wei and Xiao-Qing Lu and Ze-Hua
He and Jia-Ming Zhu",
title = "Algorithm Design for Asset Trading Under Multiple
Factors",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "867--886",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420199",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420199",
abstract = "For the strategy of investing in gold and Bitcoin,
first collect the historical prices of two types of
investment products in the market, and use the wavelet
neural network model and WT-LSTM model to model and
analyze to predict the future price trends of gold and
Bitcoin. Second, considering the difference in price
fluctuations between gold and Bitcoin, based on the
GARCH-EVT model to increase the risk uncertainty of
financial assets, proposes how to achieve the best
trading strategy under risk characteristics. Finally,
considering the influence of transaction rate on
income, we use particle swarm algorithm and genetic
algorithm to study what kind of transaction rate can
achieve maximum income. The study found that although
traders can predict future trends based on daily price
changes, due to the different risk factors of gold and
Bitcoin, and the different sensitivity of the two
financial assets to transaction costs, trading
strategies will be very different.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Yang:2022:IHD,
author = "Bin Yang and Jie Wang",
title = "An Improved Helmet Detection Algorithm Based on {YOLO
V4}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "887--902",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420205",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420205",
abstract = "The existing helmet detection algorithms have
disadvantages such as difficulty in detecting occluded
targets, small targets, etc. To address those problems,
a YOLO V4-based helmet detection improvement algorithm
has been proposed. Firstly, the model's backbone
structure is improved, and the backbone's multi-scale
feature extraction capability is enhanced by using MCM
modules with different sized convolutional kernels, the
FSM channel attention module is used to guide the model
to dynamically focus on the channel features of
extracted small targets and obscured target
information. Secondly, in order to optimize the model
training, the latest loss function Eiou is used to
replace Ciou for anchor frame regression prediction to
improve the convergence speed and regression accuracy
of the model. Finally, a helmet dataset is constructed
from this paper, and a K-means clustering algorithm is
used to cluster the helmet dataset and select the
appropriate a priori candidate frames. The experimental
results show that the improved algorithm has a
significant improvement in detection accuracy compared
with the original YOLO V4 algorithm, and can have a
positive detection effect on small targets and obscured
targets.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Xie:2022:SSP,
author = "Kai Xie and Zijian Wei and Kang Yin and Songsong Li
and Xinyan Yao and Xiaoyu Zhou",
title = "Structural Synthesis of {PLC} Program for Real-Time
Specification Patterns",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "903--929",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420217",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420217",
abstract = "Among all the reactive synthesis methods, the results
of the structural synthesis have the best
interpretability and traceability. However, existing
structural synthesis method cannot deal with real-time
specifications and specifications with circular
dependencies. A structural synthesis method for
Programmable Logic Controller programs is proposed.
First, a real-time specification pattern language,
RTSPS4Syn, is proposed. Under the condition that there
is no circular dependency between the specification
items, the implementations of a specification item are
assembled structurally from the implementation of its
scope and property expression; and the programs for the
specification items are concatenated according to the
order of priority and dependency to obtain the
synthesized program. This paper presents a method to
eliminate the circular dependence of specifications,
such that the synthesis approach can be applied to
specifications with circular dependency. Furthermore,
this paper presents an approach for setting the preset
values of timers when considering tolerance on the
duration of the delay. The synthesis method does not
need to check the conflict and determine the
nondeterministic part of the specifications. These
problems are solved in existing research by constraint
solving in PSPACE.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Mukhtar:2022:MPN,
author = "Salman Mukhtar and Muhammad Salman and Ayse Dilek
Maden and Masood Ur Rehman",
title = "Metric Properties of Non-Commuting Graph Associated to
Two Groups",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "931--952",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420229",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420229",
abstract = "The non-commuting graph associated to a group has
non-central elements of the graph as vertices and two
elements x and y do not form an edge if and only if xy
= yx . In this paper, we consider non-commuting graphs
associated to dihedral and semidihedral groups. We
investigate their metric properties such as center,
periphery, eccentric graph, closure and interior. We
also perform various types of metric identifications on
these graphs. Moreover, we generate metric and
metric-degree polynomials of these graphs.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Kirgiz:2022:NBS,
author = "Havva K{\i}rg{\i}z and A. Dilek Maden",
title = "New Bounds for Some Topological Indices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "6--7",
pages = "953--965",
month = sep # "--" # nov,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122420230",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Oct 19 07:46:36 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122420230",
abstract = "The biological, chemical, and structural properties of
molecular graphs can be predicted by using topological
indices. The lower and upper bounds of fundamental
topological indices are well-studied. In this paper, by
using comparison theorem for integrals, we obtain new
bounds for some topological indices namely, Randi{\'c}
index, Sombor index, harmonic index and forgotten
index.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Mathematical Aspects of Evolutionary
Computation and its Applications Guest Editors: Jia-Bao
Liu, Muhammad Javaid and Mohammad Reza Farahani",
}
@Article{Rovan:2022:FAS,
author = "Branislav Rovan and Andr{\'a}s Varga",
title = "Finite Approximations and Similarity of Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "08",
pages = "967--1003",
month = dec,
year = "2022",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054122500113",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:40 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500113",
abstract = "A new framework to measure distances (similarity)
between formal languages and between grammars based on
distances between words is introduced. It is based on
approximating languages by their finite subsets and
using monotone sequences of such finite approximations
to define an infinite language in the limit. Distances
between finite languages are defined and extended to
distances between monotone sequences of finite
languages leading to distances between infinite
languages. The framework captures several distances
studied in the literature. Context-free grammars with
energy are introduced to enable finite approximations
emphasizing ``syntactically important'' parts of words.
Grammars with energy are also used to extend distances
between monotone sequences of finite languages to
distances between context-free grammars. A basic
toolkit for monotone sequences of finite languages and
distances between languages resp. grammars is provided.
As part of this toolkit a non-symmetric version of
distances is defined, providing additional
characterisation of distances in general. Additional
properties of distances between grammars are derived by
restricting the``energy use'' of grammars with energy.
Some methods of estimating the distances are presented
to be used in cases where the distance is not
computable or difficult to compute.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Liu:2022:CEC,
author = "Xiaoqing Liu and Shuming Zhou and Hong Zhang and
Baohua Niu",
title = "The Component (Edge) Connectivity of Round Matching
Composition Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "08",
pages = "1005--1018",
month = dec,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122500125",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:40 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500125",
abstract = "The vertex (edge) connectivity has been regularly used
to measure the fault tolerance and reliability of
interconnection networks, while it has defects in the
assumption that all neighbors of one node will fail
concurrently. To overcome this deficiency, some new
generalizations of traditional connectivity have been
suggested to quantize the size or the number of the
connected components of the survival graph. The g
-component (edge) connectivity, one generalization of
vertex (edge) connectivity, has been proposed to
characterize the vulnerability of multiprocessor
systems based on the number of components of the
survival graph. In this paper, we determine the g
-component (edge) connectivity of a family of networks,
called the round matching composition networks RMCNs,
which are a class of networks composed of t ( t
{\textgreaterequal} 4 ) clusters with the same order,
linked by r perfect matchings. By exploring the
combinatorial properties and fault-tolerance of RMCNs,
we establish the g -component (edge) connectivity
c{\textkappa}g+1(G) = gk {\textminus} g2 + 3g for 2
{\textlessequal} g {\textlessequal} k + 3 and k
{\textgreaterequal} 2, c{\textlambda}3(G) = 2k + 3 and
c{\textlambda}4(G) = 3k + 4 for k {\textgreaterequal} 4
.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yu:2022:FTS,
author = "Zhengqin Yu and Shuming Zhou and Hong Zhang",
title = "Fault-Tolerant Strong {Menger} (Edge) Connectivity of
{DCC} Linear Congruential Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "08",
pages = "1019--1032",
month = dec,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122500137",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:40 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500137",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Dangalchev:2022:ACC,
author = "Chavdar Dangalchev",
title = "Additional Closeness of Cycle Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "08",
pages = "1033--1052",
month = dec,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122500149",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:40 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500149",
abstract = "The additional closeness is a very important
characteristic of graphs. It measures the maximal
closeness of a graph after adding a new link and it is
an indication of the growth potential of graphs'
closeness. Most of the time calculating the additional
closeness requires solving nontrivial optimization
problems. In this article, the additional closenesses
of cycles, gear, and some other graphs are calculated.
Bounds for additional closeness of graphs are
discussed.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Anonymous:2022:AIV,
author = "Anonymous",
title = "Author Index Volume 33 (2022)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "33",
number = "08",
pages = "1053--1058",
month = dec,
year = "2022",
DOI = "https://doi.org/10.1142/S0129054122990015",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:40 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122990015",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2023:EEC,
author = "Mingzu Zhang and Hongxi Liu and Pingping Li",
title = "Embedded Edge-Connectivity Reliability Evaluation of
Augmented Hypercube Interconnection Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "01",
pages = "1--10",
month = jan,
year = "2023",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054122500150",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:41 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500150",
abstract = "In the contemporary world, to meet the increasing need
to deal with massive data, the interconnection networks
for large-scale parallel and distributed systems need
to expand for stronger scalability requirements. Let Gn
be a recursive n -dimensional network. Since the
presence of faulty links or processors may disconnect
the entire network, one hopes that every remaining
processor lies in an undamaged lower-dimensional
subnetwork. Under this circumstance, in 2012, Yang and
Wang first proposed the conception of {\ell} -embedded
edge-connectivity {\texteta}{\ell}(Gn) of Gn, which is
defined as the minimum number of links whose removal
results in several disconnected components, and each
processor is contained in an {\ell} -dimensional
subnetwork G{\ell} . The augmented cube, denoted by
AQn, proposed by Choudum and Sunitha, is a momentous
variant of the hypercube as an interconnection topology
of parallel computing. It retains many favorable
properties of the hypercube and possesses several
embedded properties that the hypercube and other
variations do not have. For 0 {\textlessequal} {\ell}
{\textlessequal} n {\textminus} 1 and n
{\textgreaterequal} 1, this paper determines {\ell}
-embedded edge-connectivity of n -dimensional augmented
cube, {\texteta}{\ell}(AQn), and shows exact values
{\texteta}{\ell}(AQn) = 2{\ell}(2n {\textminus}
2{\ell}) {\textminus} {\textdelta}, where {\textdelta}
= 1 if {\ell} = 0, and {\textdelta} = 0 otherwise. The
parameters can provide more accurate measurements for
the reliability and fault-tolerance of the
corresponding systems.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Aytac:2023:AVS,
author = "Vecdi Ayta{\c{c}} and Tufan Turac{\i}",
title = "Analysis of Vulnerability of Some Transformation
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "01",
pages = "11--24",
month = jan,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122500162",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:41 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500162",
abstract = "In several different applications and contexts,
networks are essential frameworks and
appear.Vulnerability value is a measure of the
network's durability in the face of damage that may
lead to a reduction or complete loss of the network's
particular functionality. The domination number and
it's types can be used network vulnerability
parameters. Recently, the disjunctive total domination
number has been defined by Henning and Naicker. In this
paper, the disjunctive total domination numbers of the
transformation graph G++z when z = {+,{\textminus}} of
some graphs G have been obtained. Furthermore, some new
general results have been given for the parameter
mentioned above.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Bhagat:2023:OGW,
author = "Subhash Bhagat and Abhinav Chakraborty and Bibhuti Das
and Krishnendu Mukhopadhyaya",
title = "Optimal Gathering Over {Weber} Meeting Nodes in
Infinite Grid",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "01",
pages = "25--49",
month = jan,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122500174",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:41 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500174",
abstract = "The gathering over meeting nodes problem requires the
robots to gather at one of the pre-defined meeting
nodes. This paper investigates the problem with respect
to the objective function that minimizes the total
number of moves made by all the robots. In other words,
the sum of the distances traveled by all the robots is
minimized while accomplishing the gathering task. The
robots are deployed on the nodes of an anonymous
two-dimensional infinite grid which has a subset of
nodes marked as meeting nodes. The robots do not agree
on a global coordinate system and operate under an
asynchronous scheduler. A deterministic distributed
algorithm has been proposed to solve the problem for
all those solvable configurations, and the initial
configurations for which the problem is unsolvable have
been characterized. The proposed gathering algorithm is
optimal with respect to the total number of moves
performed by all the robots in order to finalize the
gathering.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Marchal:2023:MCT,
author = "Loris Marchal and Samuel McCauley and Bertrand Simon
and Fr{\'e}d{\'e}ric Vivien",
title = "Minimizing {I/Os} in Out-of-Core Task Tree
Scheduling",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "01",
pages = "51--80",
month = jan,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122500186",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:41 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500186",
abstract = "Scientific applications are usually described using
directed acyclic graphs, where nodes represent tasks
and edges represent dependencies between tasks. For
some applications, this graph is a tree: each task
produces a single result used solely by its parent. The
temporary results of each task have to be stored
between their production and their use. We focus on the
case when the data manipulated are very large. Then,
during an execution, all data may not fit together in
memory. In such a case, some data have to be
temporarily written to disk and evicted from memory.
These data are later read from disk when they are
needed for computation. These Input/Output operations
are very expensive; hence, our goal is to minimize
their total volume. The order in which the tasks are
processed considerably influences the amount of such
Input/Output operations. Finding the schedule which
minimizes this amount is an open problem that we
revisit in this paper. We first formalize and
generalize known results, and prove that existing
solutions can be arbitrarily worse than the optimal. We
then present an Integer Linear Program to solve it
optimally. Finally, we propose a novel heuristic
algorithm. We demonstrate its good performance through
simulations on both synthetic and realistic trees built
from actual scientific applications.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Moreira:2023:SII,
author = "Nelma Moreira and Rog{\'e}xrio Reis",
title = "Special Issue: 25th International Conference on
Developments in Language Theory ({DLT 2021}) ---
Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "2--3",
pages = "81--83",
month = feb # "--" # apr,
year = "2023",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905412302001X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:42 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412302001X",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Conference on
Developments in Language Theory (DLT) 2021 Guest
Editors: Nelma Moreira (University of Porto, Portugal)
and Rog{\'e}xrio Reis (University of Porto, Portugal)",
}
@Article{Cambie:2023:EBP,
author = "Stijn Cambie and Michiel de Bondt and Henk Don",
title = "Extremal Binary {PFAs} with Small Number of States",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "2--3",
pages = "85--115",
month = feb # "--" # apr,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122440038",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:42 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122440038",
abstract = "The largest known reset thresholds for DFAs are equal
to (n{\textminus}1)2 (n{\textminus}1)2 (n {\textminus}
1)2, where n n n is the number of states. This is
conjectured to be the maximum possible. PFAs (with
partial transition function) can have exponentially
large reset thresholds. This is still true if we
restrict to binary PFAs. However, asymptotics do not
give conclusions for fixed n n n . We prove that the
maximal reset threshold for binary PFAs is strictly
greater than (n{\textminus}1)2 (n{\textminus}1)2 (n
{\textminus} 1)2 if and only if n{\textgreaterequal}6
n{\textgreaterequal}6 n {\textgreaterequal} 6 . These
results are mostly based on the analysis of
synchronizing word lengths for a certain family of
binary PFAs. This family has the following properties:
it contains the well-known {\v{C}}ern{\'y} automata;
for n{\textlessequal}10 n{\textlessequal}10 n
{\textlessequal} 10 it contains a binary PFA with
maximal possible reset threshold; for all
n{\textgreaterequal}6 n{\textgreaterequal}6 n
{\textgreaterequal} 6 it contains a PFA with reset
threshold larger than the maximum known for DFAs.
Analysis of this family reveals remarkable patterns
involving the Fibonacci numbers and related sequences
such as the Padovan sequence. We derive explicit
formulas for the reset thresholds in terms of these
recurrent sequences. Asymptotically the {\v{C}}ern{\'y}
family gives reset thresholds of polynomial order. We
prove that PFAs in the family are not extremal for
n{\textgreaterequal}41 n{\textgreaterequal}41 n
{\textgreaterequal} 41 . For that purpose, we present
an improvement of Martyugin's prime number construction
of binary PFAs.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Conference on
Developments in Language Theory (DLT) 2021 Guest
Editors: Nelma Moreira (University of Porto, Portugal)
and Rog{\'e}xrio Reis (University of Porto, Portugal)",
}
@Article{Edixhoven:2023:BCR,
author = "Luc Edixhoven and Sung-Shik Jongmans",
title = "Balanced-by-Construction Regular and $ \omega
$-Regular Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "2--3",
pages = "117--144",
month = feb # "--" # apr,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122440026",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:42 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122440026",
abstract = "Paren n is the typical generalization of the Dyck
language to multiple types of parentheses. We
generalize its notion of balancedness to allow
parentheses of different types to freely commute. We
show that balanced regular and {\textomega}
{\textomega} {\textomega} -regular languages can be
characterized by syntactic constraints on regular and
{\textomega} {\textomega} {\textomega} -regular
expressions and, using the shuffle on trajectories
operator, we define grammars for
balanced-by-construction expressions with which one can
express every balanced regular and {\textomega}
{\textomega} {\textomega} -regular language.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Conference on
Developments in Language Theory (DLT) 2021 Guest
Editors: Nelma Moreira (University of Porto, Portugal)
and Rog{\'e}xrio Reis (University of Porto, Portugal)",
}
@Article{Frei:2023:TWN,
author = "Fabian Frei and Juraj Hromkovi{\v{c}} and Rastislav
Kr{\'a}lovi{\v{c}} and Richard Kr{\'a}lovi{\v{c}}",
title = "Two-Way Non-Uniform Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "2--3",
pages = "145--162",
month = feb # "--" # apr,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122440063",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:42 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122440063",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Conference on
Developments in Language Theory (DLT) 2021 Guest
Editors: Nelma Moreira (University of Porto, Portugal)
and Rog{\'e}xrio Reis (University of Porto, Portugal)",
}
@Article{Halava:2023:IWA,
author = "Vesa Halava and Tero Harju and Reino Niskanen and
Igor Potapov",
title = "Integer Weighted Automata on Infinite Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "2--3",
pages = "163--182",
month = feb # "--" # apr,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122440014",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:42 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122440014",
abstract = "In this paper we combine two classical generalisations
of finite automata (weighted automata and automata on
infinite words) into a model of integer weighted
automata on infinite words and study the universality
and the emptiness problems under zero weight
acceptance. We show that the universality problem is
undecidable for three-state automata by a direct
reduction from the infinite Post correspondence
problem. We also consider other more general acceptance
conditions as well as their complements with respect to
the universality and the emptiness problems.
Additionally, we build a universal integer weighted
automaton with fixed transitions. This automaton has an
additional integer input that allows it to simulate any
semi-Thue system.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Conference on
Developments in Language Theory (DLT) 2021 Guest
Editors: Nelma Moreira (University of Porto, Portugal)
and Rog{\'e}xrio Reis (University of Porto, Portugal)",
}
@Article{Henriksson:2023:FPF,
author = "Viktor Henriksson and Manfred Kufleitner",
title = "Forbidden Patterns for {FO$^2$} Alternation Over
Finite and Infinite Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "2--3",
pages = "183--224",
month = feb # "--" # apr,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054123440021",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:42 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123440021",
abstract = "We consider two-variable first-order logic FO 2 and
its quantifier alternation hierarchies over both finite
and infinite words. Our main results are forbidden
patterns for deterministic automata (finite words) and
for Carton-Michel automata (infinite words). In order
to give concise patterns, we allow the use of subwords
on paths in finite graphs. This concept is formalized
as subword-patterns. For certain types of
subword-patterns there exists a non-deterministic
logspace algorithm to decide their presence or absence
in a given automaton. In particular, this leads to NL
algorithms for deciding the levels of the FO 2
quantifier alternation hierarchies. This applies to
both full and half levels, each over finite and
infinite words. Moreover, we show that these problems
are NL-hard and, hence, NL-complete.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Conference on
Developments in Language Theory (DLT) 2021 Guest
Editors: Nelma Moreira (University of Porto, Portugal)
and Rog{\'e}xrio Reis (University of Porto, Portugal)",
}
@Article{Kutrib:2023:RTS,
author = "Martin Kutrib and Uwe Meyer",
title = "Reversible Top-Down Syntax Analysis",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "2--3",
pages = "225--251",
month = feb # "--" # apr,
year = "2023",
DOI = "https://doi.org/10.1142/S012905412244004X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:42 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412244004X",
abstract = "Top-down syntax analysis can be based on LL(k) LL(k)
LL(k) grammars. The canonical acceptors for LL(k) LL(k)
LL(k) languages are deterministic stateless pushdown
automata with input lookahead of size k k k . We
investigate the computational capacity of reversible
computations of such automata. A pushdown automaton
with lookahead k k k is said to be reversible if its
predecessor configurations can uniquely be computed by
a pushdown automaton with backward input lookahead
(lookback) of size k k k . It is shown that we cannot
trade a lookahead for states or vice versa. The impact
of having states or a lookahead depends on the
language. While reversible pushdown automata with
states accept all regular languages, we are going to
prove that there are regular languages that cannot be
accepted reversibly without states, even in case of an
arbitrarily large lookahead. This completes the
comparison of reversible with ordinary pushdown
automata in our setting. Moreover, it turns out that
there are problems which can be solved by reversible
deterministic stateless pushdown automata with
lookahead of size k+1 k+1 k + 1, but not by any
reversible deterministic stateless pushdown automaton
with lookahead of size k k k . So, an infinite and
tight hierarchy of language families dependent on the
size of the lookahead is shown. Finally, we prove that
the language families accepted by reversible
deterministic stateless pushdown automata with
lookahead of size k k k are not closed under standard
operations. For example, we show that the families are
anti-AFLs which are not closed under intersection.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Conference on
Developments in Language Theory (DLT) 2021 Guest
Editors: Nelma Moreira (University of Porto, Portugal)
and Rog{\'e}xrio Reis (University of Porto, Portugal)",
}
@Article{Maneth:2023:DRT,
author = "Sebastian Maneth and Helmut Seidl and Martin Vu",
title = "Definability Results for Top-Down Tree Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "2--3",
pages = "253--287",
month = feb # "--" # apr,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122440051",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:42 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122440051",
abstract = "Top-down tree transducers are well established
formalism for describing tree translations. Such
transducers can be further enhanced with look-ahead
allowing them to inspect input subtrees before
processing them. Oftentimes it is advantageous to know
when the look-ahead can be eliminated and the
translation be implemented by a simpler transducer. We
show that for a given top-down transducer with
look-ahead it is decidable whether or not its
translation is definable (1) by a linear deterministic
top-down tree transducer or (2) by a tree homomorphism.
We present algorithms that construct equivalent such
transducers if they exist. Our results also apply to
bottom-up transducers as well as compositions of
transducers.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Conference on
Developments in Language Theory (DLT) 2021 Guest
Editors: Nelma Moreira (University of Porto, Portugal)
and Rog{\'e}xrio Reis (University of Porto, Portugal)",
}
@Article{Mrykhin:2023:HLK,
author = "Mikhail Mrykhin and Alexander Okhotin",
title = "The Hardest {LL($k$)} Language",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "2--3",
pages = "289--319",
month = feb # "--" # apr,
year = "2023",
DOI = "https://doi.org/10.1142/S012905412344001X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:42 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412344001X",
abstract = "This paper establishes an analogue of Greibach's
hardest language theorem (``The hardest context-free
language'', SIAM J. Comp., 1973,
https://doi.org/10.1137/0202025 ) for the classical
family of LL(k) languages. The first result is that
there is a language L0 defined by an LL(1) grammar in
the Greibach normal form, to which every language L
defined by an LL(1) grammar in the Greibach normal form
can be reduced by a homomorphism, that is, w
{\textelement} L w {\textelement} L w {\textelement} L
if and only if h(w) {\textelement} L0 h(w)
{\textelement} L0 h(w) {\textelement} L0 . Then it is
shown that this statement does not hold for the full
class of LL(k) languages. The other hardest language
theorem is then established in the following form:
there is a language L0 defined by an LL(1) grammar in
the Greibach normal form, such that, for every language
L defined by an LL(k) grammar, with
k{\textgreaterequal}1 k{\textgreaterequal}1 k
{\textgreaterequal} 1, there exists a homomorphism h h
h, for which w {\textelement} L w {\textelement} L w
{\textelement} L if and only if h(w$) h(w$) h(w$)
{\textelement } {\textelement } {\textelement } L0
\ldots {}",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Conference on
Developments in Language Theory (DLT) 2021 Guest
Editors: Nelma Moreira (University of Porto, Portugal)
and Rog{\'e}xrio Reis (University of Porto, Portugal)",
}
@Article{Pape-Lange:2023:TUB,
author = "Julian Pape-Lange",
title = "Tight Upper Bounds on Distinct Maximal
(Sub-){Repetitions} in Highly Compressible Strings",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "2--3",
pages = "321--345",
month = feb # "--" # apr,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122440075",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Mar 21 06:31:42 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122440075",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Conference on
Developments in Language Theory (DLT) 2021 Guest
Editors: Nelma Moreira (University of Porto, Portugal)
and Rog{\'e}xrio Reis (University of Porto, Portugal)",
}
@Article{Lin:2023:GBP,
author = "Lan Lin and Yixun Lin",
title = "Graph Bipartization Problem with Applications to Via
Minimization in {VLSI} Design",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "04",
pages = "347--361",
month = jun,
year = "2023",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054122500198",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jun 1 14:50:04 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500198",
abstract = "The bipartization problem for a graph G asks for
finding a subset S of V (G) such that the induced
subgraph G[S] is bipartite and |S| is maximized. This
problem has significant applications in the via
minimization of VLSI design. The problem has been
proved NP-complete and the fixed parameter solvability
has been known in the literature. This paper presents
several polynomial-time algorithms for special graph
families, such as split graphs, co-bipartite graphs,
chordal graphs, and permutation graphs.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yildirim:2023:IRC,
author = "Halil {\. I}brahim Yildirim and Zeynep Nihan
Berberler",
title = "Isolated Rupture in Composite Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "04",
pages = "363--371",
month = jun,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122500204",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jun 1 14:50:04 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500204",
abstract = "Computer networks are prone to targeted attacks and
random failures. Robustness is a measure of an ability
of a network to continue functioning when part of the
network is either naturally damaged or targeted for
attack. The study of network robustness is a critical
tool in the characterization and understanding of
complex interconnected systems. There are several
proposed graph metrics that predicates network
resilience against such attacks. Isolated rupture
degree is a novel graph-theoretic concept defined as a
measure of network vulnerability. Isolated rupture
degree is argued as an appropriate measure for
modelling the robustness of network topologies in the
face of possible node destruction. In this paper, the
relationships between isolated rupture degree and some
other graph parameters such as connectivity, covering
number, minimum vertex degree are established. The
isolated rupture degrees of 2K2 -free graphs, middle
graphs, corona graphs of a middle graph and a complete
graph K2 on two vertices are evaluated, then compared
and the more stable graph types are reported. A sharp
upper bound for the isolated rupture degree of middle
graphs is established.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yang:2023:RGU,
author = "Zhiyao Yang and Pinhui Ke and Zhixiong Chen and
Chenhuang Wu",
title = "Results on the {Gowers} {U2} Norm of Generalized
{Boolean} Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "04",
pages = "373--393",
month = jun,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122500216",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jun 1 14:50:04 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500216",
abstract = "Recently, a framework for employing the Gowers U2 norm
in the context of (generalized) Boolean functions with
cryptographic significance was introduced. In this
paper, we first give tight bounds on the Gowers U2 norm
of generalized Boolean functions via the (generalized)
sum-of-squares indicator. Secondly, we provide a
framework for the generalized signal-to-noise ratio (
{$ \mathcal {G} $$ \mathcal{S} $$ \mathcal {N} $$ \cal
R $ }) of generalized (n, m) - functions. We
characterize the { $ \mathcal {G} $$ \mathcal {S} $$
\mathcal {N} $$ \cal R $} in terms of the Gowers U2
norm. In particular, we present a direct link between
the {$ \mathcal {G} $$ \mathcal{S} $$ \mathcal {N} $$
\cal R $ } of a class of generalized Boolean functions
and the { $ \mathcal {S} $$ \mathcal {N} $ $ \cal R $ }
of its component Boolean functions. Finally, the
expressions of the Gowers U2 norm of generalized
Boolean functions from some well - known secondary
constructions (the concatenation and Carlet's
construction) are obtained.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2023:CCA,
author = "Hong Zhang and Shuming Zhou and Qifan Zhang",
title = "Component Connectivity of Alternating Group Networks
and Godan Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "04",
pages = "395--410",
month = jun,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122500228",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jun 1 14:50:04 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500228",
abstract = "Connectivity is an important index to evaluate the
reliability and fault tolerance of a graph. As a
natural extension of the connectivity of graphs, the g
-component connectivity of a graph G, denoted by
c{\textkappa}g(G), is the minimum number of vertices
whose removal from G results in a disconnected graph
with at least g components. It is a scientific issue to
determine the exact values of c{\textkappa}g(G) for
distinguishing the fault tolerability of networks.
However, g -component connectivity of many well-known
interconnection networks has not been explored even for
small g{\prime}s . For the n -dimensional alternating
group networks ANn and n -dimensional godan graphs EAn
, we show that c{\textkappa}5(ANn) = 4n {\textminus} 8
for n {\textgreaterequal} 6, and c{\textkappa}g(EAn) =
(g {\textminus} 2)(n {\textminus} 2) + n for g
{\textelement}{3, 4, 5} and n {\textgreaterequal} 4 .",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Gazdag:2023:CHC,
author = "Zsolt Gazdag and S{\'a}ndor V{\'a}gv{\"o}lgyi",
title = "The Component Hierarchy of Chain-Free Cooperating
Distributed Regular Tree Grammars Revisited",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "04",
pages = "411--427",
month = jun,
year = "2023",
DOI = "https://doi.org/10.1142/S012905412250023X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jun 1 14:50:04 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412250023X",
abstract = "We denote by cf-CD-RTG{\^a} pounds (n) the class of
tree languages generated by chain-free distributed
regular tree grammars of n components cooperating with
terminal strategy. D{\'a}nyi and F{\"u}l{\"o}p [2]
showed that the hierarchy cf-CD-RTG{\^a} pounds (n), n
{\textgreaterequal} 1 contains an infinite proper
hierarchy. We improve their result showing that for
each n {\textgreaterequal} 2, cf-CD-RTG{\^a} pounds (n
{\textminus} 1) {\^a} cf-CD-RTG{\^a} pounds (n + 1) .",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Park:2023:PDP,
author = "Jung-Heum Park",
title = "Paired 3-Disjoint Path Covers in Bipartite Torus-Like
Graphs with Edge Faults",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "04",
pages = "429--441",
month = jun,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122500241",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Jun 1 14:50:04 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500241",
abstract = "Given two disjoint vertex-sets, S =
{s1,{\textellipsis},sk} and T = {t1,{\textellipsis},tk}
in a graph, a paired many-to-many k -disjoint path
cover joining S and T is a set of pairwise
vertex-disjoint paths {P1,{\textellipsis},Pk} that
altogether cover every vertex of the graph, in which
each path Pi runs from si to ti . In this paper, we
reveal that a bipartite torus-like graph, if built from
lower dimensional torus-like graphs that have good
disjoint-path-cover properties, retain such good
property. As a result, an m -dimensional bipartite
torus, m {\textgreaterequal} 3, with at most 2m
{\textminus} 4 edge faults has a paired many-to-many 3
-disjoint path cover joining arbitrary disjoint sets S
and T of size 3 each such that S {\textunion} T
contains the equal numbers of vertices from different
parts of the bipartition.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ma:2023:SMC,
author = "Meijie Ma and Chaoming Guo and and Xiang-Jun Li",
title = "Strong {Menger} Connectivity of Folded Hypercubes with
Faulty Subcube",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "05",
pages = "443--451",
month = aug,
year = "2023",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054122500253",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Aug 18 08:50:35 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500253",
abstract = "Menger-type problems in interconnection networks have
received many attentions in recent years. A connected
graph G is strong Menger (edge) connected if there are
{mindG(u),dG(v)} vertex (edge)-disjoint paths joining
any two distinct vertices u and v in G . Fault
tolerance is an important criterion in the design of
interconnection networks. The folded hypercube FQn is
an important variant of hypercube Qn which remains many
desirable properties of hypercube. We consider the
strong Menger connectivity of folded hypercubes when
part of the network is faulty. We show that FQn
{\textminus} Qs (1 {\textlessequal} s {\textlessequal}
n {\textminus} 1) is strong Menger (edge) connected.
Which means that when a subcube Qs is faulty, the
surviving graph FQn {\textminus} Qs is strong Menger
(edge) connected. This generalizes the result of FQn in
[ J. Parallel Distrib. Comput. 138 (2020) 190--198].",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Jansson:2023:OAN,
author = "Jesper Jansson and Christos Levcopoulos and and
Andrzej Lingas",
title = "Online and Approximate Network Construction from
Bounded Connectivity Constraints",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "05",
pages = "453--468",
month = aug,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122500265",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Aug 18 08:50:35 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500265",
abstract = "The Network Construction problem, studied by Angluin
et al., Hosoda et al., and others, asks for a
minimum-cost network satisfying a set of connectivity
constraints which specify subsets of the vertices in
the network that have to form connected subgraphs. More
formally, given a set V of vertices, construction costs
for all possible edges between pairs of vertices from V,
and a sequence S1,S2,{\textellipsis},Sr \subseteq V of
connectivity constraints, the objective is to find a
set E of edges such that each Si induces a connected
subgraph of the graph (V,E) and the total cost of E is
minimized. First, we study the online version where
every constraint must be satisfied immediately after
its arrival and edges that have already been added can
never be removed. We give an O(B2log n) -competitive
and O((B +log r)log n) -competitive polynomial-time
algorithms, where B is an upper bound on the size of
constraints, while r,n denote the number of constraints
and the number of vertices, respectively. On the other
hand, we observe that an {\textOmega}(B) -competitive
lower bound as well as an {\textOmega}(B) -competitive
lower bound in the cost-uniform case are implied by the
known lower bounds for unbounded constraints. For the
cost-uniform case with unbounded constraints, we
provide an O(n(log n +log r)) -competitive upper bound
with high probability. The latter bound is against an
oblivious adversary while our other randomized
competitive bounds are against an adaptive adversary.
Next, we discuss a hybrid approximation method for the
(offline) Network Construction problem combining an
approximation algorithm of Hosoda et al. with one of
Angluin et al. and an application of the hybrid method
to bioinformatics. Finally, we consider a natural
strengthening of the connectivity requirements in the
Network Construction problem, where each constraint has
to induce a subgraph (of the constructed graph) of
diameter at most d . Among other things, we provide a
polynomial-time (B 2 {\textminus} B + 2)B 2
-approximation algorithm for the Network Construction
problem with the d -diameter requirements, when each
constraint has at most B vertices, and show the
APX-completeness of this variant.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Zhang:2023:FTS,
author = "Hong Zhang and Shuming Zhou and and Baohua Niu",
title = "Fault-Tolerance of Star Graph Based on Subgraph Fault
Pattern",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "05",
pages = "469--485",
month = aug,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122500277",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Aug 18 08:50:35 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500277",
abstract = "Traditional fault tolerability is regularly measured
by classical vertex or edge connectivity. Menger's
theorem shows that the number of (edge)-disjoint paths
is closely related to (edge) connectivity. Clearly,
disjoint paths not only provide alternative routings to
tolerate faulty vertices but also avoid communication
bottlenecks. Furthermore, disjoint paths can speed up
the transmission time by distributing data among
disjoint paths. In order to assess the fault tolerance
of the network objectively, we aim to extend vertex or
edge failures to substructure malfunction. In this
paper, we show the maximum number of vertex
(edge)-disjoint paths in star graph in the case of
genetic substructure faults. Let Sk ( 1
{\textlessequal} k {\textlessequal} n {\textminus} 1 )
be a k -dimensional substar of Sn . We show that there
exist {mindSn{\textminus}Sk(u),dSn{\textminus}Sk(v)}
vertex (edge)-disjoint paths to connect any two
vertices u and v in Sn {\textminus} Sk, where
dSn{\textminus}Sk(u) is the degree of vertex u in Sn
{\textminus} Sk . In addition, we show that (edge)
connectivity and 1 -extra connectivity of Sn
{\textminus} Sk are n {\textminus} 2, 2n {\textminus}
5, respectively.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Asano:2023:TPA,
author = "Tetsuo Asano",
title = "Transportation Problem Allowing Sending and Bringing
Back",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "05",
pages = "487--505",
month = aug,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122500289",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Aug 18 08:50:35 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500289",
abstract = "This paper considers a transportation problem on a
weighted graph. The weights specify the amounts of
commodities at nodes, which are positive if the amounts
are stored at nodes and negative if the amounts are
needed at nodes. To meet all demands we use vehicles,
one at each node, with some loading capacity to and
from neighbors. In a trip using a vehicle we can send
commodities from a node to a neighbor along an edge and
also bring back some other commodities from the
neighbor. In this paper we are interested in
feasibility problem, which is to decide whether there
is a single round of trips that meet all demands. We
prove the feasibility problem is NP-complete even in
the easiest case of a one-commodity transportation
problem with unbounded capacity. We also present
several different polynomial-time algorithms for other
cases.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Touili:2023:RAS,
author = "Tayssir Touili and Xin Ye",
title = "Reachability Analysis of Self Modifying Code",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "05",
pages = "507--536",
month = aug,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122500290",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Fri Aug 18 08:50:35 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ijfcs.bib;
http://www.worldscientific.com/loi/ijfcs",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122500290",
abstract = "A Self modifying code is code that modifies its own
instructions during execution time. It is nowadays
widely used, especially in malware to make the code
hard to analyse and to detect by anti-viruses. Thus,
the analysis of such self modifying programs is a big
challenge. Pushdown systems (PDSs) is a natural model
that is extensively used for the analysis of sequential
programs because they allow to accurately model
procedure calls and mimic the program's stack. In this
work, we propose to extend the PushDown System model
with self-modifying rules. We call the new model
Self-Modifying PushDown System (SM-PDS). A SM-PDS is a
PDS that can modify its own set of transitions during
execution. We show how SM-PDSs can be used to naturally
represent self-modifying programs and provide efficient
algorithms to compute the backward and forward
reachable configurations of SM-PDSs. We implemented our
techniques in a tool and obtained encouraging results.
In particular, we successfully applied our tool for the
detection of self-modifying malware.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Droste:2023:SII,
author = "Manfred Droste and George Rahonis and and Arto
Salomaa",
title = "Special Issue: {International Colloquium: Recent
Advances of Quantitative Models in Computer Science
(RAQM 2021) --- Preface}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "06",
pages = "537--538",
month = sep,
year = "2023",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054123020033",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 27 06:17:21 MDT 2023",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123020033",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Colloquium: Recent
Advances of Quantitative Models in Computer Science
(RAQM 2021) Guest Editors: Manfred Droste (University
of Leipzig, Germany), George Rahonis (University of
Thessaloniki, Greece) and Arto Salomaa (University of
Turku, Finland)",
}
@Article{Blattmann:2023:CCW,
author = "Malte Blattmann and Andreas Maletti",
title = "Compositions with Constant Weighted Extended Tree
Transducers",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "06",
pages = "539--558",
month = sep,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054122450010",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 27 06:17:21 MDT 2023",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054122450010",
abstract = "Conjecture 11 of [Lagoutte, Maletti: Survey ---
Weighted extended top-down tree transducers --- Part
III: Composition. Proc. AFCS, LNCS 7020, p. 272--308,
Springer 2011] is confirmed. It is demonstrated that
the composition of a constant weighted extended tree
transducer with a linear weighted top-down tree
transducer can be computed by a single weighted
extended tree transducer. Whereas linearity and the
top-down property are syntactic, the constant property
is semantic. The decidability of the constant property
is investigated in several restricted settings.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Colloquium: Recent
Advances of Quantitative Models in Computer Science
(RAQM 2021) Guest Editors: Manfred Droste (University
of Leipzig, Germany), George Rahonis (University of
Thessaloniki, Greece) and Arto Salomaa (University of
Turku, Finland)",
}
@Article{Pittou:2023:MUA,
author = "Maria Pittou and George Rahonis",
title = "Modelling Uncertainty in Architectures of Parametric
Component-Based Systems",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "06",
pages = "559--601",
month = sep,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054123450028",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 27 06:17:21 MDT 2023",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123450028",
abstract = "In this paper, we propose a logic-based
characterization of uncertainty in architectures of
parametric component-based systems, where the parameter
is the number of instances of each component type. For
this, we firstly introduce an extended propositional
interaction logic over De Morgan algebras and we show
that its formulas can encode the uncertainty of several
architectures applied in systems with a finite number
of components. In turn, we introduce a first-order
extended interaction logic over De Morgan algebras
which is applied for modelling uncertainty in the
interactions of well-known parametric architectures.
Moreover, we prove that the equivalence problem for a
large class of formulas of that logic is decidable in
doubly exponential time by providing an effective
translation to fuzzy recognizable series. For any such
formula over a totally ordered De Morgan algebra, we
further prove that we can compute in exponential time
the set of sequences of parametric fuzzy interactions
which ensure the trustworthiness of the formula
according to a particular threshold.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Colloquium: Recent
Advances of Quantitative Models in Computer Science
(RAQM 2021) Guest Editors: Manfred Droste (University
of Leipzig, Germany), George Rahonis (University of
Thessaloniki, Greece) and Arto Salomaa (University of
Turku, Finland)",
}
@Article{Paraponiari:2023:FPC,
author = "Paulina Paraponiari",
title = "Fuzzy Propositional Configuration Logics",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "06",
pages = "603--631",
month = sep,
year = "2023",
DOI = "https://doi.org/10.1142/S012905412345003X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 27 06:17:21 MDT 2023",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412345003X",
abstract = "We introduce and investigate a weighted propositional
configuration logic over De Morgan algebras. This logic
is able to describe software architectures with
quantitative features especially the uncertainty of the
interactions that occur in the architecture. We deal
with the equivalence problem of formulas in our logic
by showing that every formula can be written in a
specific form. Surprisingly, there are formulas which
are equivalent only over specific De Morgan algebras.
We provide examples of formulas in our logic which
describe well-known software architectures equipped
with quantitative features such as the uncertainty and
reliability of their interactions.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Colloquium: Recent
Advances of Quantitative Models in Computer Science
(RAQM 2021) Guest Editors: Manfred Droste (University
of Leipzig, Germany), George Rahonis (University of
Thessaloniki, Greece) and Arto Salomaa (University of
Turku, Finland)",
}
@Article{Droste:2023:DBF,
author = "Manfred Droste and Zolt{\'a}n F{\"u}l{\"o}p and and
D{\'a}vid K{\'o}sz{\'o}",
title = "Decidability Boundaries for the Finite-Image Property
of Weighted Finite Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "06",
pages = "633--653",
month = sep,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054123450041",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 27 06:17:21 MDT 2023",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123450041",
abstract = "A weighted finite automaton has the finite-image
property if the image of the weighted language
associated with it is finite. We show two
undecidability results concerning the finite-image
property of weighted finite automata over semirings,
respectively strong bimonoids. Firstly, we give a
computable idempotent commutative past-finite ordered
semiring such that it is undecidable, for an arbitrary
deterministic weighted finite automaton {$ \mathcal {A}
$} \ldots{} has the finite-image property. Secondly, we
give a computable commutative past-finite monotonic
ordered strong bimonoid such that it is undecidable,
for an arbitrary weighted finite automaton \ldots{}
over that strong bimonoid, whether \ldots{} has the
finite-image property. This shows that recent
decidability results for suitable weighted finite
automata over past-finite monotonic strong bimonoids
cannot be extended to natural classes of ordered
semirings and ordered strong bimonoids without further
assumptions.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Colloquium: Recent
Advances of Quantitative Models in Computer Science
(RAQM 2021) Guest Editors: Manfred Droste (University
of Leipzig, Germany), George Rahonis (University of
Thessaloniki, Greece) and Arto Salomaa (University of
Turku, Finland)",
}
@Article{Bondar:2023:CRA,
author = "Eugenija A. Bondar and David Casas and and Mikhail V.
Volkov",
title = "Completely Reachable Automata: an Interplay Between
Automata, Graphs, and Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "34",
number = "06",
pages = "655--690",
month = sep,
year = "2023",
DOI = "https://doi.org/10.1142/S0129054123450053",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Wed Sep 27 06:17:21 MDT 2023",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123450053",
abstract = "A deterministic finite automaton in which every
non-empty set of states occurs as the image of the
whole state set under the action of a suitable input
word is called completely reachable. We characterize
such automata in terms of graphs and trees.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: International Colloquium: Recent
Advances of Quantitative Models in Computer Science
(RAQM 2021) Guest Editors: Manfred Droste (University
of Leipzig, Germany), George Rahonis (University of
Thessaloniki, Greece) and Arto Salomaa (University of
Turku, Finland)",
}
@Article{Fulop:2024:SIA,
author = "Zolt{\'a}n F{\"u}l{\"o}p and George Rahonis and and
Kai Salomaa",
title = "Special Issue: Articles Dedicated to the Memory of
{Magnus Steinby} --- Preface",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "??--??",
month = jan # "--" # feb,
year = "2024",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054123020057",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123020057",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Steinby:2024:MMS,
author = "Paula Steinby",
title = "In Memoriam: {Magnus Steinby} (1941--2021)",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "3--5",
month = jan # "--" # feb,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123200010",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123200010",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Salomaa:2024:VEM,
author = "A. Salomaa and M. Steinby",
title = "Volume Edited by {Magnus Steinby}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "7--10",
month = jan # "--" # feb,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123760018",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123760018",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Loding:2024:BCD,
author = "Christof L{\"o}ding and Wolfgang Thomas",
title = "On the {Boolean} Closure of Deterministic Top-Down
Tree Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "11--22",
month = jan # "--" # feb,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123480015",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123480015",
abstract = "The class of Boolean combinations of tree languages
recognized by deterministic top-down tree automata
(also known as deterministic root-to-frontier automata)
is studied. The problem of determining for a given
regular tree language whether it belongs to this class
is open. We provide some progress by two results:
First, a characterization of this class by a natural
extension of deterministic top-down tree automata is
presented, and as an application we obtain a convenient
method to show that certain regular tree languages are
outside this class. In the second result, it is shown
that, for fixed k k k , it is decidable whether a
regular tree language is a Boolean combination of k k k
tree languages recognized by deterministic top-down
tree automata.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Paul:2024:EUS,
author = "Erik Paul",
title = "Equivalence, Unambiguity, and Sequentiality of
Finitely Ambiguous Max-Plus Tree Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "23--49",
month = jan # "--" # feb,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123480027",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123480027",
abstract = "We show that the equivalence, unambiguity, and
sequentiality problems are decidable for finitely
ambiguous max-plus tree automata. A max-plus tree
automaton is a weighted tree automaton over the
max-plus semiring. A max-plus tree automaton is called
finitely ambiguous if the number of accepting runs on
every tree is bounded by a global constant and it is
called unambiguous if there exists at most one
accepting run on every tree. For the equivalence
problem, we show that for two finitely ambiguous
max-plus tree automata, it is decidable whether both
assign the same weight to every tree. For the
unambiguity and sequentiality problems, we show that
for every finitely ambiguous max-plus tree automaton,
both the existence of an equivalent unambiguous
automaton and the existence of an equivalent
deterministic automaton are decidable.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Fulop:2024:CSR,
author = "Zolt{\'a}n F{\"u}l{\"o}p and Heiko Vogler",
title = "A Comparison of Sets of Recognizable Weighted Tree
Languages Over Specific Sets of Bounded Lattices",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "51--76",
month = jan # "--" # feb,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123480039",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123480039",
abstract = "We consider weighted tree automata (wta) over bounded
lattices, locally finite bounded lattices, distributive
bounded lattices, and finite chains and we consider the
weighted tree languages defined by their run semantics
and by their initial algebra semantics. Due to these
eight combinations, there are eight sets of weighted
tree languages. Moreover, we consider the four sets of
weighted tree languages which are recognized by
crisp-deterministic wta over the above mentioned sets
of weight algebras. We give all inclusion relations
among all these twelve sets of weighted tree languages.
More precisely, we prove that eleven of the twelve sets
are equal, and this set is a proper subset of the set
of weighted tree languages recognized by wta over
bounded lattices with initial algebra semantics.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Beaur:2024:EPG,
author = "Pierre B{\'e}aur and Jarkko Kari",
title = "Effective Projections on Group Shifts to Decide
Properties of Group Cellular Automata",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "77--100",
month = jan # "--" # feb,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123480040",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123480040",
abstract = "Many decision problems concerning cellular automata
are known to be decidable in the case of algebraic
cellular automata, that is, when the state set has an
algebraic structure and the automaton acts as a
morphism. The most studied cases include finite fields,
finite commutative rings and finite commutative groups.
In this paper, we provide methods to generalize these
results to the broader case of group cellular automata,
that is, the case where the state set is a finite
(possibly non-commutative) finite group. The
configuration space is not even necessarily the full
shift but a subshift --- called a group shift --- that
is a subgroup of the full shift on Zd {$ \mathbb {Z} $
d} {$ \mathbb {Z} $ d} , for any number d d d of
dimensions. We show, in particular, that injectivity,
surjectivity, equicontinuity, sensitivity and
nilpotency are decidable for group cellular automata,
and non-transitivity is semi-decidable. Injectivity
always implies surjectivity, and jointly periodic
points are dense in the limit set. The Moore direction
of the Garden-of-Eden theorem holds for all group
cellular automata, while the Myhill direction fails in
some cases. The proofs are based on effective
projection operations on group shifts that are, in
particular, applied on the set of valid space-time
diagrams of group cellular automata. This allows one to
effectively construct the traces and the limit sets of
group cellular automata. A preliminary version of this
work was presented at the conference Mathematical
Foundations of Computer Science 2020.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Harju:2024:NSB,
author = "Tero Harju",
title = "A Note on Squares in Binary Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "101--106",
month = jan # "--" # feb,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123480052",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123480052",
abstract = "We consider words over a binary alphabet. A word w w w
is overlap-free if it does not have factors (blocks of
consecutive letters) of the form uvuvu uvuvu uvuvu for
nonempty u u u . Let M(w) M(w) M(w) denote the number
of positions that are middle positions of squares (of
the form uu uu uu ) in w w w . We show that for
overlap-free binary words, 2M(w){\textlessequal}|w|+3
2M(w){\textlessequal}|w|+3 2M(w) {\textlessequal}|w| +
3 , and that there are infinitely many overlap-free
binary words for which 2M(w)=|w|+3 2M(w)=|w|+3 2M(w) =
|w| + 3 .",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Maletti:2024:CWE,
author = "Andreas Maletti",
title = "Compositions of Weighted Extended Tree Transducers ---
The Unambiguous Case",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "107--127",
month = jan # "--" # feb,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123480064",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123480064",
abstract = "Generalizations of another two open conjectures,
Conjectures 13 and 14, of [Lagoutte, Maletti: Survey
--- Weighted extended top-down tree transducers ---
Part III: Composition. Proc. AFCS, LNCS 7020, p.
272--308, Springer 2011] are verified. It is proved
that the composition of an unambiguous weighted
extended tree transducer M M M with a nondeleting
weighted top-down tree transducer N N N can be computed
by a single weighted extended tree transducer.
Extending the recent confirmation of Conjecture 11 it
is also proved that the composition succeeds for any
weighted top-down tree transducer N N N (even if it is
not nondeleting) if the unambiguous weighted extended
tree transducer M M M is constant.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Halava:2024:BGP,
author = "Vesa Halava and {\v{S}}t{\v{e}}p{\'a}n Holub",
title = "Binary Generalized {PCP} for Two Periodic Morphisms is
Decidable in Polynomial Time",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "129--144",
month = jan # "--" # feb,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123480076",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123480076",
abstract = "We show that the binary generalized Post's
Correspondence Problem is decidable in polynomial time
for the case where both morphisms are periodic. Our
result is based on combinatorial properties and we have
formalized the proofs and verified correctness of our
algorithm using the Isabelle/HOL formal proof system.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Droste:2024:WLD,
author = "Manfred Droste and Gustav Grabolle and and George
Rahonis",
title = "Weighted Linear Dynamic Logic",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "145--177",
month = jan # "--" # feb,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123480088",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123480088",
abstract = "We introduce a weighted linear dynamic logic (weighted
LDL for short) and show the expressive equivalence of
its formulas to weighted rational expressions. This
adds a new characterization for recognizable series to
the fundamental Sch{\"u}tzenberger theorem.
Surprisingly, the equivalence does not require any
restriction to our weighted LDL. Our results hold over
arbitrary (resp. totally complete) semirings for finite
(resp. infinite) words. As a consequence, the
equivalence problem for weighted LDL formulas over
fields is decidable in doubly exponential time. In
contrast to classical logics, we show that our weighted
LDL is expressively incomparable to weighted LTL for
finite words. We determine a fragment of the weighted
LTL such that series over finite and infinite words
definable by LTL formulas in this fragment are
definable also by weighted LDL formulas. This is an
extended version of [17].",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Filiot:2024:SCF,
author = "Emmanuel Filiot and Sarah Winter",
title = "Synthesizing Computable Functions from Rational
Specifications Over Infinite Words",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "179--214",
month = jan # "--" # feb,
year = "2024",
DOI = "https://doi.org/10.1142/S012905412348009X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412348009X",
abstract = "The synthesis problem asks to automatically generate,
if it exists, an algorithm from a specification of
correct input-output pairs. In this paper, we consider
the synthesis of computable functions of infinite
words, for a classical Turing computability notion over
infinite inputs. We consider specifications which are
rational relations of infinite words, i.e.,
specifications defined by non-deterministic parity
transducers. We prove that the synthesis problem of
computable functions from rational specifications is
undecidable. We provide an incomplete but sound
reduction to some parity game, such that if Eve wins
the game, then the rational specification is realizable
by a computable function. We prove that this function
is even computable by a deterministic two-way
transducer. We provide a sufficient condition under
which the latter game reduction is complete. This
entails the decidability of the synthesis problem of
computable functions, which we proved to be
ExpTime-complete, for a large subclass of rational
specifications, namely deterministic rational
specifications. This subclass contains the class of
automatic relations over infinite words, a yardstick in
reactive synthesis.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Bjorklund:2024:TBG,
author = "Henrik Bj{\"o}rklund and Johanna Bj{\"o}rklund and and
Petter Ericson",
title = "Tree-Based Generation of Restricted Graph Languages",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "1--2",
pages = "215--243",
month = jan # "--" # feb,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123480106",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu May 23 07:19:47 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123480106",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Articles Dedicated to the Memory of
Magnus Steinby Guest Editors: Zolt{\'a}n F{\"u}l{\"o}p
(University of Szeged, Hungary), George Rahonis
(University of Thessalonikim Greece) and Kai Salomaa
(Queen's University, Canada)",
}
@Article{Guo:2024:BEV,
author = "Fei Guo and Zilong Wang",
title = "Balanced Even-Variable Rotation Symmetric {Boolean}
Functions with Optimal Algebraic Immunity, Maximum
Algebraic Degree and Higher Nonlinearity",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "03",
pages = "245--270",
month = apr,
year = "2024",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054123500016",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jun 11 06:48:28 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500016",
abstract = "Rotation symmetric Boolean functions are good
candidates for stream ciphers because they have such
advantages as simple structure, high operational speed
and low implement cost. Recently, Mesnager et al.
proposed for the first time an efficient method to
construct balanced rotation symmetric Boolean functions
with optimal algebraic immunity and good nonlinearity
for an arbitrary even number of variables. However, the
algebraic degree of their constructed n -variable ( n
{$>$} 4 ) function is always less than the maximum
value n {\textminus} 1 . In this paper, by modifying
the support of Boolean functions from Mesnager et al
.'s construction, we present two new constructions of
balanced even-variable rotation symmetric Boolean
functions with optimal algebraic immunity as well as
higher algebraic degree and nonlinearity. The algebraic
degree of Boolean functions in the first construction
reaches the maximum value n {\textminus} 1 if n 2 is
odd and n 2 {\textnotequal}(2k + 1)2 or (2k + 1)2 + 2
for integer k , while that of the second construction
reaches the maximum value for all n . Moreover, the
nonlinearities of Boolean functions in both two
constructions are higher than that of Mesnager et al
.'s construction.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Niu:2024:INI,
author = "Baohua Niu and Shuming Zhou and and Hong Zhang",
title = "Influential Node Identification of Network Based on
Agglomeration Operation",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "03",
pages = "271--295",
month = apr,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500028",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jun 11 06:48:28 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500028",
abstract = "Networks with distinct topological structures varies
in the ability to resist different kinds of attacks.
Node protection in terms of node importance is an
effective way to ensure the reliable communication of
networks. Thus, the protection of influential node
detected by node importance evaluation is beneficial to
strengthen the invulnerability and robustness of
networks. In this work, the network agglomeration
method based on node contraction is utilized to
evaluate the influence of nodes and identify important
nodes in five kinds of interconnection networks. We
show that the agglomeration method, which takes both
the degree and position into account, is valid and
feasible for these five interconnection networks.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Cheng:2024:LCL,
author = "Xiangdong Cheng and Xiwang Cao and and Liqin Qian",
title = "Linear Codes and Linear Complementary Pairs of Codes
Over a Non-Chain Ring",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "03",
pages = "297--311",
month = apr,
year = "2024",
DOI = "https://doi.org/10.1142/S012905412350003X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jun 11 06:48:28 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412350003X",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2024:GGN,
author = "Xianyong Li and Jiaming Huang and Yajun Du and
Yongquan Fan and and Xiaoliang Chen",
title = "The $g$-Good-Neighbor Conditional Diagnosabilities of
Hypermesh Optical Interconnection Networks Under the
{PMC} and Comparison Models",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "03",
pages = "313--325",
month = apr,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500041",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jun 11 06:48:28 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500041",
abstract = "Processor fault diagnosis is intended to identify
faulty processors of a multicomputer system,
guaranteeing its high reliability and availability. The
g -good-neighbor conditional diagnosability is a novel
fault diagnosis method for various networks. Under the
PMC model and comparison model, the g -good-neighbor
conditional diagnosabilities of hypermesh optical
interconnection networks are determined, respectively.
Directly applying the results, the g -good-neighbor
conditional diagnosabilities of hypercubes are derived
under the PMC and comparison models.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Guo:2024:EHC,
author = "Ruyan Guo and Yan Wang and Jianxi Fan and and Weibei
Fan",
title = "Embedding Hierarchical Cubic Networks into $k$-Rooted
Complete Binary Trees for Minimum Wirelength",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "03",
pages = "327--352",
month = apr,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500053",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jun 11 06:48:28 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500053",
abstract = "In recent years, the growth of data has promoted the
development of parallel and distributed systems. Graph
embedding is of great importance in improving parallel
and distributed system performance. The quality of an
embedding can be measured by many important metrics,
and wirelength is one of the critical metrics related
to communication performance and layout costs of
physical systems. The hierarchical cubic network is a
well-performing interconnection network and the k
-rooted complete binary tree is a data structure with a
hierarchical relationship among its various elements in
algorithms and programming. In this paper, we solve the
problem of the embedding of hierarchical cubic networks
into k -rooted complete binary trees with minimum
wirelength. We first study the optimal set of the
hierarchical cubic network, and propose algorithms to
give embedding het which is an embedding scheme of
hierarchical cubic networks into k -rooted complete
binary trees with minimum wirelength. Moreover, we give
the exact minimum wirelength of this embedding.
Finally, we conduct comparative experiments to evaluate
the performance of embedding het .",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Keshavarz-Kohjerdi:2024:LPP,
author = "Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri",
title = "The Longest Path Problem in Odd-Sized {O}-Shaped Grid
Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "03",
pages = "353--374",
month = apr,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500065",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jun 11 06:48:28 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500065",
abstract = "One of the well-known NP-hard optimization problems in
graph theory is finding the longest path in a graph.
This problem remains NP-hard for general grid graphs,
and its complexity is open for grid graphs that have a
limited number of holes. In this paper, we study this
problem for odd-sized O -shaped grid graphs, i.e. a
rectangular grid graph with a rectangular hole. We show
that this problem can be solved in linear time.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Berberler:2024:NLV,
author = "Zeynep Nihan Berberler and Aysun Ayta{\c{c}}",
title = "Node and Link Vulnerability in Complete Multipartite
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "04",
pages = "375--385",
month = jun,
year = "2024",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054123500077",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jun 11 06:48:30 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500077",
abstract = "Networks are known to be prone to node or link
failures. A central issue in the analysis of networks
is the assessment of their stability and reliability. A
central concept that is used to assess stability and
robustness of the performance of a network under
failures is that of vulnerability. Node and link
residual closeness are novel sensitive graph based
characteristics for network vulnerability analysis.
Node and link residual closeness measure the
vulnerability even when the removal of nodes or links
does not disconnect the network. Node and link residual
closeness are of great theoretical and practical
significance to network design and optimization. In
this paper, vulnerabilities of multipartite network
type topologies to the failure of individual nodes and
links are computed via node and link residual closeness
which provides a much fuller characterization of the
network. Then, how multipartite network type topologies
perform when they suffer a node or a link failure is
analyzed.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Mkrtchyan:2024:AAP,
author = "Vahan Mkrtchyan and Ojas Parekh and and K. Subramani",
title = "Approximation Algorithms for Partial Vertex Covers in
Trees",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "04",
pages = "387--407",
month = jun,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500089",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jun 11 06:48:30 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500089",
abstract = "This paper is concerned with designing algorithms for
and analyzing the computational complexity of the
partial vertex cover problem in trees. Graphs (and
trees) are frequently used to model risk management in
various systems. In particular, Caskurlu et al. in [4]
have considered a system which essentially represents a
tripartite graph. The goal in this model is to reduce
the risk in the system below a predefined risk
threshold level. It can be shown that the main goal in
this risk management system can be formulated as a
Partial Vertex Cover problem on bipartite graphs. In
this paper, we focus on a special case of the partial
vertex cover problem, when the input graph is a tree.
We consider four possible versions of this setting,
depending on whether or not, the vertices and edges are
weighted. Two of these versions, where edges are
assumed to be unweighted, are known to be
polynomial-time solvable. However, the computational
complexity of this problem with weighted edges, and
possibly with weighted vertices, remained open. The
main contribution of this paper is to resolve these
questions by fully characterizing which variants of
partial vertex cover remain NP-hard in trees, and which
can be solved in polynomial time. In the paper, we
propose two pseudo-polynomial DP-based algorithms for
the most general case in which weights are present on
both the edges and the vertices of the tree. One of
these algorithms leads to a polynomial-time procedure,
when weights are confined to the edges of the tree. The
insights used in this algorithm are combined with
additional scaling ideas to derive an FPTAS for the
general case. A secondary contribution of this work is
to propose a novel way of using centroid decompositions
in trees, which could be useful in other settings as
well.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Greeni:2024:EAC,
author = "A. Berin Greeni and R. Sundara Rajan and and Paul
Immanuel",
title = "Embedding Augmented Cube into Certain Trees and
Windmill Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "04",
pages = "409--434",
month = jun,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500090",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jun 11 06:48:30 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500090",
abstract = "The technique used in studying the computational
capabilities of interconnection networks and task
distribution is graph embedding. Based on the
recursively constructed graphs, the hypercube network
is popular for its structure. Many variants of
hypercube are considered in the literature. Augmented
cube is considered as one of the best variants of
hypercube as it holds many desirable properties like
optimal routing in linear time complexity, vertex
symmetricity, wide diameter and maximum connectivity.
Our work deals with the exact wirelength, when
augmented cube is embedded into certain tree and
windmill structures.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Niu:2024:WDF,
author = "Baohua Niu and Shuming Zhou and Tao Tian and and Qifan
Zhang",
title = "The Wide Diameter and Fault Diameter of Exchanged
Crossed Cube",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "04",
pages = "435--451",
month = jun,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500107",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jun 11 06:48:30 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500107",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Salami:2024:SEM,
author = "Hosein Salami and Mostafa Nouri-Baygi",
title = "A Simple and Efficient Method for Accelerating
Construction of the Gap-Greedy Spanner",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "04",
pages = "453--481",
month = jun,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500119",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jun 11 06:48:30 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500119",
abstract = "Let G be the complete Euclidean graph on a set of
points embedded in the plane. Given a constant t {$>$}
1 , a spanning subgraph G{\prime} of G is said to be a
t -spanner, or simply a spanner, if for any pair of
nodes p , q in G there exists a t -path in G{\prime} ,
i.e., a path between p and q whose length is at most t
times their distance in G . Gap-greedy spanner,
proposed by Arya and Smid, is a light weight and
bounded degree spanner in which a pair of points p,q is
guaranteed to have a t -path, if there exists at least
one edge with some special criteria in the spanner.
Existing algorithms for computing the gap-greedy
spanner determine the existence of such an edge for
each pair of points by examining the edges of the
spanner, which takes O(n) time, however in this paper,
we have presented a method by which this task can be
done in O(1) time. Using the proposed method and
well-separated pair decomposition, we have proposed a
linear-space algorithm that can compute the gap-greedy
spanner in O(n2) time. How to use the well-separated
pair decomposition to compute this spanner was proposed
by Bakhshesh and Farshi, however using an example, we
have shown that one of the algorithms they have
proposed for this purpose is incorrect. We have
performed various experiments to measure the duration
and amount of memory used by the algorithms for
computing this spanner. The results of these
experiments showed that the proposed method, without a
significant effect on the amount of memory consumed
compared to previous algorithms, leads to a significant
acceleration in the construction time of this
spanner.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Ge:2024:SFT,
author = "Huifen Ge and Shumin Zhang and and Chengfu Ye",
title = "The Structure Fault Tolerance of Alternating Group
Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "04",
pages = "483--500",
month = jun,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500120",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Tue Jun 11 06:48:30 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500120",
abstract = "The alternating group network ANn can be used to model
the topology structure of a large-scale parallel
network system. In this work, the structure fault
tolerance of alternating group networks based on the
star and path structures is investigated. For a graph G
and its a connected subgraph H , the H -structure
connectivity {\textkappa}(G; H) (resp. H -substructure
connectivity {\textkappa}s(G; H) ) of G is the
cardinality of a minimum family {$ \cal H $} whose
every element is isomorphic to H (resp. isomorphic to a
subgraph of H ) such that G {\textminus} V ({$ \cal H
$}) is disconnected. Specifically, we determine
{\textkappa}(ANn; H) and {\textkappa}s(AN n; H) for H
{\textelement}{K1,r,Pk} .",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{DAlconzo:2024:TMM,
author = "Giuseppe D'Alconzo",
title = "On Two Modifications of the {McEliece PKE} and the
{CFS} Signature Scheme",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "05",
pages = "501--512",
month = aug,
year = "2024",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054123500132",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:24 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500132",
abstract = "This paper analyzes two schemes from a 2019 work by
Liu, Yang, Han and Wang, namely, adapting the McEliece
cryptosystem to obtain a new public-key encryption
scheme, and designing an efficient CFS-like digital
signature. It is shown that the new encryption scheme
based on McEliece, even if it has longer public keys,
is not more secure than the standard one. The security
gap between the original scheme and its modification is
presented. Moreover, while the proposed parameters for
the digital signature scheme lead to a significant
performance improvement, however, they introduce a
vulnerability in the protocol. A key-forgery attack
using the Support Splitting Algorithm as a subroutine
is described, with a study of the computational cost of
retrieving the secret key from the public one.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Wang:2024:RSM,
author = "Zhiwei Wang and Chen Tian and Zhanlin Wang and and
Yuhang Wang",
title = "Robust Subgroup Multisignature with One-Time Public
Keys in Order",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "05",
pages = "513--533",
month = aug,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500144",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:24 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500144",
abstract = "Robust subgroup multisignature allows any subgroup of
signers from a global set to sign a given message on
behalf of the whole group, and the individual
signatures should be verified before the combination
process, which resists poison signature attacks. An
emerging application of robust subgroup multisignatures
in blockchain is that a qualified subgroup of a global
set of users has reached agreement. In the integrated
blockchain and edge computing system, the edge server
can naturally act as a combiner in multisignatures and
help other end devices produce the final aggregate
signature. In this paper, we propose a robust subgroup
multisignature with one-time public keys in order that
has two advantages for solving the signers ordering
problem and one-time public key problem simultaneously.
Our scheme is a nontrivial extension of Galindo et al
.'s robust subgroup multisignature scheme and can be
proven unforgeable, robust and chronological in random
oracles. Our scheme can also be suitable for the
consortium blockchain by adding a noninteractive
zero-knowledge (NIZK) proof system for certifying the
one-time public keys.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lin:2024:RAC,
author = "Hsin-Jung Lin and Shyue-Ming Tang and Kung-Jui Pai and
and Jou-Ming Chang",
title = "A Recursive Algorithm for Constructing Dual-{CISTs} in
Hierarchical Folded Cubic Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "05",
pages = "535--550",
month = aug,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500156",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:24 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500156",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Huang:2024:PAF,
author = "Jingui Huang and Jie Chen and Yunlong Liu and Guang
Xiao and and Jianxin Wang",
title = "Parameterized Algorithms for Fixed-Order Book Drawing
with Few Crossings Per Edge",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "05",
pages = "551--577",
month = aug,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500168",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:24 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500168",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Yu:2024:SEC,
author = "Zhecheng Yu and Liqiong Xu and Xuemin Wu and and
Chuanye Zheng",
title = "On the Super (Edge)-Connectivity of Generalized
{Johnson} Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "05",
pages = "579--593",
month = aug,
year = "2024",
DOI = "https://doi.org/10.1142/S012905412350017X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:24 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412350017X",
abstract = "Let n , k and t be non-negative integers. The
generalized Johnson graph G(n,k,t) is the graph whose
vertices are the k -subsets of the set {1,
2,{\textellipsis},n} , and two vertices are adjacent if
and only if they intersect with t elements. Special
cases of generalized Johnson graph include the Kneser
graph G(n,k, 0) and the Johnson graph G(n,k,k
{\textminus} 1) . These graphs play an important role
in coding theory, Ramsey theory, combinatorial geometry
and hypergraphs theory. In this paper, we discuss the
connectivity properties of the Kneser graph G(n,k, 0)
and G(n,k, 1) by their symmetric properties.
Specifically, with the help of some properties of
vertex/edge-transitive graphs we prove that G(n,k, 0)
(5 {\textlessequal} 2k + 1 {\textlessequal} n) and
G(n,k, 1) (4 {\textlessequal} 2k {\textlessequal} n)
are super restricted edge-connected. Besides, we obtain
the exact value of the restricted edge-connectivity and
the cyclic edge-connectivity of the Kneser graph G(n,k,
0) (5 {\textlessequal} 2k + 1 {\textlessequal} n) and
G(n,k, 1) (4 {\textlessequal} 2k {\textlessequal} n) ,
and further show that the Kneser graph G(n,k, 0) (5
{\textlessequal} 2k + 1 {\textlessequal} n) is super
vertex-connected and super cyclically edge-connected.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Chang:2024:AAP,
author = "Ching-Lueh Chang and Chun-Wei Chang",
title = "Approximating All-Points Furthest Pairs and Maximum
Spanning Trees in Metric Spaces",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "05",
pages = "595--603",
month = aug,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123500181",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:24 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123500181",
abstract = "Consider the problem of finding a point furthest from
x for each point x in a metric space ([n],d) , where
[n] = {1, 2,{\textellipsis},n} . We prove this problem
to have a deterministic O(n) -time 1/3 -approximation
algorithm. As a corollary, the maximum spanning tree
problem in metric spaces has a deterministic O(n) -time
1/3 -approximation algorithm. We also give a Monte
Carlo O(n1.5log n) -time algorithm outputting, for each
x {\textelement} [n] , a point yx {\textelement} [n]
satisfying d(x,yx) {\textgreaterequal} {\textDelta}/2 ,
where {\textDelta}
{\textequivalence}maxx,y{\textelement}[n]d(x,y) . As a
corollary, we have a Monte Carlo O(n1.5log n) -time
algorithm for finding a spanning tree of weight at
least (1/2 {\textminus} o(1)){\textDelta}n in ([n],d)
.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Du:2024:PSI,
author = "Donglei Du and Lu Han and Rolf H. M{\"o}hring and and
Chenchen Wu",
title = "Preface --- Special Issue: Research in Combinatorial
Optimization and Applications of {COCOA 2021}",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "06",
pages = "605--607",
month = sep,
year = "2024",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054124020015",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:26 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054124020015",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Research in Combinatorial Optimization
and Applications of COCOA 2021 Guest Editors: Donglei
Du (University of New Brunswick, Canada), Lu Han
(Beijing University of Posts and Telecommunications, P.
R. China), Rolf H. M{\"o}hring (Technical University
Berlin, Germany) and Chenchen Wu (Tianjin University of
Technology, P. R. China)",
}
@Article{Liu:2024:VBU,
author = "Yunlong Liu and Yixuan Li and and Jingui Huang",
title = "Vertex-Bipartition: A Unified Approach for
Kernelization of Graph Linear Layout Problems
Parameterized by Vertex Cover",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "06",
pages = "609--629",
month = sep,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123410022",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:26 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123410022",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Research in Combinatorial Optimization
and Applications of COCOA 2021 Guest Editors: Donglei
Du (University of New Brunswick, Canada), Lu Han
(Beijing University of Posts and Telecommunications, P.
R. China), Rolf H. M{\"o}hring (Technical University
Berlin, Germany) and Chenchen Wu (Tianjin University of
Technology, P. R. China)",
}
@Article{Cui:2024:ILT,
author = "Min Cui and Donglei Du and Ling Gai and and Ruiqi
Yang",
title = "Improved Linear-Time Streaming Algorithms for
Maximizing Monotone Cardinality-Constrained Set
Functions",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "06",
pages = "631--650",
month = sep,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123410083",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:26 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123410083",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Research in Combinatorial Optimization
and Applications of COCOA 2021 Guest Editors: Donglei
Du (University of New Brunswick, Canada), Lu Han
(Beijing University of Posts and Telecommunications, P.
R. China), Rolf H. M{\"o}hring (Technical University
Berlin, Germany) and Chenchen Wu (Tianjin University of
Technology, P. R. China)",
}
@Article{Paranhos:2024:PCC,
author = "Raffael Muralha Paranhos and Janio Carlos Nascimento
Silva and and U{\'e}verton dos Santos Souza",
title = "Parameterized Complexity Classes Defined by Threshold
Circuits and Their Connection with Sorting Networks",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "06",
pages = "651--668",
month = sep,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123410046",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:26 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123410046",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Research in Combinatorial Optimization
and Applications of COCOA 2021 Guest Editors: Donglei
Du (University of New Brunswick, Canada), Lu Han
(Beijing University of Posts and Telecommunications, P.
R. China), Rolf H. M{\"o}hring (Technical University
Berlin, Germany) and Chenchen Wu (Tianjin University of
Technology, P. R. China)",
}
@Article{Goyal:2024:HRC,
author = "Pooja Goyal and B. S. Panda",
title = "Hardness Results of Connected Power Domination for
Bipartite Graphs and Chordal Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "06",
pages = "669--703",
month = sep,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123410071",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:26 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123410071",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Research in Combinatorial Optimization
and Applications of COCOA 2021 Guest Editors: Donglei
Du (University of New Brunswick, Canada), Lu Han
(Beijing University of Posts and Telecommunications, P.
R. China), Rolf H. M{\"o}hring (Technical University
Berlin, Germany) and Chenchen Wu (Tianjin University of
Technology, P. R. China)",
}
@Article{Chakraborty:2024:SDS,
author = "Sankardeep Chakraborty and Seungbum Jo and Kunihiko
Sadakane and and Srinivasa Rao Satti",
title = "Succinct Data Structures for {SP}, Block-Cactus and
3-Leaf Power Graphs",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "06",
pages = "705--722",
month = sep,
year = "2024",
DOI = "https://doi.org/10.1142/S012905412341006X",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:26 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S012905412341006X",
abstract = "We design succinct encodings of series-parallel,
block-cactus and 3-leaf power graphs while supporting
the basic navigational queries such as degree,
adjacency and neighborhood optimally in the RAM model
with logarithmic word size. One salient feature of our
representation is that it can achieve optimal space
even though the exact space lower bound for these graph
classes is not known. For these graph classes, we
provide succinct data structures with optimal query
support for the first time in the literature. For
series-parallel multigraphs, our work also extends the
works of Uno et al. (Disc. Math. Alg. and Appl., 2013)
and Blelloch and Farzan (CPM, 2010) to produce optimal
bounds.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Research in Combinatorial Optimization
and Applications of COCOA 2021 Guest Editors: Donglei
Du (University of New Brunswick, Canada), Lu Han
(Beijing University of Posts and Telecommunications, P.
R. China), Rolf H. M{\"o}hring (Technical University
Berlin, Germany) and Chenchen Wu (Tianjin University of
Technology, P. R. China)",
}
@Article{Inkulu:2024:RAC,
author = "R. Inkulu and Pawan Kumar",
title = "Routing Among Convex Polygonal Obstacles in the
Plane",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "06",
pages = "723--739",
month = sep,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123410034",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:26 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123410034",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Research in Combinatorial Optimization
and Applications of COCOA 2021 Guest Editors: Donglei
Du (University of New Brunswick, Canada), Lu Han
(Beijing University of Posts and Telecommunications, P.
R. China), Rolf H. M{\"o}hring (Technical University
Berlin, Germany) and Chenchen Wu (Tianjin University of
Technology, P. R. China)",
}
@Article{Davot:2024:STP,
author = "Tom Davot and Rodolphe Giroudeau and and Jean-Claude
K{\"o}nig",
title = "On the Shared Transportation Problem: Computational
Hardness and Exact Approach",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "06",
pages = "741--756",
month = sep,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123410058",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:26 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123410058",
abstract = "In our modern societies, a certain number of people do
not own a car, by choice or by obligation. For some
trips, there is no or few alternatives to the car. One
way to make these trips possible for these people is to
be transported by others who have already planned their
trips. We propose to model this problem using as
path-finding problem in a list edge-colored graph. This
problem is a generalization of the s {\textminus} t
-path problem, studied by B{\"o}hmov{\'a} et al. We
consider two optimization functions: minimizing the
number of color changes and minimizing the number of
colors. We study for the previous problems, the classic
complexity (polynomial-case, NP-completeness, hardness
of approximation) and parameter complexity
(W[2]-hardness) even in restricted cases. We also
propose a lower bound for exact algorithm. On the
positive side we provide a polynomial-time
approximation algorithm and a FPT algorithm.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Research in Combinatorial Optimization
and Applications of COCOA 2021 Guest Editors: Donglei
Du (University of New Brunswick, Canada), Lu Han
(Beijing University of Posts and Telecommunications, P.
R. China), Rolf H. M{\"o}hring (Technical University
Berlin, Germany) and Chenchen Wu (Tianjin University of
Technology, P. R. China)",
}
@Article{Ji:2024:IAA,
author = "Sai Ji and Yukun Cheng and Jingjing Tan and and
Zhongrui Zhao",
title = "An Improved Approximation Algorithm for the
Capacitated Correlation Clustering Problem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "35",
number = "06",
pages = "757--774",
month = sep,
year = "2024",
DOI = "https://doi.org/10.1142/S0129054123410010",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Sat Sep 21 08:33:26 MDT 2024",
bibsource = "http://www.worldscientific.com/loi/ijfcs;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0129054123410010",
abstract = "Correlation clustering problem (CorCP) is a classical
clustering problem, which clusters data based on the
similarity of data set, and has many applications in
interaction networks, cross-lingual link detection, and
communication networks, etc. In this paper, we study a
practical generalization of the CorCP, called the
capacitated correlation clustering problem (the
capacitated CorCP), by constructing a labeled complete
graph. On this labeled complete graph, each vertex
represents a piece of data. If two pieces of data are
similar, then the edge between the corresponding
vertices is marked by a positive label +. Otherwise,
this edge is marked by a negative label -. The
objective of the capacitated CorCP is to group some
similar data sets into one cluster as far as possible,
while satisfying the cluster capacity constraint. To
achieve this objective, we shall partition the vertex
set of the labeled complete graph into several
clusters, each cluster's size subjecting to an upper
bound, so as to minimize the number of disagreements.
Here the number of disagreements is defined as the
total number of the edges with positive labels between
clusters and the edges with negative labels within
clusters. Different with the previous algorithm in
[18], which subjects to the constraint on the cluster
size by a penalty measure, we design an algorithm for
the capacitated CorCP to directly output a feasible
solution by iteratively constructing clusters based on
a preset threshold. Through carefully setting the
threshold and sophisticatedly analyzing, our algorithm
is proved to have an improved approximation ratio of
5.37. In addition, we also conduct a series of
numerical experiments to demonstrate the effectiveness
of our algorithm.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
remark = "Special Issue: Research in Combinatorial Optimization
and Applications of COCOA 2021 Guest Editors: Donglei
Du (University of New Brunswick, Canada), Lu Han
(Beijing University of Posts and Telecommunications, P.
R. China), Rolf H. M{\"o}hring (Technical University
Berlin, Germany) and Chenchen Wu (Tianjin University of
Technology, P. R. China)",
}
