Journal: J. Comput. Syst. Sci.

Volume 74, Issue 8

1227 -- 0Peter Auer, Philip M. Long. Guest editors introduction: Special issue on learning theory
1228 -- 1244Yuri Kalnishkan, Michael V. Vyugin. The weak aggregating algorithm and weak mixability
1245 -- 1270Maria-Florina Balcan, Avrim Blum, Jason D. Hartline, Yishay Mansour. Reducing mechanism design to algorithm design via machine learning
1271 -- 1288Baruch Awerbuch, Robert Kleinberg. Competitive collaborative learning
1289 -- 1308Mikhail Belkin, Partha Niyogi. Towards a theoretical foundation for Laplacian-based manifold methods
1309 -- 1331Alexander L. Strehl, Michael L. Littman. An analysis of model-based Interval Estimation for Markov Decision Processes

Volume 74, Issue 7

1095 -- 1102Katsuhiko Nakamura. Languages not recognizable in real time by one-dimensional cellular automata
1103 -- 1115Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini. Structure identification of Boolean relations and plain bases for co-clones
1116 -- 1130Michael Domaratzki, Kai Salomaa. Lower bounds for the transition complexity of NFAs
1131 -- 1138Haik Grigorian, Samvel K. Shoukourian. The equivalence problem of multidimensional multitape automata
1139 -- 1146Devdatta Gangal, Abhiram G. Ranade. Precedence constrained scheduling in (2 - 7/(3p+1)) optimal
1147 -- 1159Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv. Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
1160 -- 1172Guomin Yang, Duncan S. Wong, Huaxiong Wang, Xiaotie Deng. Two-factor mutual authentication based on smart cards and passwords
1173 -- 1187Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner. The complexity of unions of disjoint sets
1188 -- 1198Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songjian Lu, Yngve Villanger. Improved algorithms for feedback vertex set problems
1199 -- 1225Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode. Nash equilibria in discrete routing games with convex latency functions

Volume 74, Issue 6

939 -- 941Mohamed Ould-Khaoua, Geyong Min. Performance analysis and evaluation of parallel, cluster, and grid computing systems
942 -- 964Dimitrios Filippopoulos, Helen D. Karatza. A two-class parallel system with general service times of the parallel class
965 -- 982Subhash Saini, Robert Ciotti, Brian T. N. Gunney, Thomas E. Spelce, Alice E. Koniges, Don Dossa, Panagiotis A. Adamidis, Rolf Rabenseifner, Sunil R. Tiyyagura, Matthias Müller. Performance evaluation of supercomputers using HPCC and IMB Benchmarks
983 -- 999Basile Schaeli, Sebastian Gerlach, Roger D. Hersch. A simulator for adaptive parallel applications
1000 -- 1012Abbas Eslami Kiasari, Hamid Sarbazi-Azad. Analytic performance comparison of hypercubes and star graphs with implementation constraints
1013 -- 1032Jeremy T. Bradley, Stephen T. Gilmore, Jane Hillston. Analysing distributed Internet worm attacks using continuous state-space approximation of process algebra models
1033 -- 1042Nasser Alzeidi, Mohamed Ould-Khaoua, Ahmad Khonsari. A new general method to compute virtual channels occupancy probabilities in wormhole networks
1043 -- 1054Azzedine Boukerche, YunFeng Gu, Regina Borges de Araujo. An Adaptive Dynamic Grid-Based approach to DDM for large-scale distributed simulation systems
1055 -- 1066Xiaolong Jin, Geyong Min. A heuristic flow-decomposition approach for generalized processor sharing under self-similar traffic
1067 -- 1081Nigel Thomas. Comparing job allocation schemes where service demand is unknown
1082 -- 1093Luiz Angelo Steffenel, Grégory Mounié. A framework for adaptive collective communications for heterogeneous hierarchical computing systems

Volume 74, Issue 5

657 -- 661Tao Xiang, Kwok-Wo Wong, Xiaofeng Liao. Cryptanalysis of a password authentication scheme over insecure networks
662 -- 670Guy Kortsarz, Zeev Nutov. Tight approximation algorithm for connectivity augmentation problems
671 -- 696. On the Approximation of Correlation Clustering and Consensus Clustering
697 -- 720Tova Milo, Assaf Sagi, Elad Verbin. Compact samples for data dissemination
721 -- 743David A. Cohen, Peter Jeavons, Marc Gyssens. A unified theory of structural tractability for constraint satisfaction problems
744 -- 774Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan. Improved bounds on sorting by length-weighted reversals
775 -- 795. Compact roundtrip routing with topology-independent node names
796 -- 807Maxime Crochemore, Lucian Ilie. Maximal repetitions in strings
808 -- 822Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang. Fast periodic graph exploration with constant memory
823 -- 830Rachid Guerraoui, Petr Kuznetsov. The gap in circumventing the impossibility of consensus
831 -- 849François Nicolas, Eric Rivals. Hardness of optimal spaced seed design
850 -- 869Shlomo Moran, Sagi Snir. Convex recolorings of strings and trees: Definitions, hardness results and algorithms
870 -- 874Qiang Li, Huimin Xie. Finite automata for testing composition-based reconstructibility of sequences
875 -- 883Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten. Approximation of satisfactory bisection problems
884 -- 897Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan. Simultaneous matchings: Hardness and approximation
898 -- 909Peter Jonsson, Andrei A. Krokhin. Computational complexity of auditing finite attributes in statistical databases
910 -- 918Mark McCann, Nicholas Pippenger. Fault tolerance in cellular automata at high fault rates
919 -- 937Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos. Efficient algorithms for counting parameterized list H-colorings

Volume 74, Issue 4

408 -- 0William I. Gasarch. Memorial issue for Carl Smith
409 -- 430Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan. Non-U-shaped vacillatory and team learning
431 -- 456Sanjay Jain, Efim B. Kinber. Learning languages from positive data and negative counterexamples
457 -- 489Andris Ambainis. Probabilistic and team PFIN-type learning: General properties
490 -- 512William I. Gasarch, Andrew C. Y. Lee. Inferring answers to queries
513 -- 526Bala Kalyanasundaram, Mahendran Velauthapillai. Taming teams with mind changes
527 -- 545Janis Barzdins, Rusins Freivalds, Carl H. Smith. Learning with belief levels
546 -- 556Dana Angluin, Jiang Chen. Learning a hidden graph using O(logn) queries per edge
557 -- 586Boaz Leskes, Leen Torenvliet. The value of agreement a new boosting algorithm
587 -- 597Clyde P. Kruskal. The orchard visibility problem and some variants
598 -- 627Clyde P. Kruskal. The chromatic number of the plane: The bounded case
628 -- 655William I. Gasarch, James Glenn, Clyde P. Kruskal. Finding large 3-free sets I: The small n case

Volume 74, Issue 3

297 -- 0Harry Buhrman. Foreword
298 -- 312Ryan O Donnell, Rocco A. Servedio. Extremal properties of polynomial threshold functions
313 -- 322Scott Aaronson. Quantum certificate complexity
323 -- 334Albert Atserias, Víctor Dalmau. A combinatorial characterization of resolution width
335 -- 349Subhash Khot, Oded Regev. Vertex cover might be hard to approximate to within 2-epsilon
350 -- 357Wolfgang Merkle. The complexity of stochastic sequences
358 -- 363Lance Fortnow, Aduri Pavan, Samik Sengupta. Proving SAT does not have small circuits with an application to the two queries problem
364 -- 385Pranab Sen, Srinivasan Venkatesh. Lower bounds for predecessor searching in the cell probe model
386 -- 393Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi. The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
394 -- 403Detlef Sieling. Minimization of decision trees is hard to approximate
404 -- 405Susan B. Davidson, Wenfei Fan, Carmem S. Hara. Erratum to Propagating XML constraints to relations [JCSS 73 (2007) 316-361]

Volume 74, Issue 2

131 -- 132Muhammad Younas, Elhadi Shakshuki, Kuo-Ming Chao. Special issue: Web and mobile information systems
133 -- 145Maya Rupert, Amjad Rattrout, Salima Hassas. The web from a complex adaptive systems perspective
146 -- 157Hui-Na Chua, Simon D. Scott, Y. W. Choi. Enabling device independent co-browsing through adaptive view points
158 -- 169Arne Ketil Eidsvik, Randi Karlsen, Gordon S. Blair, Paul Grace. Interfacing remote transaction services using UPnP
170 -- 195Eric Pardede, J. Wenny Rahayu, David Taniar. XML data update management in XML-enabled database
196 -- 210Binyu Zang, Yinsheng Li, Wei Xie, Zhuangjian Chen, Chen-Fang Tsai, Christopher Laing. An ontological engineering approach for automating inspection and quarantine at airports
211 -- 231Wei-Li Lin, Chi-Chun Lo, Kuo-Ming Chao, Muhammad Younas. Consumer-centric QoS-aware selection of web services
232 -- 242Irfan Awan, Shakeel Ahmad, Bashir Ahmad. Performance analysis of multimedia based web traffic with QoS constraints
243 -- 254Rachid Anane, Sukhvir Dhillon, Behzad Bordbar. Stateless data concealment for distributed systems
255 -- 278Hao Lan Zhang, Clement H. C. Leung, Gitesh K. Raikundalia. Topological analysis of AOCD-based agent networks and experimental results
279 -- 296Elhadi Shakshuki, Hsiang-Hwa Koo, Darcy G. Benoit, Daniel L. Silver. A distributed multi-agent meeting scheduler

Volume 74, Issue 1

1 -- 0Sanjoy Dasgupta. Special issue on learning theory
2 -- 15Laurence Bisht, Nader H. Bshouty, Lawrance Khoury. Learning with errors in answers to membership queries
16 -- 34Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi. The complexity of properly learning simple concept classes
35 -- 48Adam R. Klivans, Rocco A. Servedio. Learning intersections of halfspaces with a margin
49 -- 69Jon M. Kleinberg, Mark Sandler. Using mixture models for collaborative filtering
70 -- 83David Kempe, Frank McSherry. A decentralized algorithm for spectral analysis
84 -- 96David A. McAllester, Michael Collins, Fernando Pereira. Case-factor diagrams for structured probabilistic modeling
97 -- 114Baruch Awerbuch, Robert Kleinberg. Online linear optimization and adaptive routing
115 -- 130Sham M. Kakade, Dean P. Foster. Deterministic calibration and Nash equilibrium