default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computer and System Sciences, Volume 78
Volume 78, Number 1, January 2012
- Luigi Palopoli
:
Editorʼs foreword. 1
- Vincent Conitzer, Tuomas Sandholm:
Computing optimal outcomes under an expressive representation of settings with externalities. 2-14 - Shahar Dobzinski, Noam Nisan, Michael Schapira:
Truthful randomized mechanisms for combinatorial auctions. 15-25 - Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Riccardo Rosati:
View-based query answering in Description Logics: Semantics and complexity. 26-46 - Thomas Eiter, Magdalena Ortiz, Mantas Simkus:
Conjunctive query answering in the description logic SH using knots. 47-85 - David Pearce, Agustín Valverde:
Synonymous theories and knowledge representations in answer set programming. 86-104 - Sivan Albagli, Rachel Ben-Eliyahu-Zohary, Solomon Eyal Shimony:
Markov network based ontology matching. 105-118 - Alessandro Armando, Enrico Giunchiglia, Marco Maratea, Serena Elisa Ponta:
An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints. 119-141
- Marko Hölbl, Tatjana Welzer, Bostjan Brumen:
An improved two-party identity-based authenticated key agreement protocol using pairings. 142-150 - Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo:
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. 151-163 - Zhi-Zhong Chen, Bin Ma, Lusheng Wang:
A three-string approach to the closest string problem. 164-178 - Luke Mathieson, Stefan Szeider:
Editing graphs to satisfy degree constraints: A parameterized approach. 179-191 - Franco P. Preparata:
Accurate and precise aggregation counting. 192-197 - Henrik Björklund, Wim Martens:
The tractability frontier for NFA minimization. 198-210 - Jianer Chen, Jie Meng:
A 2k kernel for the cluster editing problem. 211-220 - Florentin Ipate:
Learning finite cover automata from queries. 221-244 - Klaus Jansen, Hu Zhang:
Scheduling malleable tasks with precedence constraints. 245-259 - Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo:
Optimal sampling from sliding windows. 260-272 - Yung-Hsing Peng, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor:
A new efficient indexing algorithm for one-dimensional real scaled patterns. 273-278 - Moran Feldman, Guy Kortsarz, Zeev Nutov:
Improved approximation algorithms for Directed Steiner Forest. 279-292 - Jürgen Dassow, Tomás Masopust:
On restricted context-free grammars. 293-304 - Serge Gaspers, Gregory B. Sorkin:
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. 305-335 - Matthijs Bomhoff, Walter Kern, Georg Still:
On bounded block decomposition problems for under-specified systems of equations. 336-347 - Jürg Kohlas, Marc Pouly, Cesar Schneuwly:
Generic local computation. 348-369 - Amir Talaei-Khoei, Terje Solvoll, Pradeep Ray, Nandan Parameswaran:
Maintaining awareness using policies; Enabling agents to identify relevance of information. 370-391
Volume 78, Number 2, March 2012
- Helmut Veith:
Special Issue: Games in Verification. 393 - Krishnendu Chatterjee, Thomas A. Henzinger:
A survey of stochastic ω-regular games. 394-413 - Sharon Shoham, Orna Grumberg:
Multi-valued model checking games. 414-429 - Keijo Heljanko, Misa Keinänen, Martin Lange, Ilkka Niemelä:
Solving parity games by a reduction to SAT. 430-440 - Barbara Jobstmann, Stefan Staber, Andreas Griesmayer, Roderick Bloem:
Finding and fixing faults. 441-460 - Markus Lohrey:
Model-checking hierarchical structures. 461-490
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Drawing a tree as a minimum spanning tree approximation. 491-503 - Jing Tian, Xianzhong Zhao:
Representations of commutative asynchronous automata. 504-516 - Nicolas Bedon, Chloé Rispal:
Schützenberger and Eilenberg theorems for words on linear orderings. 517-536 - Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
Size complexity of rotating and sweeping automata. 537-558 - Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
On making directed graphs transitive. 559-574 - Pedro C. S. Lara, Fábio Borges, Renato Portugal, Nadia Nedjah:
Parallel modular exponentiation using load balancing without precomputation. 575-582 - Daniel Deutch, Tova Milo:
A structural/temporal query language for Business Processes. 583-609 - Zehui Shao, Fei Deng, Meilian Liang, Xiaodong Xu:
On sets without k-term arithmetic progression. 610-618 - Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Ultra-succinct representation of ordered trees with applications. 619-631 - Raphael Yuster:
Approximate shortest paths in weighted graphs. 632-637 - Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx:
Enumerating homomorphisms. 638-650 - Jonathan Katz, Philip D. MacKenzie, Gelareh Taban, Virgil D. Gligor:
Two-server password-only authenticated key exchange. 651-669 - Ken-ichi Kawarabayashi, Yusuke Kobayashi:
A linear time algorithm for the induced disjoint paths problem in planar graphs. 670-680 - Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby:
The complexity of weighted and unweighted #CSP. 681-688
Volume 78, Number 3, May 2012
- Minghui Jiang:
Approximability of constrained LCS. 689-697 - Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao:
Faster algorithms for finding and counting subgraphs. 698-706 - Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger:
Local search: Is brute-force avoidable? 707-719 - Guohui Lin, Randy Goebel, Zhong Li, Lusheng Wang:
An improved approximation algorithm for the complementary maximal strip recovery problem. 720-730 - Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed-point tile sets and their applications. 731-764 - Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran:
Space complexity of perfect matching in bounded genus bipartite graphs. 765-779 - Benedek Nagy, Friedrich Otto:
On CD-systems of stateless deterministic R-automata with window size one. 780-806 - Tianrong Lin:
Another approach to the equivalence of measure-many one-way quantum finite automata and its application. 807-821
- Ahmed Bouajjani, David Harel, Lenore D. Zuck:
Editorʼs foreword. 822 - Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog, Stijn de Gouw:
Verification of object-oriented programs: A transformational approach. 823-852 - Ittai Balaban, Amir Pnueli, Yaniv Sa'ar, Lenore D. Zuck:
Verification of multi-linked heaps. 853-876 - Albert Benveniste, Timothy Bourke, Benoît Caillaud, Marc Pouzet:
Non-standard semantics of hybrid systems modelers. 877-910 - Roderick Bloem, Barbara Jobstmann, Nir Piterman, Amir Pnueli, Yaniv Sa'ar:
Synthesis of Reactive(1) designs. 911-938 - Egon Börger, Antonio Cisternino, Vincenzo Gervasi:
Ambient Abstract State Machines with applications. 939-959 - Nissim Francez:
When are different type-logical semantic definitions defining equivalent meanings? 960-969 - David Harel, Itai Segall:
Synthesis from scenario-based specifications. 970-980 - Orna Kupferman, Amir Pnueli, Moshe Y. Vardi:
Once and for all. 981-996
Volume 78, Number 4, July 2012
- Chunfu Wei, Zheng Pei, Huamin Li:
An induced OWA operator in coal mine safety evaluation. 997-1005 - Prakash Ramanan:
Rewriting XPath queries using materialized XPath views. 1006-1025 - Sebastian Link:
Characterisations of multivalued dependency implication over undetermined universes. 1026-1044 - Millist W. Vincent, Jixue Liu, Mukesh K. Mohania:
The implication problem for 'closest node' functional dependencies in complete XML documents. 1045-1098 - Xiaowen Lou, Daming Zhu:
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations. 1099-1114 - Anahí Gajardo, Jarkko Kari, Andrés Moreira:
On time-symmetry in cellular automata. 1115-1126 - Yicheng Wen, Asok Ray:
Vector space formulation of probabilistic finite state automata. 1127-1141 - Amos Beimel, Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang:
Communication-efficient distributed oblivious transfer. 1142-1157
- Rahat Iqbal, Nazaraf Shah:
Information Retrieval, Decision Making Process and User Needs. 1158-1159 - Jonathan Gemmell, Thomas Schimoler, Bamshad Mobasher, Robin D. Burke:
Resource recommendation in social annotation systems: A linear-weighted hybrid approach. 1160-1174 - Magdalini Eirinaki, Shamita Pisal, Japinder Singh:
Feature-based opinion mining and ranking. 1175-1184 - Haifeng Shen, Mark D. Reilly:
Personalized multi-user view and content synchronization and retrieval in real-time mobile social software applications. 1185-1203 - Adam Grzywaczewski, Rahat Iqbal:
Task-specific information retrieval systems for software engineers. 1204-1218 - Fazilatur Rahman, Jawed I. A. Siddiqi:
Semantic annotation of digital music. 1219-1231 - Giuseppe Fenza, Domenico Furno, Vincenzo Loia:
Hybrid approach for context-aware service discovery in healthcare domain. 1232-1247 - Pir Abdul Rasool Qureshi, Nasrullah Memon:
Hybrid model of content extraction. 1248-1257 - Kashif Iqbal, Michael O. Odetayo, Anne E. James:
Content-based image retrieval approach for biometric security using colour, texture and shape features controlled by fuzzy heuristics. 1258-1277
Volume 78, Number 5, September 2012
- Jinjun Chen, Lizhe Wang:
Special Issue: Cloud Computing 2011. 1279 - Linlin Wu, Saurabh Kumar Garg, Rajkumar Buyya:
SLA-based admission control for a Software-as-a-Service provider in Cloud computing environments. 1280-1299 - Rafael Tolosana-Calasanz, José Ángel Bañares, Congduc Pham, Omer F. Rana:
Enforcing QoS in scientific workflow systems enacted over Cloud infrastructures. 1300-1315 - Lianyong Qi, Wanchun Dou, Xuyun Zhang, Jinjun Chen:
A QoS-aware composition method supporting cross-platform service invocation in cloud environment. 1316-1329 - David Villegas, Norman Bobroff, Ivan Rodero, Javier Delgado, Yanbin Liu, Aditya Devarakonda, Liana Fong, Seyed Masoud Sadjadi, Manish Parashar:
Cloud federation in a layered service model. 1330-1344 - Jing He, Yanchun Zhang, Guangyan Huang, Yong Shi, Jie Cao:
Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds. 1345-1358 - David W. Chadwick, Kaniz Fatema:
A privacy preserving authorisation system for the cloud. 1359-1373 - Gaofeng Zhang, Yun Yang, Jinjun Chen:
A historical probability based noise generation strategy for privacy protection in cloud computing. 1374-1381 - Fabrizio Marozzo, Domenico Talia, Paolo Trunfio:
P2P-MapReduce: Parallel data processing in dynamic Cloud environments. 1382-1402
- Alexander Rakhlin:
Foreword. 1403 - Nicolò Cesa-Bianchi, Gábor Lugosi:
Combinatorial bandits. 1404-1422 - Arnak S. Dalalyan, Alexandre B. Tsybakov:
Sparse regression learning by aggregation and Langevin Monte-Carlo. 1423-1443 - Vitaly Feldman:
A complete characterization of statistical query learning with applications to evolvability. 1444-1459 - Daniel J. Hsu, Sham M. Kakade, Tong Zhang:
A spectral algorithm for learning Hidden Markov Models. 1460-1480 - Adam Tauman Kalai, Varun Kanade, Yishay Mansour:
Reliable agnostic learning. 1481-1495 - Samory Kpotufe, Sanjoy Dasgupta:
A tree-based regressor that adapts to intrinsic dimension. 1496-1515 - Alessandro Lazaric, Rémi Munos:
Learning with stochastic inputs and adversarial outputs. 1516-1537 - Yisong Yue, Josef Broder, Robert Kleinberg, Thorsten Joachims:
The K-armed dueling bandits problem. 1538-1556
- Charles Jordan, Thomas Zeugmann:
Testable and untestable classes of first-order formulae. 1557-1578 - Prasad Chebolu, Leslie Ann Goldberg, Russell Martin:
The complexity of approximately counting stable roommate assignments. 1579-1605 - Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Catalan structures and dynamic programming in H-minor-free graphs. 1606-1622 - Lorenzo Carlucci, Sanjay Jain, Frank Stephan:
Learning with ordinal-bounded memory from positive data. 1623-1636 - Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang:
Multicut in trees viewed through the eyes of vertex cover. 1637-1650 - Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß:
Parameter reduction and automata evaluation for grammar-compressed trees. 1651-1669
Volume 78, Number 6, November 2012
- Qun Jin, Yufeng Wang:
Special Issue on Multidisciplinary Emerging Networks and Systems. 1671-1672 - Shinsuke Kajioka, Naoki Wakamiya, Masayuki Murata:
Autonomous and adaptive resource allocation among multiple nodes and multiple applications in heterogeneous wireless networks. 1673-1685 - Chi Lin, Guowei Wu, Feng Xia, Mingchu Li, Lin Yao, Zhongyi Pei:
Energy efficient ant colony algorithms for data aggregation in wireless sensor networks. 1686-1702 - Eitaro Kohno, Tomoya Okazaki, Mario Takeuchi, Tomoyuki Ohta, Yoshiaki Kakuda, Masaki Aida:
Improvement of assurance including security for wireless sensor networks using dispersed data transmission. 1703-1715 - Agustinus Borgy Waluyo, David Taniar, J. Wenny Rahayu, Ailixier Aikebaier, Makoto Takizawa, Bala Srinivasan:
Trustworthy-based efficient data broadcast model for P2P interaction in resource-constrained wireless environments. 1716-1736 - Xinxin Fan, Mingchu Li, Jianhua Ma, Yizhi Ren, Hui Zhao, Zhiyuan Su:
Behavior-based reputation management in P2P file-sharing networks. 1737-1750 - Tadashi Dohi, Toshikazu Uemura:
An adaptive mode control algorithm of a scalable intrusion tolerant architecture. 1751-1774 - Hong Chen, Xiaokang Zhou, Qun Jin:
Socialized ubiquitous personal study: Toward an individualized information portal. 1775-1792
- Henning Fernau, Carlos Martín-Vide:
From the Guest Editors. 1793-1794 - Dag Hovland:
The inclusion problem for regular expressions. 1795-1813 - Martin Kutrib, Andreas Malcher:
Reversible pushdown automata. 1814-1827 - Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
The maximal number of cubic runs in a word. 1828-1836 - Stefano Crespi-Reghizzi, Dino Mandrioli:
Operator precedence and the visibly pushdown property. 1837-1867 - Alberto Policriti, Alexandru I. Tomescu, Francesco Vezzi:
A randomized Numerical Aligner (rNA). 1868-1882 - Pablo Arrighi, Jonathan Grattage:
Intrinsically universal n-dimensional quantum cellular automata. 1883-1898 - Wojciech Buszkowski, Zhe Lin, Katarzyna Moroz:
Pregroup grammars with letter promotions: Complexity and context-freeness. 1899-1909 - Sanjay Jain, Qinglong Luo, Frank Stephan:
Learnability of automatic classes. 1910-1927
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-01 22:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
