@inproceedings{GreschbachKB12,
author = {Benjamin Greschbach and
Gunnar Kreitz and
Sonja Buchegger},
title = {The devil is in the metadata -- New privacy challenges in
Decentralised Online Social Networks},
booktitle = {Tenth Annual IEEE International Conference on Pervasive
Computing and Communications, PerCom 2012, March 19-23,
2012, Lugano, Switzerland, Workshop Proceedings},
isbn = {978-1-4673-0905-9},
publisher = {IEEE},
year = {2012},
pages = {333-339},
doi = {10.1109/PerComW.2012.6197506},
pdf = {GreschbachKB12_MetadataPrivacyDecentralisedOnlineSocialNetworks.pdf}
}
@inproceedings{GreschbachB12,
author = {Benjamin Greschbach and
Sonja Buchegger},
title = {Friendly Surveillance -- A New Adversary Model for Privacy in
Decentralized Online Social Networks},
booktitle = {Fifth interdisciplinary Conference on Current Issues in
IT Security 2012, May 08-10, 2012, Freiburg, Germany,
Proceedings},
isbn = {978-3-428-13887-6},
publisher = {Duncker & Humblot, Berlin},
year = {2012},
pages = {195-206},
pdf = {GreschbachB12_FriendAdversaryModelPrivacyOnlineSocialNetworks.pdf}
}
@article{BorgesGNMAC12,
title = {Characterizing SopCast client behavior},
journal = {Computer Communications},
volume = {35},
number = {8},
pages = {1004 - 1016},
year = {2012},
issn = {0140-3664},
doi = {10.1016/j.comcom.2012.02.012},
url = {http://www.sciencedirect.com/science/article/pii/S0140366412000710},
author = {Alex Borges and Pedro Gomes and Jos\'{e} Nacif and Rodrigo Mantini and Jussara M. Almeida and S\'{e}rgio Campos}
}
@inproceedings{GomesCB12,
title = {Verification of {P2P} Live Streaming Systems Using Symmetry-based Semiautomatic Abstractions},
author = {Pedro Gomes and Sergio Campos and Alex Borges},
booktitle = {3rd International Workshop on Modeling and Simulation of Peer-to-Peer Architectures and Systems (MOSPAS)},
month = {June},
year = {2012},
localtion = {Madrid, Spain},
note = {Accepted. To be published.}
}
@article{CheraghchiHI12,
author = {M.~Cheraghchi and J.~H{\aa}stad and M.~Isaksson and
O. Svensson},
title = {Approximating Linear Threshold Predicates},
journal = {ACM Transactins on Computation Theory},
volume = {4},
year = {2012},
pages = {1--31},
pdf = {dhio12}
}
@article{KrishnamurthyS12,
author = {Supriya Krishnamurthy and Sumedha},
title = {On the behaviour of random K -SAT on trees},
journal = {Journal of Statistical Mechanics: Theory and Experiment},
volume = {2012},
number = {05},
pages = {P05009},
url = {http://stacks.iop.org/1742-5468/2012/i=05/a=P05009},
year = {2012}
}
@misc{Soleimanifard12,
author = {Soleimanifard, Siavash},
institution = {KTH, Theoretical Computer Science, TCS},
note = {QC 20120507},
pages = {90},
school = {KTH, Theoretical Computer Science, TCS},
title = {Procedure-Modular Verification of Temporal Safety Properties},
series = {Trita-CSC-A},
year = {2012}
}
@inproceedings{kann12,
author = {V. Kann},
title = {L\"arosalsgruppen fixar salarna \aa t l\"ararna!},
booktitle = {Proc. NU2012},
address = {Chalmers, G\"oteborg},
year = {2012},
project = {Computer science education}
}
@article{PietrzakW12,
author = {Krzysztof Pietrzak and
Douglas Wikstr{\"o}m},
title = {Parallel Repetition of Computationally Sound Protocols Revisited},
journal = {J. Cryptology},
volume = {25},
number = {1},
year = {2012},
pages = {116-135}
}
@article{KhazaeiW12,
author = {Shahram Khazaei and
Douglas Wikstr{\"o}m},
title = {Randomized Partial Checking Revisited},
journal = {IACR Cryptology ePrint Archive},
volume = {2012},
year = {2012},
pages = {63}
}
@article{KhazaeiTW12,
author = {Shahram Khazaei and
Bj{\"o}rn Terelius and
Douglas Wikstr{\"o}m},
title = {Cryptanalysis of a Universally Verifiable Efficient Re-encryption
Mixnet},
journal = {IACR Cryptology ePrint Archive},
volume = {2012},
year = {2012},
pages = {100}
}
@article{Lampis12-1,
author = {Michael Lampis},
title = {Algorithmic Meta-theorems for Restrictions of Treewidth},
journal = {Algorithmica},
volume = {64},
number = {1},
year = {2012},
pages = {19-37}
}
@article{AchilleosLM12,
author = {Antonis Achilleos and
Michael Lampis and
Valia Mitsou},
title = {Parameterized Modal Satisfiability},
journal = {Algorithmica},
volume = {64},
number = {1},
year = {2012},
pages = {38-55}
}
@article{Bar-NoyL12,
author = {Amotz Bar-Noy and
Michael Lampis},
title = {Online maximum directed cut},
journal = {J. Comb. Optim.},
volume = {24},
number = {1},
year = {2012},
pages = {52-64}
}
@article{LampisMS12,
author = {Michael Lampis and
Valia Mitsou and
Karolina Soltys},
title = {Scrabble is PSPACE-Complete},
journal = {CoRR},
volume = {abs/1201.5298},
year = {2012},
ee = {http://arxiv.org/abs/1201.5298},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{Lampis12-2,
author = {Michael Lampis},
title = {Improved Inapproximability for {TSP}},
booktitle = {APPROX-RANDOM},
year = {2012},
pages = {243-253},
ee = {http://dx.doi.org/10.1007/978-3-642-32512-0_21},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{BalliuDG12,
author = {Musard Balliu and
Mads Dam and
Gurvan Le Guernic},
title = {ENCoVer: Symbolic Exploration for Information Flow Security},
booktitle = {CSF},
year = {2012},
pages = {30-44},
ee = {http://doi.ieeecomputersociety.org/10.1109/CSF.2012.24},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{KreitzBGRB12,
author = {Gunnar Kreitz and
Oleksandr Bodriagov and
Benjamin Greschbach and
Guillermo Rodr\'{\i}guez-Cano and
Sonja Buchegger},
title = {Passwords in peer-to-peer},
booktitle = {{P2P}},
year = {2012},
pages = {167-178},
ee = {http://dx.doi.org/10.1109/P2P.2012.6335797},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{YanggratokeKGS12,
author = {Rerngvit Yanggratoke and
Gunnar Kreitz and
Mikael Goldmann and
Rolf Stadler},
title = {Predicting response times for the Spotify backend},
booktitle = {CNSM},
year = {2012},
pages = {117-125},
ee = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6379999},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{PaulGBS12,
author = {Paul, Thomas and Greschbach, Benjamin and Buchegger, Sonja and Strufe, Thorsten},
title = {Exploring decentralization dimensions of social networking services: adversaries and availability},
booktitle = {Proceedings of the First ACM International Workshop on Hot Topics on Interdisciplinary Social Networks Research},
series = {HotSocial '12},
year = {2012},
isbn = {978-1-4503-1549-4},
location = {Beijing, China},
pages = {49-56},
numpages = {8},
doi = {10.1145/2392622.2392630},
publisher = {ACM},
address = {New York, NY, USA}
}
@inproceedings{TereliusW12,
author = {Bj{\"o}rn Terelius and Douglas Wikstr{\"o}m},
title = {Efficiency Limitations of Sigma-protocols for Group Homomorphisms Revisited},
booktitle = {SCN},
year = {2012},
pages = {461-476}
}
@inproceedings{BoyeFGGK12,
author = {J.~Boye and M.~Fredriksson and J.~G\"{o}tze and J.~Gustafson and J.~K\"{o}nigsmann},
title = {Walk this way: Spatial grounding for city exploration},
booktitle = {IWSDS},
year = {2012},
note = {to appear}
}
@inproceedings{JanarthanamLLBMDG12-1,
author = {S.~Janarthanam and O.~Lemon and X.~Liu and P.~Bartie and W.~Mackaness and T.~Dalmas and J.~G\"{o}tze},
title = {Integrating location, visibility, and Question-Answering in a spoken dialogue system for pedestrian city exploration},
booktitle = {SIGDIAL},
year = {2012},
pages = {314-316},
location = {Seoul, South Korea}
}
@inproceedings{JanarthanamLLBMDG12-2,
author = {S.~Janarthanam and O.~Lemon and X.~Liu and P.~Bartie and W.~Mackaness and T.~Dalmas and J.~G\"{o}tze},
title = {Integrating location, visibility, and Question-Answering in a spoken dialogue system for pedestrian city exploration},
booktitle = {SEMDIAL},
year = {2012},
pages = {157-158},
location = {Paris, France}
}
@inproceedings{JanarthanamLLBMDG12-3,
author = {S.~Janarthanam and O.~Lemon and X.~Liu and P.~Bartie and W.~Mackaness and T.~Dalmas and J.~G\"{o}tze},
title = {Conversational Natural Language Interaction for Place-related Knowledge Acquisition},
booktitle = {Place-related Knowledge Acquisition Research Workshop (PKAR), Spatial Cognition Conference},
year = {2012},
pages = {33-38},
location = {Germany}
}
@inproceedings{JonssonPV12,
author = {Kristj\'{a}n Valur J\'{o}nsson and Karl Palmskog and Ymir Vigf\'{u}sson},
title = {Secure Distributed Top-k Aggregation},
booktitle = {Proceedings of IEEE International Conference on Communications (ICC)},
year = 2012,
month = {June}
}
@inproceedings{Hastad12,
author = {Johan H{\aa}stad},
title = {On the {NP}-Hardness of {Max-Not-2}},
booktitle = {APPROX-RANDOM},
year = {2012},
pages = {170-181},
ee = {http://dx.doi.org/10.1007/978-3-642-32512-0_15},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{BarakGHMRS12,
author = {Boaz Barak and
Parikshit Gopalan and
Johan H{\aa}stad and
Raghu Meka and
Prasad Raghavendra and
David Steurer},
title = {Making the Long Code Shorter},
booktitle = {FOCS},
year = {2012},
pages = {370-379},
ee = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2012.83},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{AustrinH12-2,
author = {Per Austrin and
Johan H{\aa}stad},
title = {On the Usefulness of Predicates},
journal = {CoRR},
volume = {abs/1204.5662},
year = {2012},
ee = {http://arxiv.org/abs/1204.5662},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{Hastad12-2,
author = {Johan H{\aa}stad},
title = {On the correlation of parity and small-depth circuits},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {19},
year = {2012},
pages = {137},
ee = {http://eccc.hpi-web.de/report/2012/137},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@techreport{MinockMA12,
author = {Michael Minock and Johan Mollevik and Mattias {\AA}sander},
title = {Toward an Active Database Platform for Guiding Urban
Pedestrians},
institution = {Ume{\aa} University Department of Computing Science},
year = {2012},
number = {12.18},
month = {October}
}
@techreport{MinockBCFGLMW12,
author = {Michael Minock and Johan Boye and Stephen Clark and
Morgan Fredriksson, Hector Geffner and Oliver Lemon
and William Mackaness and Bonnie Webber},
title = {Initial description of results and plans for
dissemination},
institution = {SpaceBook project report},
year = {2012},
number = {D7.2.1},
month = {December}
}
@inproceedings{MeinkeNS12,
author = {K. Meinke and F. Niu and M. Sindhu},
title = {Learning-Based Software Testing: a Tutorial},
booktitle = {Leveraging Applications of Formal Methods, Verification, and Validation},
year = {2012},
pages = {200-219},
publisher = {Springer},
series = {CCIS},
number = {336}
}
@inproceedings{MeinkeW12,
author = {K. Meinke and N. Walkinshaw},
title = {Model-Based Testing and Model Inference},
booktitle = {Proc. 5th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation},
year = {2012},
pages = {440-443},
publisher = {Springer},
series = {LNCS},
number = {7609}
}
@inproceedings{MeinkeN12,
author = {K. Meinke and F. Niu},
title = {An Incremental Learning Algorithm for Extended Mealy Automata},
booktitle = {Proc. 5th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation},
year = {2012},
pages = {488-504},
publisher = {Springer},
series = {LNCS},
number = {7609}
}
@article{CaiHL12,
author = {Jin-Yi Cai and
Sangxia Huang and
Pinyan Lu},
title = {From Holant to {\#CSP} and Back: Dichotomy for Holant c Problems},
journal = {Algorithmica},
volume = {64},
number = {3},
year = {2012},
pages = {511-533},
ee = {http://dx.doi.org/10.1007/s00453-012-9626-6},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{HuangL12,
author = {Sangxia Huang and
Pinyan Lu},
title = {A Dichotomy for Real Weighted Holant Problems},
booktitle = {IEEE Conference on Computational Complexity},
year = {2012},
pages = {96-106},
ee = {http://doi.ieeecomputersociety.org/10.1109/CCC.2012.16},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{Huang12,
author = {Sangxia Huang},
title = {Approximation Resistance on Satisfiable Instances for Predicates
Strictly Dominating Parity},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {19},
year = {2012},
pages = {40},
ee = {http://eccc.hpi-web.de/report/2012/040},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@misc{CarvalhoGomes12,
author = {de Carvalho Gomes, Pedro},
institution = {KTH, Theoretical Computer Science, TCS},
note = {QC 20121122},
pages = {vii, 74},
school = {KTH, Theoretical Computer Science, TCS},
title = {Sound Modular Extraction of Control Flow Graphs from Java Bytecode},
series = {Trita-CSC-A},
number = {2012:16},
year = {2012}
}
@techreport{CarvalhoGomesP12,
author = {de Carvalho Gomes, Pedro and Picoco, Attilio},
institution = {KTH, Theoretical Computer Science, TCS},
note = {QC 20121029},
pages = {49},
title = {Sound Extraction of Control-Flow Graphs from open Java Bytecode Systems},
year = {2012}
}
@techreport{AmighiGGH12-1,
author = {Amighi, Afshin and de Carvalho Gomes, Pedro and Gurov, Dilian and Huisman, Marieke},
institution = {KTH, Theoretical Computer Science, TCS},
institution = {University of Twente},
institution = {University of Twente},
note = {QC 20120116},
pages = {30},
publisher = {KTH Royal Institute of Technology and University of Twente},
title = {Provably Correct Control-Flow Graphs from Java Programs with Exceptions},
year = {2012}
}
@inproceedings{AmighiGGH12-2,
author = {Amighi, Afshin and de Carvalho Gomes, Pedro and Gurov, Dilian and Huisman, Marieke},
booktitle = {Software Engineering and Formal Methods : 10th International Conference, SEFM 2012, Thessaloniki, Greece, October 1-5, 2012. Proceedings},
institution = {KTH, Theoretical Computer Science, TCS},
institution = {University of Twente},
institution = {University of Twente},
note = {QC 20121213},
pages = {33--47},
title = {Sound Control-Flow Graph Extraction for {Java}f Programs with Exceptions},
series = {Lecture Notes in Computer Science},
volume = {7504},
year = {2012}
}
@article{CrookFSHPCCMB12,
author = {Crook, N. and Field, D. and Smith, C. and Harding, S. and Pulman, S. and Cavazza, M. and Charlton, D. and Moore, R. and Boye, Johan},
institution = {KTH, Theoretical Computer Science, TCS},
journal = {Journal on Multimodal User Interfaces},
note = {QC 20120810},
number = {1-2},
pages = {13--25},
title = {Generating context-sensitive ECA responses to user barge-in interruptions},
volume = {6},
year = {2012}
}
@inproceedings{AustrinOW12,
author = {Per Austrin and
Ryan O'Donnell and
John Wright},
title = {{A New Point of NP-Hardness for $2$-to-$1$ Label Cover}},
booktitle = {International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX)},
year = {2012},
pages = {1--12},
doi = {10.1007/978-3-642-32512-0_1},
eprint = {1204.5666},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{AustrinPW12,
author = {Per Austrin and
Toniann Pitassi and
Yu Wu},
title = {{Inapproximability of Treewidth, One-Shot Pebbling, and
Related
Layout Problems}},
booktitle = {International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX)},
year = {2012},
pages = {13--24},
doi = {10.1007/978-3-642-32512-0_2},
eprint = {1109.4910},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{AustrinH12,
author = {Per Austrin and
Johan H{\aa}stad},
title = {On the Usefulness of Predicates},
booktitle = {IEEE Conference on Computational Complexity (CCC)},
year = {2012},
pages = {53--63},
doi = {10.1109/CCC.2012.18},
eprint = {1204.5662},
bibsource = {DBLP, http://dblp.uni-trier.de},
pdf = {ah12}
}
@article{Nordstrom12,
author = {Jakob Nordstr{\"o}m},
title = {On the Relative Strength of Pebbling and Resolution},
journal = {ACM Trans. Comput. Log.},
volume = {13},
number = {2},
year = {2012},
pages = {16},
ee = {http://doi.acm.org/10.1145/2159531.2159538},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{JarvisaloMNZ12,
author = {Matti J{\"a}rvisalo and
Arie Matsliah and
Jakob Nordstr{\"o}m and
Stanislav Zivny},
title = {Relating Proof Complexity Measures and Practical Hardness
of SAT},
booktitle = {CP},
year = {2012},
pages = {316-331},
ee = {http://dx.doi.org/10.1007/978-3-642-33558-7_25},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{HuynhN12,
author = {Trinh Huynh and
Jakob Nordstr{\"o}m},
title = {On the virtue of succinct proofs: amplifying communication
complexity hardness to time-space trade-offs in proof complexity},
booktitle = {STOC},
year = {2012},
pages = {233-248},
ee = {http://doi.acm.org/10.1145/2213977.2214000},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{FilmusLNRT12,
author = {Yuval Filmus and
Massimo Lauria and
Jakob Nordstr{\"o}m and
Noga Ron-Zewi and
Neil Thapen},
title = {Space Complexity in Polynomial Calculus},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {19},
year = {2012},
pages = {132},
ee = {http://eccc.hpi-web.de/report/2012/132},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{Bar-NoyCLMZ12,
author = {Amotz Bar-Noy and
Panagiotis Cheilaris and
Michael Lampis and
Valia Mitsou and
Stathis Zachos},
title = {Ordered coloring of grids and related graphs},
journal = {Theor. Comput. Sci.},
volume = {444},
year = {2012},
pages = {40-51},
ee = {http://dx.doi.org/10.1016/j.tcs.2012.04.036},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{Lampis12-3,
author = {Michael Lampis},
title = {Improved Inapproximability for {TSP}},
journal = {CoRR},
volume = {abs/1206.2497},
year = {2012},
ee = {http://arxiv.org/abs/1206.2497},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{Lampis12-4,
author = {Michael Lampis},
title = {Local Improvement Gives Better Expanders},
journal = {CoRR},
volume = {abs/1211.0524},
year = {2012},
ee = {http://arxiv.org/abs/1211.0524},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{BeyersdorffGLR12,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria and
Alexander A. Razborov},
title = {Parameterized Bounded-Depth Frege Is not Optimal},
journal = {TOCT},
volume = {4},
number = {3},
year = {2012},
pages = {7},
ee = {http://doi.acm.org/10.1145/2355580.2355582},
bibsource = {DBLP, http://dblp.uni-trier.de},
doi = {http://doi.acm.org/10.1145/2355580.2355582}
}
@inproceedings{FilmusLNTR12,
author = {Yuval Filmus and
Massimo Lauria and
Jakob Nordstr{\"o}m and
Neil Thapen and
Noga Ron-Zewi},
title = {Space Complexity in Polynomial Calculus},
booktitle = {IEEE Conference on Computational Complexity},
year = {2012},
pages = {334-344},
ee = {http://doi.ieeecomputersociety.org/10.1109/CCC.2012.27},
bibsource = {DBLP, http://dblp.uni-trier.de},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.2012.27}
}
@article{Lauria12,
author = {Massimo Lauria},
title = {A rank lower bound for cutting planes proofs of Ramsey Theorem},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {19},
year = {2012},
pages = {124},
ee = {http://eccc.hpi-web.de/report/2012/124},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{BeyersdorffGL12,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria},
title = {A Characterization of Tree-Like Resolution Size},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {19},
year = {2012},
pages = {161},
ee = {http://eccc.hpi-web.de/report/2012/161},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{DamGL12,
author = {Mads Dam and
Gurvan Le Guernic and
Andreas Lundblad},
title = {TreeDroid: a tree automaton based approach to enforcing
data processing policies},
booktitle = {ACM Conference on Computer and Communications Security},
year = {2012},
pages = {894-905},
ee = {http://doi.acm.org/10.1145/2382196.2382290},
bibsource = {DBLP, http://dblp.uni-trier.de},
url = {http://www.csc.kth.se/~landreas/papers/ccs12.pdf}
}
@inproceedings{PolacekS12,
author = {Polacek, Lukas and Svensson, Ola},
title = {Quasi-polynomial local search for restricted max-min fair
allocation},
booktitle = {Proceedings of the 39th international colloquium conference on
Automata, Languages, and Programming - Volume Part I},
series = {ICALP'12},
year = {2012},
isbn = {978-3-642-31593-0},
location = {Warwick, UK},
pages = {726--737},
numpages = {12},
url = {http://dx.doi.org/10.1007/978-3-642-31594-7_61},
doi = {10.1007/978-3-642-31594-7_61},
acmid = {2359437},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg}
}
@inproceedings{SchwarzG12,
author = {Oliver Schwarz and
Christian Gehrmann},
title = {Securing {DMA} through virtualization},
booktitle = {COMPENG},
year = {2012},
pages = {1-6},
ee = {http://dx.doi.org/10.1109/CompEng.2012.6242958},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{GurovOS12,
author = {Dilian Gurov and
Bjarte {\O}stvold and
Ina Schaefer},
title = {A Hierarchical Variability Model for Software Product Lines},
booktitle = {Post-proceedings of: ISoLa 2011},
year = {2012},
pages = {181-199},
volume = {336},
url = {http://www.nada.kth.se/~dilian/Papers/isola11post.pdf}
}
@inproceedings{Wenner12,
author = {Wenner, Cenny},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
institution = {KTH, Theoretical Computer Science, TCS},
note = {QC 20121114},
pages = {325--337},
publisher = {Springer-Verlag},
title = {Circumventing d-to-1 for approximation resistance of satisfiable predicates strictly containing parity of width four (extended abstract)},
series = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
number = {7408 LNCS},
year = {2012}
}
@inproceedings{KommM12,
author = {Komm, D. and Kr{\’a;}lovič, R. and M{\"o}mke, Tobias},
booktitle = {Computer Science - Theory and Applications},
institution = {KTH, Theoretical Computer Science, TCS},
note = {QC 20121018},
pages = {241--252},
title = {On the advice complexity of the set cover problem},
series = {Lecture Notes in Computer Science},
volume = {7353},
year = {2012}
}
@inproceedings{RechertG12,
author = {Rechert, K. and Greschbach, Benjamin},
booktitle = {Security and Trust Management},
institution = {KTH, Theoretical Computer Science, TCS},
note = {QC 20120806},
pages = {106--121},
title = {Location privacy in relation to trusted peers},
series = {Lecture Notes in Computer Science},
volume = {7170},
year = {2012}
}
@inproceedings{Oliveira12,
author = {De Oliveira Oliveira, Mateus},
booktitle = {Language and Automata Theory and Applications},
institution = {KTH, Theoretical Computer Science, TCS},
note = {QC 20120802},
pages = {445--457},
title = {Canonizable partial order generators},
series = {Lecture Notes in Computer Science},
volume = {7183},
year = {2012}
}
@inproceedings{GreschbachB12-2,
author = {Greschbach, Benjamin and Buchegger, Sonja},
institution = {KTH, Theoretical Computer Science, TCS},
title = {Datenschutz in Dezentralisierten Sozialen Netzwerken},
booktitle = {D-A-CH Security},
year = {2012},
location = {Konstanz, Germany}
}
@inproceedings{KreitzDW12,
author = {Kreitz, Gunnar and Dam, Mads and Wikstr{\"o}m, Douglas},
booktitle = {Information Security Technology For Applications},
institution = {KTH, Theoretical Computer Science, TCS},
note = {QC 20110420},
pages = {89--103},
title = {Practical Private Information Aggregation in Large Networks},
series = {Lecture Notes in Computer Science},
number = {7127},
year = {2012}
}
@article{Wenner12-2,
author = {Cenny Wenner},
title = {Circumventing d-to-1 for Approximation Resistance of Satisfiable
Predicates Strictly Containing Parity of Width at Least
Four},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {19},
year = {2012},
pages = {145},
ee = {http://eccc.hpi-web.de/report/2012/145},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@incollection{BodriagovB12-2,
year = {2012},
isbn = {978-3-642-31667-8},
booktitle = {Privacy and Identity Management for Life},
volume = {375},
series = {IFIP Advances in Information and Communication Technology},
editor = {Camenisch, Jan and Crispo, Bruno and Fischer-H\"{u}bner, Simone and Leenes, Ronald and Russello, Giovanni},
doi = {10.1007/978-3-642-31668-5_15},
title = {{P2P} Social Networks with Broadcast Encryption Protected Privacy},
url = {http://dx.doi.org/10.1007/978-3-642-31668-5_15},
publisher = {Springer Berlin Heidelberg},
author = {Bodriagov, Oleksandr and Buchegger, Sonja},
pages = {197-206}
}
This file was generated by bibtex2html 1.96.