Practical and Provably Secure Onion Routing (Englisch)
Freier Zugriff
- Neue Suche nach: Ando, Megumi
- Neue Suche nach: Lysyanskaya, Anna
- Neue Suche nach: Upfal, Eli
- Neue Suche nach: Ando, Megumi
- Neue Suche nach: Lysyanskaya, Anna
- Neue Suche nach: Upfal, Eli
- Neue Suche nach: Chatzigiannakis, Ioannis
- Neue Suche nach: Kaklamanis, Christos
- Neue Suche nach: Marx, Dániel
- Neue Suche nach: Sannella, Donald
In:
LIPIcs, Volume 107, ICALP 2018
: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
;
107
;
144:1-144:14
;
2018
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:Practical and Provably Secure Onion Routing
-
Beteiligte:Ando, Megumi ( Autor:in ) / Lysyanskaya, Anna ( Autor:in ) / Upfal, Eli ( Autor:in ) / Chatzigiannakis, Ioannis ( Herausgeber:in ) / Kaklamanis, Christos ( Herausgeber:in ) / Marx, Dániel ( Herausgeber:in ) / Sannella, Donald ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 107, ICALP 2018 : 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) ; 107 ; 144:1-144:14Leibniz International Proceedings in Informatics (LIPIcs) ; 107 ; 144:1-144:14
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:04.07.2018
-
Format / Umfang:14 pages , 496385 byte
-
Anmerkungen:LIPIcs, Vol. 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), pages 144:1-144:14
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Consistent Distributed Memory Services: Resilience and Efficiency (Invited Paper)Hadjistasi, Theophanis / Schwarzmann, Alexander A. et al. | 2018
- 2
-
Sparsity - an Algorithmic Perspective (Invited Paper)Nesetril, Jaroslav et al. | 2018
- 3
-
Probability Theory from a Programming Perspective (Invited Paper)Staton, Sam et al. | 2018
- 4
-
Lower Bounds by Algorithm Design: A Progress Report (Invited Paper)Williams, Richard Ryan et al. | 2018
- 5
-
Power of d Choices with Simple TabulationAamand, Anders / Bæk Tejs Knudsen, Mathias / Thorup, Mikkel et al. | 2018
- 6
-
One-Way Trail OrientationsAamand, Anders / Hjuler, Niklas / Holm, Jacob / Rotenberg, Eva et al. | 2018
- 7
-
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional AlgorithmsArar, Moab / Chechik, Shiri / Cohen, Sarel / Stein, Cliff / Wajc, David et al. | 2018
- 8
-
Tighter Connections Between Formula-SAT and Shaving LogsAbboud, Amir / Bringmann, Karl et al. | 2018
- 9
-
New Approximation Algorithms for (1,2)-TSPAdamaszek, Anna / Mnich, Matthias / Paluch, Katarzyna et al. | 2018
- 10
-
Union of Hypercubes and 3D Minkowski Sums with Random SizesAgarwal, Pankaj K. / Kaplan, Haim / Sharir, Micha et al. | 2018
- 11
-
Noise-Tolerant Testing of High Entanglement of FormationArnon-Friedman, Rotem / Yuen, Henry et al. | 2018
- 12
-
A Complete Dichotomy for Complex-Valued Holant^cBackens, Miriam et al. | 2018
- 13
-
Tight Bounds on Online Checkpointing AlgorithmsBar-On, Achiya / Dinur, Itai / Dunkelman, Orr / Hod, Rani / Keller, Nathan / Ronen, Eyal / Shamir, Adi et al. | 2018
- 14
-
Fast Reed-Solomon Interactive Oracle Proofs of ProximityBen-Sasson, Eli / Bentov, Iddo / Horesh, Yinon / Riabzev, Michael et al. | 2018
- 15
-
NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many ColorsBhangale, Amey et al. | 2018
- 16
-
Sublinear Algorithms for MAXCUT and Correlation ClusteringBhaskara, Aditya / Daruki, Samira / Venkatasubramanian, Suresh et al. | 2018
- 17
-
Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETHBhattacharyya, Arnab / Ghoshal, Suprovat / C. S., Karthik / Manurangsi, Pasin et al. | 2018
- 18
-
Rollercoasters and CaterpillarsBiedl, Therese / Biniaz, Ahmad / Cummings, Robert / Lubiw, Anna / Manea, Florin / Nowotka, Dirk / Shallit, Jeffrey et al. | 2018
- 19
-
New algorithms for Steiner tree reoptimizationBilò, Davide et al. | 2018
- 20
-
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic GeometryBläsius, Thomas / Freiberger, Cedric / Friedrich, Tobias / Katzmann, Maximilian / Montenegro-Retana, Felix / Thieffry, Marianne et al. | 2018
- 21
-
Approximate Convex Hull of Data StreamsBlum, Avrim / Braverman, Vladimir / Kumar, Ananya / Lang, Harry / Yang, Lin F. et al. | 2018
- 22
-
Small Bias Requires Large FormulasBogdanov, Andrej et al. | 2018
- 23
-
Geodesic Obstacle Representation of GraphsBose, Prosenjit / Carmi, Paz / Dujmovic, Vida / Mehrabi, Saeed / Montecchiani, Fabrizio / Morin, Pat / Silveira, Luis Fernando Schultz Xavier da et al. | 2018
- 24
-
The Bottleneck Complexity of Secure Multiparty ComputationBoyle, Elette / Jain, Abhishek / Prabhakaran, Manoj / Yu, Ching-Hua et al. | 2018
- 25
-
Revisiting Frequency Moment Estimation in Random Order StreamsBraverman, Vladimir / Viola, Emanuele / Woodruff, David P. / Yang, Lin F. et al. | 2018
- 26
-
Proportional Approval Voting, Harmonic k-median, and Negative AssociationByrka, Jaroslaw / Skowron, Piotr / Sornat, Krzysztof et al. | 2018
- 27
-
Fine-Grained Derandomization: From Problem-Centric to Resource-Centric ComplexityCarmosino, Marco L. / Impagliazzo, Russell / Sabin, Manuel et al. | 2018
- 28
-
Ranking with Fairness ConstraintsCelis, L. Elisa / Straszak, Damian / Vishnoi, Nisheeth K. et al. | 2018
- 29
-
Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-MedianChakrabarty, Deeparnab / Swamy, Chaitanya et al. | 2018
- 30
-
Generalized Center Problems with OutliersChakrabarty, Deeparnab / Negahbani, Maryam et al. | 2018
- 31
-
Orthogonal Point Location and Rectangle Stabbing Queries in 3-dChan, Timothy M. / Nekrich, Yakov / Rahul, Saladi / Tsakalidis, Konstantinos et al. | 2018
- 32
-
Spanning Tree Congestion and Computation of Generalized Györi-Lovász PartitionChandran, L. Sunil / Cheung, Yun Kuen / Issac, Davis et al. | 2018
- 33
-
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time BarrierCharikar, Moses / Solomon, Shay et al. | 2018
- 34
-
On Estimating Edit Distance: Alignment, Dimension Reduction, and EmbeddingsCharikar, Moses / Geri, Ofir / Kim, Michael P. / Kuszmaul, William et al. | 2018
- 35
-
How Hard Is It to Satisfy (Almost) All Roommates?Chen, Jiehua / Hermelin, Danny / Sorge, Manuel / Yedidsion, Harel et al. | 2018
- 36
-
A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear FormulasChillara, Suryajith / Limaye, Nutan / Srinivasan, Srikanth et al. | 2018
- 37
-
Restricted Max-Min Fair AllocationCheng, Siu-Wing / Mao, Yuchen et al. | 2018
- 38
-
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the BoundaryChuzhoy, Julia / Kim, David H. K. / Nimavat, Rachit et al. | 2018
- 39
-
Optimal Hashing in External MemoryConway, Alex / Farach-Colton, Martín / Shilane, Philip et al. | 2018
- 40
-
Lovász Meets Weisfeiler and LemanDell, Holger / Grohe, Martin / Rattan, Gaurav et al. | 2018
- 41
-
Sample-Optimal Identity Testing with High ProbabilityDiakonikolas, Ilias / Gouleakis, Themis / Peebles, John / Price, Eric et al. | 2018
- 42
-
Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic TimeDuan, Ran / Ren, Hanlin et al. | 2018
- 43
-
Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse GraphsDuan, Ran / Lyu, Kaifeng / Xie, Yuanhang et al. | 2018
- 44
-
Improved Time Bounds for All Pairs Non-decreasing Paths in General DigraphsDuan, Ran / Gu, Yong / Zhang, Le et al. | 2018
- 45
-
Edit Distance between Unrooted Trees in Cubic TimeDudek, Bartlomiej / Gawrychowski, Pawel et al. | 2018
- 46
-
A Note on Two-Colorability of Nonuniform HypergraphsDuraj, Lech / Gutowski, Grzegorz / Kozik, Jakub et al. | 2018
- 47
-
Additive Non-Approximability of Chromatic Number in Proper Minor-Closed ClassesDvorák, Zdenek / Kawarabayashi, Ken-ichi et al. | 2018
- 48
-
How to Navigate Through Obstacles?Eiben, Eduard / Kanj, Iyad et al. | 2018
- 49
-
Faster Algorithms for Integer Programs with Block StructureEisenbrand, Friedrich / Hunkenschröder, Christoph / Klein, Kim-Manuel et al. | 2018
- 50
-
On the Probe Complexity of Local Computation AlgorithmsFeige, Uriel / Patt-Shamir, Boaz / Vardi, Shai et al. | 2018
- 51
-
Fully-Dynamic Bin Packing with Little RepackingFeldkord, Björn / Feldotto, Matthias / Gupta, Anupam / Guruganesh, Guru / Kumar, Amit / Riechers, Sören / Wajc, David et al. | 2018
- 52
-
A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided ErrorFichtenberger, Hendrik / Levi, Reut / Vasudev, Yadu / Wötzel, Maximilian et al. | 2018
- 53
-
Parameterized Low-Rank Binary Matrix ApproximationFomin, Fedor V. / Golovach, Petr A. / Panolan, Fahad et al. | 2018
- 54
-
Towards Blackbox Identity Testing of Log-Variate CircuitsForbes, Michael A. / Ghosh, Sumanta / Saxena, Nitin et al. | 2018
- 55
-
Finding Cliques in Social Networks: A New Distribution-Free ModelFox, Jacob / Roughgarden, Tim / Seshadhri, C. / Wei, Fan / Wein, Nicole et al. | 2018
- 56
-
A PTAS for a Class of Stochastic Dynamic ProgramsFu, Hao / Li, Jian / Xu, Pan et al. | 2018
- 57
-
Semi-Supervised Algorithms for Approximately Optimal and Accurate ClusteringGamlath, Buddhima / Huang, Sangxia / Svensson, Ola et al. | 2018
- 58
-
High Probability Frequency Moment SketchesGanguly, Sumit / Woodruff, David P. et al. | 2018
- 59
-
Quasi-PTAS for Scheduling with Precedences using LP HierarchiesGarg, Shashwat et al. | 2018
- 60
-
ARRIVAL: Next Stop in CLSGärtner, Bernd / Hansen, Thomas Dueholm / Hubácek, Pavel / Král, Karel / Mosaad, Hagar / Slívová, Veronika et al. | 2018
- 61
-
Improved Bounds for Shortest Paths in Dense Distance GraphsGawrychowski, Pawel / Karczmarz, Adam et al. | 2018
- 62
-
Towards Unified Approximate Pattern Matching for Hamming and L_1 DistanceGawrychowski, Pawel / Uznanski, Przemyslaw et al. | 2018
- 63
-
A Faster Construction of Greedy Consensus TreesGawrychowski, Pawel / Landau, Gad M. / Sung, Wing-Kin / Weimann, Oren et al. | 2018
- 64
-
A Faster FPTAS for #KnapsackGawrychowski, Pawel / Markin, Liran / Weimann, Oren et al. | 2018
- 65
-
Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple StreamsGolan, Shay / Kopelowitz, Tsvi / Porat, Ely et al. | 2018
- 66
-
Gray Codes and Symmetric ChainsGregor, Petr / Jäger, Sven / Mütze, Torsten / Sawada, Joe / Wille, Kaja et al. | 2018
- 67
-
An Improved Isomorphism Test for Bounded-Tree-Width GraphsGrohe, Martin / Neuen, Daniel / Schweitzer, Pascal / Wiebking, Daniel et al. | 2018
- 68
-
A Polynomial-Time Approximation Algorithm for All-Terminal Network ReliabilityGuo, Heng / Jerrum, Mark et al. | 2018
- 69
-
Perfect Simulation of the Hard Disks Model by Partial Rejection SamplingGuo, Heng / Jerrum, Mark et al. | 2018
- 70
-
Non-Preemptive Flow-Time Minimization via RejectionsGupta, Anupam / Kumar, Amit / Li, Jason et al. | 2018
- 71
-
Maximizing Profit with Convex Costs in the Random-order ModelGupta, Anupam / Mehta, Ruta / Molinaro, Marco et al. | 2018
- 72
-
Generic Single Edge Fault Tolerant Exact Distance OracleGupta, Manoj / Singh, Aditi et al. | 2018
- 73
-
An Exponential Separation Between MA and AM Proofs of ProximityGur, Tom / Liu, Yang P. / Rothblum, Ron D. et al. | 2018
- 74
-
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular FacesGurjar, Rohit / Thierauf, Thomas / Vishnoi, Nisheeth K. et al. | 2018
- 75
-
Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and DeletionsHaeupler, Bernhard / Shahrasbi, Amirbehshad / Vitercik, Ellen et al. | 2018
- 76
-
Synchronization Strings: List Decoding for Insertions and DeletionsHaeupler, Bernhard / Shahrasbi, Amirbehshad / Sudan, Madhu et al. | 2018
- 77
-
Approximate Sparse Linear RegressionHar-Peled, Sariel / Indyk, Piotr / Mahabadi, Sepideh et al. | 2018
- 78
-
A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical ComplexesHayashi, Koyo et al. | 2018
- 79
-
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random ArrivalsHuang, Zhiyi / Tang, Zhihao Gavin / Wu, Xiaowei / Zhang, Yuhao et al. | 2018
- 80
-
Finding Branch-Decompositions of Matroids, Hypergraphs, and MoreJeong, Jisu / Kim, Eun Jung / Oum, Sang-il et al. | 2018
- 81
-
Optimally Sorting Evolving DataBesa, Juan Jose / Devanny, William E. / Eppstein, David / Goodrich, Michael T. / Johnson, Timothy et al. | 2018
- 82
-
Generalized Comparison Trees for Point-Location ProblemsKane, Daniel M. / Lovett, Shachar / Moran, Shay et al. | 2018
- 83
-
Stabilizing Weighted GraphsKoh, Zhuan Khye / Sanità, Laura et al. | 2018
- 84
-
Spectrally Robust Graph IsomorphismKolla, Alexandra / Koutis, Ioannis / Madan, Vivek / Sinop, Ali Kemal et al. | 2018
- 85
-
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer ProgramsKoutecký, Martin / Levin, Asaf / Onn, Shmuel et al. | 2018
- 86
-
Finer Tight Bounds for Coloring on Clique-WidthLampis, Michael et al. | 2018
- 87
-
A Centralized Local Algorithm for the Sparse Spanning Graph ProblemLenzen, Christoph / Levi, Reut et al. | 2018
- 88
-
Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SATLiu, Sixue et al. | 2018
- 89
-
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and AlgorithmsBarequet, Gill / Eppstein, David / Goodrich, Michael T. / Mamano, Nil et al. | 2018
- 90
-
Improved Algorithms for Adaptive Compressed SensingNakos, Vasileios / Shi, Xiaofei / Woodruff, David P. / Zhang, Hongyang et al. | 2018
- 91
-
Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground StatesNirkhe, Chinmay / Vazirani, Umesh / Yuen, Henry et al. | 2018
- 92
-
Fully Dynamic MIS in Uniformly Sparse GraphsOnak, Krzysztof / Schieber, Baruch / Solomon, Shay / Wein, Nicole et al. | 2018
- 93
-
Strictly Balancing Matrices in Polynomial Time Using Osborne's IterationOstrovsky, Rafail / Rabani, Yuval / Yousefi, Arman et al. | 2018
- 94
-
Parameterized Algorithms for Zero Extension and Metric Labelling ProblemsReidl, Felix / Wahlström, Magnus et al. | 2018
- 95
-
An Operational Characterization of Mutual Information in Algorithmic Information TheoryRomashchenko, Andrei / Zimand, Marius et al. | 2018
- 96
-
Privacy Preserving Clustering with ConstraintsRösner, Clemens / Schmidt, Melanie et al. | 2018
- 97
-
NC Algorithms for Weighted Planar Perfect Matching and Related ProblemsSankowski, Piotr et al. | 2018
- 98
-
Computing Tutte PathsSchmid, Andreas / Schmidt, Jens M. et al. | 2018
- 99
-
A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete ConvexitySoma, Tasuku / Yoshida, Yuichi et al. | 2018
- 100
-
Ring Packing and Amortized FHEW BootstrappingMiccianco, Daniele / Sorrell, Jessica et al. | 2018
- 101
-
Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate RecoveryLouis, Anand / Venkat, Rakesh et al. | 2018
- 102
-
Load Thresholds for Cuckoo Hashing with Overlapping BlocksWalzer, Stefan et al. | 2018
- 103
-
Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPCAgarwal, Navneet / Anand, Sanat / Prabhakaran, Manoj et al. | 2018
- 104
-
Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner NetworkBabay, Amy / Dinitz, Michael / Zhang, Zeyu et al. | 2018
- 105
-
Brief Announcement: Zero-Knowledge Protocols for Search ProblemsBerger, Ben / Brakerski, Zvika et al. | 2018
- 106
-
Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded ChannelsBlocki, Jeremiah / Gandikota, Venkata / Grigorescu, Elena / Zhou, Samson et al. | 2018
- 107
-
Brief Announcement: Approximation Schemes for Geometric Coverage ProblemsChaplick, Steven / De, Minati / Ravsky, Alexander / Spoerhase, Joachim et al. | 2018
- 108
-
Brief Announcement: Bayesian Auctions with Efficient QueriesChen, Jing / Li, Bo / Li, Yingkai / Lu, Pinyan et al. | 2018
- 109
-
Brief Announcement: Hamming Distance Completeness and Sparse Matrix MultiplicationGraf, Daniel / Labib, Karim / Uznanski, Przemyslaw et al. | 2018
- 110
-
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVSLokshtanov, Daniel / Ramanujan, M. S. / Saurabh, Saket / Sharma, Roohani / Zehavi, Meirav et al. | 2018
- 111
-
Brief Announcement: Erasure-Resilience Versus Tolerance to ErrorsRaskhodnikova, Sofya / Varma, Nithin et al. | 2018
- 112
-
Brief Announcement: Bounded-Degree Cut is Fixed-Parameter TractableXiao, Mingyu / Nagamochi, Hiroshi et al. | 2018
- 113
-
Almost Sure ProductivityAguirre, Alejandro / Barthe, Gilles / Hsu, Justin / Silva, Alexandra et al. | 2018
- 114
-
O-Minimal Invariants for Linear LoopsAlmagor, Shaull / Chistikov, Dmitry / Ouaknine, Joël / Worrell, James et al. | 2018
- 115
-
Topological Sorting with Regular ConstraintsAmarilli, Antoine / Paperman, Charles et al. | 2018
- 116
-
On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed SurfaceAtserias, Albert / Kreutzer, Stephan / Noy, Marc et al. | 2018
- 117
-
Bisimulation Invariant Monadic-Second Order Logic in the FiniteBlumensath, Achim / Wolf, Felix et al. | 2018
- 118
-
Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order AtomsClemente, Lorenzo / Lasota, Slawomir et al. | 2018
- 119
-
Unboundedness Problems for Languages of Vector Addition SystemsCzerwinski, Wojciech / Hofman, Piotr / Zetzsche, Georg et al. | 2018
- 120
-
Reachability and Distances under Multiple ChangesDatta, Samir / Mukherjee, Anish / Vortmeier, Nils / Zeume, Thomas et al. | 2018
- 121
-
When is Containment Decidable for Probabilistic Automata?Daviaud, Laure / Jurdzinski, Marcin / Lazic, Ranko / Mazowiecki, Filip / Pérez, Guillermo A. / Worrell, James et al. | 2018
- 122
-
On the Complexity of Infinite Advice StringsDouéneau-Tabot, Gaëtan et al. | 2018
- 123
-
Resynchronizing Classes of Word RelationsDescotte, María Emilia / Figueira, Diego / Puppis, Gabriele et al. | 2018
- 124
-
Reachability Switching GamesFearnley, John / Gairing, Martin / Mnich, Matthias / Savani, Rahul et al. | 2018
- 125
-
Costs and Rewards in Priced Timed AutomataFränzle, Martin / Shirmohammadi, Mahsa / Swaminathan, Mani / Worrell, James et al. | 2018
- 126
-
First-Order Interpretations of Bounded Expansion ClassesGajarský, Jakub / Kreutzer, Stephan / Nesetril, Jaroslav / Ossona de Mendez, Patrice / Pilipczuk, Michal / Siebertz, Sebastian / Torunczyk, Szymon et al. | 2018
- 127
-
Randomized Sliding Window Algorithms for Regular LanguagesGanardi, Moses / Hucke, Danny / Lohrey, Markus et al. | 2018
- 128
-
Aperiodic Points in Z²-subshiftsGrandjean, Anael / Hellouin de Menibus, Benjamin / Vanier, Pascal et al. | 2018
- 129
-
Semicomputable GeometryHoyrup, Mathieu / Nava Saucedo, Diego / Stull, Don M. et al. | 2018
- 130
-
On Computing the Total Variation Distance of Hidden Markov ModelsKiefer, Stefan et al. | 2018
- 131
-
To Infinity and BeyondKlimann, Ines et al. | 2018
- 132
-
On the Identity Problem for the Special Linear Group and the Heisenberg GroupKo, Sang-Ki / Niskanen, Reino / Potapov, Igor et al. | 2018
- 133
-
Gaifman Normal Forms for Counting Extensions of First-Order LogicKuske, Dietrich / Schweikardt, Nicole et al. | 2018
- 134
-
Polynomial Vector Addition Systems With StatesLeroux, Jérôme et al. | 2018
- 135
-
Reducing CMSO Model Checking to Highly Connected GraphsLokshtanov, Daniel / Ramanujan, M. S. / Saurabh, Saket / Zehavi, Meirav et al. | 2018
- 136
-
An Optimal Bound on the Solution Sets of One-Variable Word Equations and its ConsequencesNowotka, Dirk / Saarela, Aleksi et al. | 2018
- 137
-
Separating Without Any AmbiguityPlace, Thomas / Zeitoun, Marc et al. | 2018
- 138
-
A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous AutomatonRaskin, Mikhail et al. | 2018
- 139
-
The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACESénizergues, Géraud / Weiß, Armin et al. | 2018
- 140
-
Unambiguous Languages Exhaust the Index HierarchySkrzypczak, Michal et al. | 2018
- 141
-
The Beta-Bernoulli process and algebraic effectsStaton, Sam / Stein, Dario / Yang, Hongseok / Ackerman, Nathanael L. / Freer, Cameron E. / Roy, Daniel M. et al. | 2018
- 142
-
Uniformization Problems for Synchronizations of Automatic Relations on WordsWinter, Sarah et al. | 2018
- 143
-
Congestion-Free Rerouting of Flows on DAGsAkhoondian Amiri, Saeed / Dudycz, Szymon / Schmid, Stefan / Wiederrecht, Sebastian et al. | 2018
- 144
-
Practical and Provably Secure Onion RoutingAndo, Megumi / Lysyanskaya, Anna / Upfal, Eli et al. | 2018
- 145
-
Resolving SINR Queries in a Dynamic SettingAronov, Boris / Bar-On, Gali / Katz, Matthew J. et al. | 2018
- 146
-
Uniform Mixed Equilibria in Network Congestion Games with Link FailuresBilò, Vittorio / Moscardelli, Luca / Vinci, Cosimo et al. | 2018
- 147
-
Byzantine Gathering in Polynomial TimeBouchard, Sébastien / Dieudonné, Yoann / Lamani, Anissa et al. | 2018
- 148
-
Temporal Vertex Cover with a Sliding Time WindowAkrida, Eleni C. / Mertzios, George B. / Spirakis, Paul G. / Zamaraev, Viktor et al. | 2018
- 149
-
On the Complexity of Sampling Vertices Uniformly from a GraphChierichetti, Flavio / Haddadan, Shahrzad et al. | 2018
- 150
-
The Price of Stability of Weighted Congestion GamesChristodoulou, George / Gairing, Martin / Giannakopoulos, Yiannis / Spirakis, Paul G. et al. | 2018
- 151
-
Demand-Independent Optimal TollsColini-Baldeschi, Riccardo / Klimm, Max / Scarsini, Marco et al. | 2018
- 152
-
Greedy Algorithms for Online Survivable Network DesignDehghani, Sina / Ehsani, Soheil / Hajiaghayi, MohammadTaghi / Liaghat, Vahid / Seddighin, Saeed et al. | 2018
- 153
-
Algorithms for Noisy Broadcast with ErasuresGrossman, Ofer / Haeupler, Bernhard / Mohanty, Sidhanth et al. | 2018
- 154
-
Efficient Black-Box Reductions for Separable Cost SharingHarks, Tobias / Hoefer, Martin / Huber, Anja / Surek, Manuel et al. | 2018
- 155
-
Price of Anarchy for Mechanisms with Risk-Averse AgentsKesselheim, Thomas / Kodric, Bojana et al. | 2018
- 156
-
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic ComputationsKowalski, Dariusz R. / Mosteiro, Miguel A. et al. | 2018
- 157
-
The Unfortunate-Flow ProblemKupferman, Orna / Vardi, Gal et al. | 2018
- 158
-
Spanning Trees With Edge Conflicts and Wireless ConnectivityHalldórsson, Magnús M. / Kortsarz, Guy / Mitra, Pradipta / Tonoyan, Tigran et al. | 2018
- 159
-
Eigenvector Computation and Community Detection in Asynchronous Gossip ModelsMallmann-Trenn, Frederik / Musco, Cameron / Musco, Christopher et al. | 2018
- 160
-
(Delta+1) Coloring in the Congested Clique ModelParter, Merav et al. | 2018
- 161
-
CacheShuffle: A Family of Oblivious ShufflesPatel, Sarvar / Persiano, Giuseppe / Yeo, Kevin et al. | 2018
- 162
-
Brief Announcement: MapReduce Algorithms for Massive TreesBateni, MohammadHossein / Behnezhad, Soheil / Derakhshan, Mahsa / Hajiaghayi, MohammadTaghi / Mirrokni, Vahab et al. | 2018
- 163
-
Brief Announcement: Give Me Some Slack: Efficient Network MeasurementsBen Basat, Ran / Einziger, Gil / Friedman, Roy et al. | 2018
- 164
-
Brief Announcement: Towards an Abstract Model of User Retention DynamicsBen-Sasson, Eli / Saig, Eden et al. | 2018
- 165
-
Brief Announcement: Energy Constrained Depth First SearchDas, Shantanu / Dereniowski, Dariusz / Uznanski, Przemyslaw et al. | 2018