Abstract is missing.
- What is Computation: An Epistemic ApproachJirí Wiedermann, Jan van Leeuwen. 1-13 [doi]
- Progress (and Lack Thereof) for Graph Coloring Approximation ProblemsMagnús M. Halldórsson. 14-23 [doi]
- Recent Results in Scalable Multi-Party ComputationJared Saia, Mahdi Zamani. 24-44 [doi]
- Online Bipartite Matching in Offline Time (Abstract)Piotr Sankowski. 45 [doi]
- Quo Vadis Explicit-State Model CheckingJiri Barnat. 46-57 [doi]
- The Dos and Dont's of Crowdsourcing Software DevelopmentBrian Fitzgerald, Klaas-Jan Stol. 58-64 [doi]
- Adaptively Approximate Techniques in Distributed ArchitecturesBarbara Catania, Giovanna Guerrini. 65-77 [doi]
- Back to the Future - Should SQL Surrender to SPARQL?Rainer Manthey. 78-101 [doi]
- Balancing Energy Consumption for the Establishment of Multi-interface NetworksAlessandro Aloisio, Alfredo Navarra. 102-114 [doi]
- The Maximum k-Differential Coloring ProblemMichael A. Bekos, Michael Kaufmann 0001, Stephen G. Kobourov, Sankar Veeramoni. 115-127 [doi]
- Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean PlaneAlberto Bertoni, Massimiliano Goldwurm, Jianyi Lin. 128-139 [doi]
- Local Routing in Convex SubdivisionsProsenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid. 140-151 [doi]
- Nondeterministic Modal InterfacesFerenc Bujtor, Sascha Fendrich, Gerald Lüttgen, Walter Vogler. 152-163 [doi]
- Group Search on the LineMarek Chrobak, Leszek Gasieniec, Thomas Gorry, Russell Martin. 164-176 [doi]
- Online Makespan Scheduling with Sublinear AdviceJérôme Dohrau. 177-188 [doi]
- Deterministic Rendezvous in Restricted GraphsAshley Farrugia, Leszek Gasieniec, Lukasz Kuszner, Eduardo Pacheco. 189-200 [doi]
- Fastest, Average and Quantile ScheduleArmin Fügenschuh, Konstanty Junosza-Szaniawski, Torsten Klug, Slawomir Kwasiborski, Thomas Schlechte. 201-216 [doi]
- Machine Characterizations for Parameterized Complexity Classes Beyond Para-NPRonald de Haan, Stefan Szeider. 217-229 [doi]
- Maximally Permissive Controlled System Synthesis for Modal LogicAllan van Hulst, Michel A. Reniers, Wan J. Fokkink. 230-241 [doi]
- Approximation Hardness of the Cross-Species Conserved Active Modules Detection ProblemThomas Hume, Hayssam Soueidan, Macha Nikolski, Guillaume Blin. 242-253 [doi]
- Finding Highly Connected SubgraphsFalk Hüffner, Christian Komusiewicz, Manuel Sorge. 254-265 [doi]
- Fixing Improper Colorings of GraphsKonstanty Junosza-Szaniawski, Mathieu Liedloff, Pawel Rzazewski. 266-276 [doi]
- Efficient Online Strategies for Renting Servers in the CloudShahin Kamali, Alejandro López-Ortiz. 277-288 [doi]
- Pal k is Linear Recognizable OnlineDmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur. 289-301 [doi]
- Two Grammatical Equivalents of Flip-Pushdown AutomataPeter Kostolányi. 302-313 [doi]
- On the Hierarchy Classes of Finite Ultrametric AutomataRihards Krislauks, Kaspars Balodis. 314-326 [doi]
- Nash-Williams-type and Chvátal-type Conditions in One-Conflict GraphsChristian Laforest, Benjamin Momège. 327-338 [doi]
- Optimal State Reductions of Automata with Partially Specified BehaviorsNelma Moreira, Giovanni Pighizzini, Rogério Reis. 339-351 [doi]
- Quantum Pushdown Automata with a Garbage TapeMasaki Nakanishi. 352-363 [doi]
- Towards a Characterization of Leaf Powers by Clique ArrangementsRagnar Nevries, Christian Rosenke. 364-376 [doi]
- Filling Logarithmic Gaps in Distributed Complexity for Global ProblemsHiroaki Ookawa, Taisuke Izumi. 377-388 [doi]
- On Visibly Pushdown Trace LanguagesFriedrich Otto. 389-400 [doi]
- Dominating an s-t-Cut in a NetworkRalf Rothenberger, Sascha Grau, Michael Rossberg. 401-411 [doi]
- Lower Bounds for Linear Decision Trees with Bounded WeightsKei Uchizawa, Eiji Takimoto. 412-422 [doi]
- A Model-Driven Approach to Generate External DSLs from Object-Oriented APIsValerio Cosentino, Massimo Tisi, Javier Luis Cánovas Izquierdo. 423-435 [doi]
- Function Based Requirements Engineering and Design -Towards Efficient and Transparent Plant EngineeringFlorian Himmler. 436-448 [doi]
- Software Developer Activity as a Source for Identifying Hidden Source Code DependenciesMartin Konopka, Mária Bieliková. 449-462 [doi]
- Discovering Motifs in Real-World Social NetworksLotte Romijn, Breanndán Ó. Nualláin, Leen Torenvliet. 463-474 [doi]
- Exploiting Semantic Activity Labels to Facilitate Consistent Specialization of Abstract Process ActivitiesAndreas Bögl, Michael Karlinger, Christoph Schütz, Michael Schrefl, Gustav Pomberger. 475-485 [doi]
- Efficient Similarity Search by Combining Indexing and Caching StrategiesNieves R. Brisaboa, Ana Cerdeira-Pena, Veronica Gil Costa, Mauricio Marín, Oscar Pedreira. 486-497 [doi]
- Retrieving Documents Related to Database QueriesVladimir Soares Catão, Marcus Costa Sampaio, Ulrich Schiel. 498-510 [doi]
- Advantages of Dependency Parsing for Free Word Order Natural LanguagesSeyed Amin Mirlohi Falavarjani, Gholamreza Ghassem-Sani. 511-518 [doi]
- Detecting Identical Entities in the Semantic Web DataMichal Holub, Ondrej Proksa, Mária Bieliková. 519-530 [doi]
- Conducting a Web Browsing Behaviour Study - An Educational ScenarioMartin Labaj, Mária Bieliková. 531-542 [doi]
- A Uniform Programmning Language for Implementing XML StandardsPavel Labath, Joachim Niehren. 543-554 [doi]
- OntoSDM: An Approach to Improve Quality on Spatial Data Mining AlgorithmsCarlos Roberto Valêncio, Diogo Lemos Guimaraes, Geraldo F. D. Zafalon, Leandro Alves Neves, Angelo Cesar Colombini. 555-565 [doi]
- Attribute-Based Encryption Optimized for Cloud ComputingMáté Horváth. 566-577 [doi]
- Trustworthy Virtualization of the ARMv7 Memory SubsystemHamed Nemati, Roberto Guanciale, Mads Dam. 578-589 [doi]
- True Random Number Generators Secure in a Changing Environment: Improved Security BoundsMaciej Skorski. 590-602 [doi]
- Java Loops Are Mainly PolynomialMaciej Zielenkiewicz, Jacek Chrzaszcz, Aleksy Schubert. 603-614 [doi]