default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID37. SOFSEM 2011: Nový Smokovec, Slovakia
- Ivana Cerná, Tibor Gyimóthy, Juraj Hromkovic, Keith G. Jeffery, Rastislav Královic, Marko Vukolic, Stefan Wolf:
SOFSEM 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. Lecture Notes in Computer Science 6543, Springer 2011, ISBN 978-3-642-18380-5 - Christian Cachin:
Integrity and Consistency for Untrusted Services - (Extended Abstract). 1-14 - Jürg Gutknecht:
A Structured Codesign Approach to Many-Core Architectures for Embedded Systems. 15-25 - Ulrich Rührmair:
SIMPL Systems, or: Can We Design Cryptographic Hardware without Secret Key Information? 26-45 - Lasse Jacobsen, Morten Jacobsen, Mikael H. Møller, Jirí Srba
:
Verification of Timed-Arc Petri Nets. 46-72 - Tomás Vojnar:
Efficient Algorithms for Handling Nondeterministic Automata. 73 - Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis:
The Straight-Line RAC Drawing Problem Is NP-Hard. 74-85 - Tibor Bakota:
Tracking the Evolution of Code Clones. 86-98 - David Baelde, Romain Beauxis, Samuel Mimram:
Liquidsoap: A High-Level Programming Language for Multimedia Streaming. 99-110 - Michael A. Bekos, Michael Kaufmann, Dimitrios Papadopoulos, Antonios Symvonis:
Combining Traditional Map Labeling with Boundary Labeling. 111-122 - Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann:
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. 123-134 - Beate Bollig, Marc Gillé:
Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size. 135-145 - Piotr Borowiecki, Frank Göring:
GreedyMAX-type Algorithms for the Maximum Independent Set Problem. 146-156 - Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions. 157-165 - Ehsan Chiniforooshan, Mark Daley, Oscar H. Ibarra, Lila Kari, Shinnosuke Seki:
One-Reversal Counter Machines and Multihead Automata: Revisited. 166-177 - 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:
Collisionless Gathering of Robots with an Extent. 178-189 - Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Min-Max Coverage in Multi-interface Networks. 190-201 - Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Bandwidth Constrained Multi-interface Networks. 202-213 - Yoni De Mulder, Karel Wouters, Bart Preneel:
A Privacy-Preserving ID-Based Group Key Agreement Scheme Applied in VPAN. 214-225 - Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari, Morteza Saghafian, Mohammad Tavakkoli:
White Space Regions. 226-237 - Robert Ganian:
New Results on the Complexity of the Max- and Min-Rep Problems. 238-247 - Viliam Geffert, Jozef Gajdos:
In-Place Sorting. 248-259 - Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
On d-Regular Schematization of Embedded Paths. 260-271 - Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
Upward Point-Set Embeddability. 272-283 - Raju Halder, Agostino Cortesi:
Cooperative Query Answering by Abstract Interpretation. 284-296 - Ferenc Havasi:
An Improved B+ Tree for Flash File Systems. 297-307 - Krzysztof Kaczmarski:
Comparing GPU and CPU in OLAP Cubes Creation. 308-319 - Doohwan Kim, Jong-Phil Kim, Jang-Eui Hong:
A Power Consumption Analysis Technique Using UML-Based Design Models in Embedded Software Development. 320-331 - Dennis Komm, Richard Královic:
Advice Complexity and Barely Random Algorithms. 332-343 - Christian Komusiewicz, Johannes Uhlmann:
Alternative Parameterizations for Cluster Editing. 344-355 - Johan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag:
The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks. 356-367 - Tobias Langner, Christian Schindelhauer, Alexander Souza:
Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks. 368-381 - Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer:
On the Complexity of the Metric TSP under Stability Considerations. 382-393 - Tobias Mömke:
Structural Properties of Hard Metric TSP Inputs - (Extended Abstract). 394-405 - Benedek Nagy, Friedrich Otto:
An Automata-Theoretical Characterization of Context-Free Trace Languages. 406-417 - Iulian Ober, Iulia Dragomir:
Unambiguous UML Composite Structures: The OMEGA2 Experience. 418-430 - Alexander Okhotin:
Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages. 431-443 - Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender:
A Local Search Algorithm for Branchwidth. 444-454 - Ahti Peder, Mati Tombak:
Finding the Description of Structure by Counting Method: A Case Study. 455-466 - David Peleg, Ignasi Sau, Mordechai Shalom:
On Approximating the d-Girth of a Graph. 467-481 - Petr Praus, Slávka Jaromerská, Tomás Cerný:
SScAC: Towards a Framework for Small-Scale Software Architectures Comparison. 482-493 - Michel A. Reniers, Tim A. C. Willemse:
Folk Theorems on the Correspondence between State-Based and Event-Based Systems. 494-505 - Stefan Schiffner, Sebastian Clauß, Sandra Steinbrecher:
Privacy, Liveliness and Fairness for Reputation. 506-519 - Haisheng Tan, Tiancheng Lou, Francis C. M. Lau, Yuexuan Wang, Shiteng Chen:
Minimizing Interference for the Highway Model in Wireless Ad-Hoc and Sensor Networks. 520-532 - Michael Vassilakopoulos, Antonio Corral, Nikitas N. Karanikolas:
Join-Queries between Two Spatial Datasets Indexed by a Single R*-Tree. 533-544 - Matteo Zanioli, Agostino Cortesi:
Information Leakage Analysis by Abstract Interpretation. 545-557 - Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender:
Partition into Triangles on Bounded Degree Graphs. 558-569
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-01-31 22:52 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:
