White Space Regions (English)
- New search for: Ehsani, S.
- New search for: Fazli, M.
- New search for: Ghodsi, M.
- New search for: Safari, M.
- New search for: Saghafian, M.
- New search for: Tavakkoli, M.
- New search for: Ehsani, S.
- New search for: Fazli, M.
- New search for: Ghodsi, M.
- New search for: Safari, M.
- New search for: Saghafian, M.
- New search for: Tavakkoli, M.
- New search for: Cerna, Ivana
In:
Current trends in theory and practice of computer science; SOFSEM
6543
;
226-237
;
2011
-
ISBN:
-
ISSN:
- Conference paper / Print
-
Title:White Space Regions
-
Contributors:Ehsani, S. ( author ) / Fazli, M. ( author ) / Ghodsi, M. ( author ) / Safari, M. ( author ) / Saghafian, M. ( author ) / Tavakkoli, M. ( author ) / Cerna, Ivana
-
Conference:Conference; 37th, Current trends in theory and practice of computer science; SOFSEM ; 2011 ; Novy Smokovec, Slovakia
-
Published in:Current trends in theory and practice of computer science; SOFSEM , 6543 ; 226-237LECTURE NOTES IN COMPUTER SCIENCE , 6543 ; 226-237
-
Publisher:
- New search for: Springer
-
Place of publication:Heidelberg
-
Publication date:2011-01-01
-
Size:12 pages
-
Remarks:Includes bibliographical references and author index.
-
ISBN:
-
ISSN:
-
Type of media:Conference paper
-
Type of material:Print
-
Language:English
-
Keywords:
-
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Integrity and Consistency for Untrusted Services (Extended Abstract)Cachin, C. et al. | 2011
- 15
-
A Structured Codesign Approach to Many-Core Architectures for Embedded SystemsGutknecht, J. et al. | 2011
- 26
-
SIMPL Systems, or: Can We Design Cryptographic Hardware without Secret Key Information?Ruhrmair, U. et al. | 2011
- 46
-
Verification of Timed-Arc Petri NetsJacobsen, L. / Jacobsen, M. / Moller, M.H. / Srba, J. et al. | 2011
- 73
-
Efficient Algorithms for Handling Nondeterministic AutomataVojnar, T. et al. | 2011
- 74
-
The Straight-Line RAC Drawing Problem Is NP-HardArgyriou, E.N. / Bekos, M.A. / Symvonis, A. et al. | 2011
- 86
-
Tracking the Evolution of Code ClonesBakota, T. et al. | 2011
- 99
-
Liquidsoap: A High-Level Programming Language for Multimedia StreamingBaelde, D. / Beauxis, R. / Mimram, S. et al. | 2011
- 111
-
Combining Traditional Map Labeling with Boundary LabelingBekos, M.A. / Kaufmann, M. / Papadopoulos, D. / Symvonis, A. et al. | 2011
- 123
-
On Making a Distinguished Vertex Minimum Degree by Vertex DeletionBetzler, N. / Bredereck, R. / Niedermeier, R. / Uhlmann, J. et al. | 2011
- 135
-
Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential SizeBollig, B. / Gille, M. et al. | 2011
- 146
-
GreedyMAX-type Algorithms for the Maximum Independent Set ProblemBorowiecki, P. / Goring, F. et al. | 2011
- 157
-
Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost FunctionsChikalov, I. / Hussain, S. / Moshkov, M. et al. | 2011
- 166
-
One-Reversal Counter Machines and Multihead Automata: RevisitedChiniforooshan, E. / Daley, M. / Ibarra, O.H. / Kari, L. / Seki, S. et al. | 2011
- 178
-
Collisionless Gathering of Robots with an ExtentCord-Landwehr, A. / Degener, B. / Fischer, M. / Hullmann, M. / Kempkes, B. / Klaas, A. / Kling, P. / Kurras, S. / Martens, M. / Heide, F.M.a.d. et al. | 2011
- 190
-
Min-Max Coverage in Multi-interface NetworksD Angelo, G. / Di Stefano, G. / Navarra, A. et al. | 2011
- 202
-
Bandwidth Constrained Multi-interface NetworksD Angelo, G. / Di Stefano, G. / Navarra, A. et al. | 2011
- 214
-
A Privacy-Preserving ID-Based Group Key Agreement Scheme Applied in VPANDe Mulder, Y. / Wouters, K. / Preneel, B. et al. | 2011
- 226
-
White Space RegionsEhsani, S. / Fazli, M. / Ghodsi, M. / Safari, M. / Saghafian, M. / Tavakkoli, M. et al. | 2011
- 238
-
New Results on the Complexity of the Max- and Min-Rep ProblemsGanian, R. et al. | 2011
- 248
-
In-Place SortingGeffert, V. / Gajdos, J. et al. | 2011
- 260
-
On d-Regular Schematization of Embedded PathsGemsa, A. / Nollenburg, M. / Pajor, T. / Rutter, I. et al. | 2011
- 272
-
Upward Point-Set EmbeddabilityGeyer, M. / Kaufmann, M. / Mchedlidze, T. / Symvonis, A. et al. | 2011
- 284
-
Cooperative Query Answering by Abstract InterpretationHalder, R. / Cortesi, A. et al. | 2011
- 297
-
An Improved B+ Tree for Flash File SystemsHavasi, F. et al. | 2011
- 308
-
Comparing GPU and CPU in OLAP Cubes CreationKaczmarski, K. et al. | 2011
- 320
-
A Power Consumption Analysis Technique Using UML-Based Design Models in Embedded Software DevelopmentKim, D.-H. / Kim, J.-P. / Hong, J.-E. et al. | 2011
- 332
-
Advice Complexity and Barely Random AlgorithmsKomm, D. / Kralovic, R. et al. | 2011
- 344
-
Alternative Parameterizations for Cluster EditingKomusiewicz, C. / Uhlmann, J. et al. | 2011
- 356
-
The Complexity of Finding kth Most Probable Explanations in Probabilistic NetworksKwisthout, J.H.P. / Bodlaender, H.L. / van der Gaag, L.C. et al. | 2011
- 368
-
Optimal File-Distribution in Heterogeneous and Asymmetric Storage NetworksLangner, T. / Schindelhauer, C. / Souza, A. et al. | 2011
- 382
-
On the Complexity of the Metric TSP under Stability ConsiderationsMihalak, M. / Schongens, M. / Sramek, R. / Widmayer, P. et al. | 2011
- 394
-
Structural Properties of Hard Metric TSP Inputs (Extended Abstract)Momke, T. et al. | 2011
- 406
-
An Automata-Theoretical Characterization of Context-Free Trace LanguagesNagy, B. / Otto, F. et al. | 2011
- 418
-
Unambiguous UML Composite Structures: The OMEGA2 ExperienceOber, I. / Dragomir, I. et al. | 2011
- 431
-
Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free LanguagesOkhotin, A. et al. | 2011
- 444
-
A Local Search Algorithm for BranchwidthOverwijk, A. / Penninkx, E. / Bodlaender, H.L. et al. | 2011
- 455
-
Finding the Description of Structure by Counting Method: A Case StudyPeder, A. / Tombak, M. et al. | 2011
- 467
-
On Approximating the d-Girth of a GraphPeleg, D. / Sau, I. / Shalom, M. et al. | 2011
- 482
-
SScAC: Towards a Framework for Small-Scale Software Architectures ComparisonPraus, P. / Jaromerska, S. / Cerny, T. et al. | 2011
- 494
-
Folk Theorems on the Correspondence between State-Based and Event-Based SystemsReniers, M.A. / Willemse, T.A.C. et al. | 2011
- 506
-
Privacy, Liveliness and Fairness for ReputationSchiffner, S. / Clauss, S. / Steinbrecher, S. et al. | 2011
- 520
-
Minimizing Interference for the Highway Model in Wireless Ad-Hoc and Sensor NetworksTan, H. / Lou, T. / Lau, F.C.M. / Wang, Y. / Chen, S. et al. | 2011
- 533
-
Join-Queries between Two Spatial Datasets Indexed by a Single R^*-TreeVassilakopoulos, M. / Corral, A. / Karanikolas, N.N. et al. | 2011
- 545
-
Information Leakage Analysis by Abstract InterpretationZanioli, M. / Cortesi, A. et al. | 2011
- 558
-
Partition into Triangles on Bounded Degree Graphsvan Rooij, J.M.M. / van Kooten Niekerk, M.E. / Bodlaender, H.L. et al. | 2011