JCSS, Volume 73

Volume 73, Number 1, February 2007

• 
  Véronique Bruyère, Olivier Carton:
  Automata on linear orderings. 1-24
• 
  Jin-yi Cai:
  S₂^p is subset of ZPP^NP. 25-35
• 
  Christian Glaßer:
  Languages polylog-time reducible to dot-depth 1/2. 36-56
• 
  Rodney G. Downey, Catherine McCartin:
  Online promise problems with online width metrics. 57-72
• 
  Edith Hemaspaandra, Lane A. Hemaspaandra:
  Dichotomy for voting systems. 73-83
• 
  Lin Lin, Xue-Hai Yuan, Zun-Quan Xia:
  Multicriteria fuzzy decision-making methods based on intuitionistic fuzzy sets. 84-88
• 
  Sanjay Jain, Yen Kaow Ng, Tiong Seng Tay:
  Learning languages in a union. 89-108
• 
  Valentina S. Harizanov, Frank Stephan:
  On the learnability of vector spaces. 109-122
• 
  Sheng-Tzong Cheng, Ming-Hung Tao:
  Quantum cooperative search algorithm for 3-SAT. 123-136
• 
  Petr Sosík, Alfonso Rodríguez-Patón:
  Membrane computing and complexity theory: A characterization of PSPACE. 137-152

Volume 73, Number 2, March 2007

Special Issue: Real-time and Embedded Systems

• 
  Christopher D. Gill, Oleg Sokolsky:
  Guest Editors' Foreword. 155
• 
  Rajeev Alur, Arun Chandrashekharapuram:
  Dispatch sequences for embedded control models. 156-170
• 
  Krishnakumar Balasubramanian, Jaiganesh Balasubramanian, Jeff Parsons, Aniruddha S. Gokhale, Douglas C. Schmidt:
  A Platform-Independent Component Modeling Language for Distributed Real-time and Embedded Systems. 171-185
• 
  Rodolfo Pellizzoni, Giuseppe Lipari:
  Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling. 186-206
• 
  Ernesto Wandeler, Lothar Thiele:
  Workload correlations in multi-processor hard real-time systems. 207-224
• 
  Björn Andersson, Cecilia Ekelin:
  Exact admission-control for integrated aperiodic and periodic tasks. 225-241

Volume 73, Number 3, May 2007

Special Issue: Database Theory 2004

• 
  Michael Benedikt:
  Database Theory 2004. 243-244
• 
  Mayank Bawa, Aristides Gionis, Hector Garcia-Molina, Rajeev Motwani:
  The price of validity in dynamic networks. 245-264
• 
  Edith Cohen, Haim Kaplan:
  Spatially-decaying aggregation over a network. 265-288
• 
  Thomas Schwentick:
  Automata for XML - A survey. 289-315
• 
  Susan B. Davidson, Wenfei Fan, Carmem S. Hara:
  Propagating XML constraints to relations. 316-361
• 
  Wim Martens, Frank Neven:
  Frontiers of tractability for typechecking simple XML transformations. 362-390
• 
  Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski:
  On the memory requirements of XPath evaluation over XML streams. 391-441
• 
  Alin Deutsch, Liying Sui, Victor Vianu:
  Specification and verification of data-driven Web applications. 442-474
• 
  Francesco Scarcello, Gianluigi Greco, Nicola Leone:
  Weighted hypertree decompositions and optimal query plans. 475-506
• 
  Gerome Miklau, Dan Suciu:
  A formal analysis of information disclosure in data exchange. 507-534

Volume 73, Number 4, June 2007

Special Issue: Database Theory 2005

• 
  Dan Suciu:
  Special issue on database theory. 537
• 
  Dirk Leinders, Jan Van den Bussche:
  On the complexity of division and set joins in the relational algebra. 538-549
• 
  Wim Martens, Joachim Niehren:
  On the minimization of XML Schemas and tree automata for unranked trees. 550-583
• 
  Wolfgang Faber, Gianluigi Greco, Nicola Leone:
  Magic Sets and their application to data integration. 584-609
• 
  Ariel Fuxman, Renée J. Miller:
  First-order query rewriting for inconsistent databases. 610-635
• 
  Solmaz Kolahi:
  Dependency-preserving normalization of relational and XML data. 636-647
• 
  Sara Cohen, Yehoshua Sagiv:
  An incremental algorithm for computing ranked full disjunctions. 648-668
• 
  J. Nathan Foster, Michael B. Greenwald, Christian Kirkegaard, Benjamin C. Pierce, Alan Schmitt:
  Exploiting schemas in data synchronization. 669-689

Volume 73, Number 5, August 2007

• 
  Peter Jonsson, Andrei A. Krokhin:
  Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights. 691-702
• 
  Foto N. Afrati, Chen Li, Jeffrey D. Ullman:
  Using views to generate efficient evaluation plans for queries. 703-724
• 
  Martin Anthony:
  On the generalization error of fixed combinations of classifiers. 725-734
• 
  Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang:
  Autoreducibility, mitoticity, and immunity. 735-754
• 
  MohammadTaghi Hajiaghayi, Naomi Nishimura:
  Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. 755-768
• 
  Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte:
  Undecidability of the structure of the Solovay degrees of c.e. reals. 769-787
• 
  Yasunori Ishihara, Toshiyuki Morita, Hiroyuki Seki, Minoru Ito:
  An equational logic based approach to the security problem against inference attacks on object-oriented databases. 788-817
• 
  Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
  The relative worst-order ratio applied to paging. 818-843

Volume 73, Number 6, September 2007

• 
  Gabriel M. Kuper, Jianwen Su:
  A representation independent language for planar spatial databases with Euclidean distance. 845-874
• 
  Stefano Leonardi, Danny Raz:
  Approximating total flow time on parallel machines. 875-891
• 
  Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia:
  Genus characterizes the complexity of certain graph problems: Some tight results. 892-907
• 
  Gregor Gramlich, Georg Schnitger:
  Minimizing nfa's and regular expressions. 908-923
• 
  José L. Balcázar, Jorge Castro, David Guijarro, Johannes Köbler, Wolfgang Lindner:
  A general dimension for query learning. 924-940
• 
  Parke Godfrey, Jarek Gryz:
  View disassembly: A rewrite that extracts portions of views. 941-961
• 
  Denis Xavier Charles:
  Counting lattice vectors. 962-972
• 
  Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi:
  Individual communication complexity. 973-985
• 
  Telikepalli Kavitha:
  Linear time algorithms for Abelian group isomorphism and related problems. 986-996
• 
  Bin Ma, Lusheng Wang, Ming Li:
  Near optimal multiple alignment within a band in polynomial time. 997-1011
• 
  Radim Belohlávek, Jirí Dvorák, Jan Outrata:
  Fast factorization by similarity in formal concept analysis of data with fuzzy attributes. 1012-1022

Volume 73, Number 7, November 2007

Bioinformatics III

• 
  Richard M. Karp, Ming Li, Pavel A. Pevzner, Ron Shamir:
  Special issue on computational molecular biology. 1023
• 
  Bin Ma, Ming Li:
  On the complexity of the spaced seeds. 1024-1034
• 
  Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur:
  Optimal spaced seeds for faster approximate string matching. 1035-1044
• 
  Yun Cui, Lusheng Wang, Daming Zhu:
  A 1.75-approximation algorithm for unsigned translocation distance. 1045-1059
• 
  Brona Brejová, Daniel G. Brown, Tomás Vinar:
  The most probable annotation problem in HMMs and its application to bioinformatics. 1060-1077
• 
  Shlomo Moran, Sagi Snir:
  Efficient approximation of convex recolorings. 1078-1089
• 
  Frank K. Hwang, F. H. Chang:
  The identification of positive clones in a general inhibitor model. 1090-1094
• 
  Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson:
  Two algorithms for LCS Consecutive Suffix Alignment. 1095-1117

Volume 73, Number 8, December 2007

Network-Based Computing

• 
  Hamid Sarbazi-Azad, Lewis M. Mackenzie:
  Network-based computing. 1119-1120
• 
  Nasser Alzeidi, Ahmad Khonsari, Mohamed Ould-Khaoua, Lewis M. Mackenzie:
  A new approach to model virtual channels in interconnection networks. 1121-1130
• 
  Farshad Safaei, Ahmad Khonsari, Mahmood Fathy, Mohamed Ould-Khaoua:
  Communication delay analysis of fault-tolerant pipelined circuit switching in torus. 1131-1144
• 
  Yu Jiao, Ali R. Hurson:
  Energy-efficient wireless information retrieval. 1145-1163
• 
  Rafael Moreno-Vozmediano, Krishna Nadiminti, Srikumar Venugopal, Ana B. Alonso-Conde, Hussein Gibbins, Rajkumar Buyya:
  Portfolio and investment risk analysis on global grids. 1164-1175
• 
  Riky Subrata, Albert Y. Zomaya, Björn Landfeldt:
  Artificial life techniques for load balancing in computational grids. 1176-1190
• 
  Kai Lu, Riky Subrata, Albert Y. Zomaya:
  On the performance-driven load distribution for heterogeneous computational grids. 1191-1206
• 
  Xiaolong Jin, Geyong Min:
  Performance analysis of priority scheduling mechanisms under heterogeneous network traffic. 1207-1220
• 
  Maziar Goudarzi, Naser MohammadZadeh, Shaahin Hessabi:
  Using on-chip networks to implement polymorphism in the co-design of object-oriented embedded systems. 1221-1231
• 
  Wenjun Xiao, Behrooz Parhami:
  Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks. 1232-1239
• 
  Azzedine Boukerche, Raed Al-Shaikh, Mirela Sechi Moretti Annoni Notare:
  Towards highly available and scalable high performance clusters. 1240-1251