SOFSEM B

47 papers

YearTitle / Authors
2011A Local Search Algorithm for Branchwidth.
Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender
2011A Power Consumption Analysis Technique Using UML-Based Design Models in Embedded Software Development.
Doohwan Kim, Jong-Phil Kim, Jang-Eui Hong
2011A Privacy-Preserving ID-Based Group Key Agreement Scheme Applied in VPAN.
Yoni De Mulder, Karel Wouters, Bart Preneel
2011A Structured Codesign Approach to Many-Core Architectures for Embedded Systems.
Jürg Gutknecht
2011Advice Complexity and Barely Random Algorithms.
Dennis Komm, Richard Královic
2011Alternative Parameterizations for Cluster Editing.
Christian Komusiewicz, Johannes Uhlmann
2011An Automata-Theoretical Characterization of Context-Free Trace Languages.
Benedek Nagy, Friedrich Otto
2011An Improved B+ Tree for Flash File Systems.
Ferenc Havasi
2011Bandwidth Constrained Multi-interface Networks.
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2011Collisionless Gathering of Robots with an Extent.
Andreas Cord-Landwehr, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, Sven Kurras, Marcus Märtens, Friedhelm Meyer auf der Heide, Christoph Raupach, Kamil Swierkot, Daniel Warner, Christoph Weddemann, Daniel Wonisch
2011Combining Traditional Map Labeling with Boundary Labeling.
Michael A. Bekos, Michael Kaufmann, Dimitrios Papadopoulos, Antonios Symvonis
2011Comparing GPU and CPU in OLAP Cubes Creation.
Krzysztof Kaczmarski
2011Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages.
Alexander Okhotin
2011Cooperative Query Answering by Abstract Interpretation.
Raju Halder, Agostino Cortesi
2011Efficient Algorithms for Handling Nondeterministic Automata.
Tomás Vojnar
2011Finding the Description of Structure by Counting Method: A Case Study.
Ahti Peder, Mati Tombak
2011Folk Theorems on the Correspondence between State-Based and Event-Based Systems.
Michel A. Reniers, Tim A. C. Willemse
2011GreedyMAX-type Algorithms for the Maximum Independent Set Problem.
Piotr Borowiecki, Frank Göring
2011In-Place Sorting.
Viliam Geffert, Jozef Gajdos
2011Information Leakage Analysis by Abstract Interpretation.
Matteo Zanioli, Agostino Cortesi
2011Integrity and Consistency for Untrusted Services - (Extended Abstract).
Christian Cachin
2011Join-Queries between Two Spatial Datasets Indexed by a Single R*-Tree.
Michael Vassilakopoulos, Antonio Corral, Nikitas N. Karanikolas
2011Liquidsoap: A High-Level Programming Language for Multimedia Streaming.
David Baelde, Romain Beauxis, Samuel Mimram
2011Min-Max Coverage in Multi-interface Networks.
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2011Minimizing Interference for the Highway Model in Wireless Ad-Hoc and Sensor Networks.
Haisheng Tan, Tiancheng Lou, Francis C. M. Lau, Yuexuan Wang, Shiteng Chen
2011New Results on the Complexity of the Max- and Min-Rep Problems.
Robert Ganian
2011On
Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter
2011On Approximating the
David Peleg, Ignasi Sau, Mordechai Shalom
2011On Making a Distinguished Vertex Minimum Degree by Vertex Deletion.
Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
2011On the Complexity of the Metric TSP under Stability Considerations.
Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer
2011One-Reversal Counter Machines and Multihead Automata: Revisited.
Ehsan Chiniforooshan, Mark Daley, Oscar H. Ibarra, Lila Kari, Shinnosuke Seki
2011Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks.
Tobias Langner, Christian Schindelhauer, Alexander Souza
2011Partition into Triangles on Bounded Degree Graphs.
Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender
2011Privacy, Liveliness and Fairness for Reputation.
Stefan Schiffner, Sebastian Clauß, Sandra Steinbrecher
2011Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size.
Beate Bollig, Marc Gillé
2011SIMPL Systems, or: Can We Design Cryptographic Hardware without Secret Key Information?
Ulrich Rührmair
2011SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings
Ivana Cerná, Tibor Gyimóthy, Juraj Hromkovic, Keith G. Jeffery, Rastislav Královic, Marko Vukolic, Stefan Wolf
2011SScAC: Towards a Framework for Small-Scale Software Architectures Comparison.
Petr Praus, Slávka Jaromerská, Tomás Cerný
2011Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions.
Igor Chikalov, Shahid Hussain, Mikhail Moshkov
2011Structural Properties of Hard Metric TSP Inputs - (Extended Abstract).
Tobias Mömke
2011The Complexity of Finding
Johan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag
2011The Straight-Line RAC Drawing Problem Is NP-Hard.
Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis
2011Tracking the Evolution of Code Clones.
Tibor Bakota
2011Unambiguous UML Composite Structures: The OMEGA2 Experience.
Iulian Ober, Iulia Dragomir
2011Upward Point-Set Embeddability.
Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis
2011Verification of Timed-Arc Petri Nets.
Lasse Jacobsen, Morten Jacobsen, Mikael H. Møller, Jirí Srba
2011White Space Regions.
Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari, Morteza Saghafian, Mohammad Tavakkoli