@article{Koch-Mancini-Parisi-Presicce/05,
AUTHOR = {Koch, Manuel and Mancini, L.V. and Parisi-Presicce, Francesco},
TITLE = {Graph-based specification of access control policies},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {1},
PAGES = {1-33},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {security, access control, graph transformation, graphical constraints, consistency, conflict detection, policy verification},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4F8TW25-1/2/6e420fedd70b1f06489a5dddedb3f030},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Lanotte-Maggiolo-Schettini/05,
AUTHOR = {Lanotte, Ruggero and Maggiolo-Schettini, Andrea},
TITLE = {Monotonic hybrid systems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {1},
PAGES = {34-69},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {hybrid systems, monotonic hybrid systems, decidability of system properties, expressiveness, succinctness, dense time, discrete time},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4F8JNF5-2/2/a2861a0acb96a559b46471365ca30816},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Huang/05,
AUTHOR = {Huang, Tetz C.},
TITLE = {A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {1},
PAGES = {70-85},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {self-stabilizing algorithm, shortest path, model of computation, separate read/write atomicity, composite read/write atomicity},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4FKYF2N-2/2/bb0b86f15adc4547d61986d07b02636d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Reif/05,
AUTHOR = {Reif, John H.},
TITLE = {Efficient parallel factorization and solution of structured and unstructured linear systems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {1},
PAGES = {86-143},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {parallel algorithms, linear systems, lu factorization, dense matrices, sparse matrices, newton iteration, structured matrices, toeplitz matrices, displacement rank, polynomial greatest common divisors, gcd, resultant, pade approximation},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4FKYF2N-1/2/dad58122b92db13d9f100e66928f3fb4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Berman-DasGupta-Kao/05,
AUTHOR = {Berman, Piotr and DasGupta, Bhaskar and Kao, Ming-Yang},
TITLE = {Tight approximability results for test set problems in bioinformatics},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {2},
PAGES = {145-162},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {test set problems, string barcoding, minimum cost probe set problems, approximation algorithms, lower bounds},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4FSFXMW-1/2/0d664e9f5db94eb174ba7d8290517cc4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Xu-Zhou-Lu/05,
AUTHOR = {Xu, Baowen and Zhou, Yuming and Lu, Hongmin},
TITLE = {An improved accuracy measure for rough sets},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {2},
PAGES = {163-173},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {rough sets, equivalence relations, accuracy, excess entropy, measure},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4FWKF00-1/2/882d7bba45cea2aefb0f7e74a7a4c208},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Gutin-Kloks-Lee-Yeo/05,
AUTHOR = {Gutin, Gregory and Kloks, Ton and Lee, Chuan Min and Yeo, Anders},
TITLE = {Kernels in planar digraphs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {2},
PAGES = {174-184},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {kernels, planar digraphs, fixed-parameter complexity},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4FWKMJ3-1/2/5028f1b95a6c0c1cf5e8dad7e7475009},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Kiltz-Simon/05,
AUTHOR = {Kiltz, Eike and Simon, Hans Ulrich},
TITLE = {Threshold circuit lower bounds on cryptographic functions},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {2},
PAGES = {185-212},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {threshold circuits, exponential sums, spectral norm},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4FWS7HW-1/2/f339038d6a2e9424ecfb1ece2d47898d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Beimel-Ishai-Kushilevitz/05,
AUTHOR = {Beimel, Amos and Ishai, Yuval and Kushilevitz, Eyal},
TITLE = {General constructions for information-theoretic private information retrieval},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {2},
PAGES = {213-247},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {private information retrieval, information-theoretic cryptography, locally decodable codes, multiparty communication complexity, simultaneous messages protocols},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4GD4SWB-1/2/fe819ff3b5f6a84a91411b46c04eda25},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Bshouty-Mossel-ODonnell-Servedio/05,
AUTHOR = {Bshouty, Nader H. and Mossel, Elchanan and O'Donnell, Ryan and Servedio, Rocco A.},
TITLE = {Learning DNF from random walks},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {3},
PAGES = {250-265},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {computational learning theory, noise sensitivity, disjunctive normal form formulas, dnf, random walks},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4F05RG1-2/2/bc3b721080db4a7d356b5c1475bdce35},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Kalai-Servedio/05,
AUTHOR = {Kalai, Adam Tauman and Servedio, Rocco A.},
TITLE = {Boosting in the presence of noise},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {3},
PAGES = {266-290},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {computational learning theory, noise-tolerant learning, boosting, pac learning, branching programs},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4F05RG1-1/2/51ece64b21654eea286af99ac3ac9a32},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Kalai-Vempala/05,
AUTHOR = {Kalai, Adam and Vempala, Santosh},
TITLE = {Efficient algorithms for online decision problems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {3},
PAGES = {291-307},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {online algorithms, hannan's algorithm, optimization, decision theory},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4F2R60M-1/2/decd393207e921dd12ea556b5ac0bcc3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Case-Jain-Montagna-Simi-Sorbi/05,
AUTHOR = {Case, John and Jain, Sanjay and Montagna, Franco and Simi, Giulia and Sorbi, Andrea},
TITLE = {On learning to coordinate: Random bits help, insightful normal forms, and competency isomorphisms},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {3},
PAGES = {308-332},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {coordination, learning, probabilistic machines},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4F019BF-1/2/c58548d7afb5366a9a7938587e4dcabc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Hein-Bousquet-Scholkopf/05,
AUTHOR = {Hein, Matthias and Bousquet, Olivier and Sch{\"o}lkopf, Bernhard},
TITLE = {Maximal margin classification for metric spaces},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {3},
PAGES = {333-359},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {classification, maximum margin, metric spaces, embedding, pattern recognition},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4F03348-1/2/c282ca293093f83729701f4bf16282ff},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Charikar-Guruswami-Wirth/05,
AUTHOR = {Charikar, Moses and Guruswami, Venkatesan and Wirth, Anthony},
TITLE = {Clustering with qualitative information},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {3},
PAGES = {360-383},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {clustering, approximation algorithm, lp rounding, minimum multicut},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4F2B7HT-1/2/09001babfda020f64dbd96056e17c416},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Alber-Fan-Fellows-Fernau-Niedermeier-Rosamond-Stege/05,
AUTHOR = {Alber, Jochen and Fan, Hongbing and Fellows, Michael R. and Fernau, Henning and Niedermeier, Rolf and Rosamond, Fran and Stege, Ulrike},
TITLE = {A refined search tree technique for dominating set on planar graphs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {4},
PAGES = {385-405},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {np-complete problem, dominating set, planar graph, fixed-parameter tractability, exact algorithm, search tree},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4D635B0-2/2/644f408a94a2350c07dcdf4ed1e126d1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Vikas/05,
AUTHOR = {Vikas, Narayan},
TITLE = {A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {4},
PAGES = {406-439},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {computational complexity, graph, colouring, homomorphism, retraction, compaction, partition},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4G7GG24-1/2/6a87df67e37b96d909d81ea4ab54ce79},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Goldstine-Leung-Wotschke/05,
AUTHOR = {Goldstine, Jonathan and Leung, Hing and Wotschke, Detlef},
TITLE = {Measuring nondeterminism in pushdown automata},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {4},
PAGES = {440-466},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {nondeterminism, pushdown automata},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4GDC0BC-1/2/19c197444f4cc82ec632db3f40c0b4cf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Dubhashi-Mei-Panconesi-Radhakrishnan-Srinivasan/05,
AUTHOR = {Dubhashi, Devdatt and Mei, Alessandro and Panconesi, Alessandro and Radhakrishnan, Jaikumar and Srinivasan, Aravind},
TITLE = {Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {4},
PAGES = {467-479},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {ad hoc networks, dominating sets, distributed algorithms},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4GFVMND-1/2/d5f803eb7e27a02feb436a7c6c50a08f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Karaata/05,
AUTHOR = {Karaata, Mehmet Hakan},
TITLE = {An optimal self-stabilizing starvation-free alternator},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {4},
PAGES = {480-494},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {alternators, distributed systems, fairness, schedulers, stabilization, starvation-freedom},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4GM46KF-1/2/cfec787675394729219cf17280d5ca80},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Kolliopoulos-Young/05,
AUTHOR = {Kolliopoulos, Stavros G. and Young, Neal E.},
TITLE = {Approximation algorithms for covering/packing integer programs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {4},
PAGES = {495-505},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {covering/packing integer programs, set cover, approximation algorithms, multiplicity constraints},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4GX1J6S-1/2/e11662551963faed2f0c5efff6d03787},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Honkala/05a,
AUTHOR = {Honkala, Juha},
TITLE = {An $n^2$-bound for the ultimate equivalence problem of certain DOL systems over an $n$-letter alphabet},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {4},
PAGES = {506-519},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {d0l system, equivalence problem, ultimate equivalence problem, decidability},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4GPW6NT-1/2/62a760c243d8f23df852d9c256568a13},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Woelfel/05,
AUTHOR = {Woelfel, Philipp},
TITLE = {Bounds on the OBDD-size of integer multiplication via universal hashing},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {4},
PAGES = {520-534},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {obdds, integer multiplication, binary decision diagrams, branching programs},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4GSTS7H-1/2/070541a4e385dec6324943fcb23c5dcc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Gori-Levi/05,
AUTHOR = {Gori, Roberta and Levi, Giorgio},
TITLE = {On the verification of finite failure},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {71},
NUMBER = {4},
PAGES = {535-575},
YEAR = {2005},
EDITOR = {Blum, E.K.},
KEYWORDS = {abstract interpretation, logic programming, program verification, finite failure},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4GX6JB4-1/2/91bca9f86b0dd8d1a9f24fa55c81f199},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}