Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 5. Year - 5. Fachbeiratsbericht - 3. Years: Penultimate

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

BibTeX cite keyLckAuthor/EditorYearTitleType
AdamaszekWiese2013Adamaszek, Anna
Wiese, Andreas
2013Approximation Schemes for Maximum Weight Independent Set of Rectangles
In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013),
Proceedings Article
Afshani2013Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Doerr, Carola
Larsen, Kasper Green
Mehlhorn, Kurt
2013The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11
Part of a Book
AlvarezBRS13Alvarez, Victor
Bringmann, Karl
Ray, Saurabh
Seidel, Raimund
2013Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89
Proceedings Article
Anagnostopoulos2013Anagnostopoulos, Aris
Grandoni, Fabrizio
Leonardi, Stefano
Wiese, Andreas
2013Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Proceedings Article
AnandBFGK13Anand, S
Bringmann, Karl
Friedrich, Tobias
Garg, Naveen
Kumar, Amit
2013Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24
Proceedings Article
AnshelevichBH2013Anshelevich, Elliot
Bhardwaj, Onkar
Hoefer, Martin
2013Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60
Proceedings Article
Bei2015Bei, Xiaohui2015Solving Linear Programming with Constraints Unknown
In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I., 129-142
Proceedings Article
Berberich20131Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
2013Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Journal Article
BogdanSSS2012Bogdan, Paul
Sauerwald, Thomas
Stauffer, Alexandre
Sun, He
2013Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
Electronic Proceedings Article
Bonifaci2013Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
Wiese, Andreas
2013Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013),
Proceedings Article
Bonifaci2013bBonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Megow, Nicole
Wiese, Andreas
2013Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013),
Proceedings Article
Bringmann13Bringmann, Karl2013Bringing Order to Special Cases of Klee’s Measure Problem
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 207-218
Proceedings Article
BringmannDoerrNeumannSliacan2013Bringmann, Karl
Doerr, Benjamin
Neumann, Adrian
Sliacan, Jakub
2013Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266
Proceedings Article
BringmannEMR13Bringmann, Karl
Engels, Christian
Manthey, Bodo
Raghavendra Rao, B. V.
2013Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230
Proceedings Article
BringmannF13Bringmann, Karl
Friedrich, Tobias
2013Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582
Proceedings Article
BringmannF13-2Bringmann, Karl
Friedrich, Tobias
2013Exact and Efficient Generation of Geometric Random Variates and Random Graphs
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278
Proceedings Article
BringmannFIV13Bringmann, Karl
Friedrich, Tobias
Igel, Christian
Voß, Thomas
2013Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
Journal Article
BringmannFjournal13Bringmann, Karl
Friedrich, Tobias
2013Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290
Journal Article
BringmannGLBringmann, Karl
Green Larsen, Kasper
2013Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782
Proceedings Article
BringmannSSS14Bringmann, Karl
Sauerwald, Thomas
Stauffer, Alexandre
Sun, He
2014Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted
Proceedings Article
CaseKoetzing2012:MemLimCase, John
Kötzing, Timo
2013Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123
Electronic Journal Article
ChEpKS13Chen, Xujin
Epstein, Leah
Kleiman, Elena
van Stee, Rob
2013Attachment IconMaximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19
Journal Article
ChKoSt2013Christodoulou, George
Kovacs, Annamaria
van Stee, Rob
2013Attachment IconA truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98
Journal Article
croi13Croitoru, Cosmina2013Abstract Debates
In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013,
Proceedings Article
croikotzi13Croitoru, Cosmina
Kötzing, Timo
2014A Normal Form for Argumentation Frameworks
In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45
Proceedings Article
CurticapeanK2013Curticapean, Radu
Künnemann, Marvin
2013A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360
Proceedings Article
DamsHK2013Dams, Johannes
Hoefer, Martin
Kesselheim, Thomas
2013Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357
Proceedings Article
DBLP:journals/corr/abs-1304-8069Kobel, Alexander
Sagraloff, Michael
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
Doerr2012xDoerr, Benjamin
Doerr, Carola
Spöhel, Reto
Thomas, Henning
2013Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22
Electronic Journal Article
Doerr2013AppAlgDoerr, Benjamin2013Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749
Journal Article
Doerr2013CECemoDoerr, Benjamin
Kodric, Bojana
Voigt, Marco
2013Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439
Proceedings Article
Doerr2013zDoerr, C.
Schmidt, Jens M.
Ramakrishna, G.
2013Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236
Proceedings Article
DoerrDE13Doerr, Benjamin
Doerr, Carola
Ebel, Franziska
2013Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 781-788
Proceedings Article
DoerrDR2013Doerr, Carola
De Rainville, François-Michel
2013Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796
Proceedings Article
DoerrG13algoDoerr, Benjamin
Goldberg, Leslie Ann
2013Adaptive Drift Analysis
In: Algorithmica [65], 224-250
Journal Article
DoerrHL13Doerr, Benjamin
Huber, Anna
Levavi, Ariel
2013Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793
Journal Article
DoerrJKNT13Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine
2013More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26
Journal Article
DoerrJSWZ13EvCoDoerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine
2013Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27
Journal Article
DoerrK2013aDoerr, Benjamin
Künnemann, Marvin
2013Royal Road Functions and the (1 + λ) Evolutionary Algorithm: Almost no Speed-up from Larger Offspring Populations
In: 2013 IEEE Congress on Evolutionary Computation (CEC 2013), 424-431
Proceedings Article
DoerrK2013bDoerr, Benjamin
Künnemann, Marvin
2013How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions
In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), 1589-1596
Proceedings Article
DoerrKLW13Doerr, Benjamin
Kötzing, Timo
Lengler, Johannes
Winzen, Carola
2013Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106
Journal Article
DoerrSTW13Doerr, Benjamin
Spöhel, Reto
Thomas, Henning
Winzen, Carola
2013Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704
Proceedings Article
DoerrSW2013FOGADoerr, Benjamin
Sudholt, Dirk
Witt, Carsten
2013When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63
Proceedings Article
DoerrW12RankingDoerr, Benjamin
Winzen, Carola
2014Ranking-Based Black-Box Complexity
In: Algorithmica [?], ?
Journal Article
Duan2013Duan, Ran2013Attachment IconBreaking the $O(n^2.5)$ Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 1171-1179
Proceedings Article
DynamicGraphRumorClementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Pasquale, Francesco
Silvestri, Riccardo
2013Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013),
Proceedings Article
Elbassioni2012dElbassioni, Khaled
Rauf, Imran
Ray, Saurabh
??On Enumerating Minimal Transversals of Geometric HypergraphsUnpublished/Draft
Elbassioni2013aElbassioni, Khaled
Chalermsook, Parinya
Nanongkai, Danupon
Sun, He
2013Multi-Attribute Profit-Maximizing PricingUnpublished/Draft
Elmasry2013Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2013Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121
Journal Article
EpLeSt13Epstein, Leah
Levin, Asaf
van Stee, Rob
2013Attachment IconA unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252
Proceedings Article
FanghaenelGHV2013Fanghänel, Alexander
Geulen, Sascha
Hoefer, Martin
Vöcking, Berthold
2013Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Journal Article
fffmo-eropmoffsi-14Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
ffks-ffagp-13Fekete, Sándor P.
Friedrichs, Stephan
Kröller, Alexander
Schmidt, Christiane
2013Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
Proceedings Article
fkw-eevsopcowsn-14Friedrichs, Stephan
Kulau, Ulf
Wolf, Lars
2014Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865
Proceedings Article
FPSSICOMP2013Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2013On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-?
Journal Article
Gawrychowski2013Gawrychowski, Pawel
Manea, Florin
Mercas, Robert
Nowotka, Dirk
Tiseanu, Catalin
2013Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268
Proceedings Article
Gawrychowski2013alphabeticGawrychowski, Pawel2013Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48
Proceedings Article
Gawrychowski2013ancestorsGagie, Travis
Gawrychowski, Pawel
Nekrich, Yakov
2013Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150
Proceedings Article
Gawrychowski2013beatingGawrychowski, Pawel
Straszak, Damian
2013Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88
Proceedings Article
Gawrychowski2013convertingBannai, Hideo
Gawrychowski, Pawel
Inenaga, Shunsuke
Takeda, Masayuki
2013Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
Proceedings Article
Gawrychowski2013discoveringGawrychowski, Pawel
Manea, Florin
Nowotka, Dirk
2013Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219
Proceedings Article
Gawrychowski2013discriminatingGawrychowski, Pawel
Kucherov, Gregory
Nekrich, Yakov
Starikovskaya, Tatiana
2013Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013),
Proceedings Article
Gawrychowski2014Gawrychowski, Pawel
Manea, Florin
Nowotka, Dirk
2014Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349
Proceedings Article
Gawrychowski2014aGagie, Travis
Gawrychowski, Pawel
Kärkkäinen, Juha
Nekrich, Yakov
Puglisi, Simon J.
2014LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742
Proceedings Article
Gawrychowski2014bGawrychowski, Pawel
Mozes, Shay
Weimann, Oren
2014Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537
Proceedings Article
Gawrychowski2014cGawrychowski, Pawel
Uznanski, Przemyslaw
2014Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139
Proceedings Article
Gawrychowski2014dBabenko, Maxim A.
Gawrychowski, Pawel
Kociumaka, Tomasz
Starikovskaya, Tatiana A.
2014Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39
Proceedings Article
Gawrychowski2014eGawrychowski, Pawel2014Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41
Journal Article
GawrychowskiJez2014Gawrychowski, Pawel
Jez, Artur
Jez, Lukasz
2014Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Journal Article
GnewuchWW13Doerr, Carola
Gnewuch, Michael
Wahlström, Magnus
2013Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55
Part of a Book
HarksHKS2013Harks, Tobias
Hoefer, Martin
Klimm, Max
Skopalik, Alexander
2013Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Journal Article
Heydrich2015Heydrich, Sandy
van Stee, Rob
2015Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Journal Article
HeySte13Heydrich, Sandy
van Stee, Rob
2013Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
Proceedings Article
Hoefer-IJGT-2013Hoefer, Martin2013Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53
Journal Article
Hoefer2013Hoefer, Martin2013Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35
Journal Article
HoeferK2013Hoefer, Martin
Kesselheim, Thomas
2013Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101
Proceedings Article
HoeferKV2013Hoefer, Martin
Kesselheim, Thomas
Vöcking, Berthold
2013Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Proceedings Article
HoeferS-TEAC-2013Hoefer, Martin
Skopalik, Alexander
2013Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21
Journal Article
HoeferS-TOCS-2013Hoefer, Martin
Skopalik, Alexander
2013On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
Journal Article
HoeferS2013Hoefer, Martin
Sauerwald, Thomas
2013Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
Proceedings Article
HoeferW-WINE-2013Hoefer, Martin
Wagner, Lisa
2013Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
Proceedings Article
HoeferW2013Hoefer, Martin
Wagner, Lisa
2013Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
Proceedings Article
Issac2015SamplingIssac, Davis2015Sampling in Space Restricted Settings
In: Computing and Combinatorics 2015,
Proceedings Article
Jez2008ICALPJez, Artur
Okhotin, Alexander
2014Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94
Journal Article
Jez2012STACSJez, Artur2014The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Journal Article
Jez2013CPMJez, Artur2013Attachment IconApproximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176
Proceedings Article
Jez2013DLTJez, Artur
Okhotin, Alexander
2013Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288
Proceedings Article
Jez2013DLTIIJez, Artur2013Attachment IconRecompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26
Proceedings Article
Jez2013ICALPJez, Artur2013Attachment IconOne-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335
Proceedings Article
Jez2013STACSJez, Artur2013Attachment IconRecompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244
Proceedings Article
Jez2014CPMJez, Artur2014A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191
Proceedings Article
Jez2014CSRDiekert, Volker
Jez, Artur
Plandowski, Wojciech
2014Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15
Proceedings Article
Jez2014ICALPJez, Artur2014Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255
Proceedings Article
Jez2014STACSJez, Artur
Lohrey, Markus
2014Attachment IconApproximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457
Proceedings Article
JezMaletti2013Jez, Artur
Maletti, Andreas
2013Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830
Journal Article
Jurkiewicz2013Jurkiewicz, Tomasz2013Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Thesis - PhD thesis
Khosla2013Khosla, Megha2013Balls into Bins Made Faster
In: Algorithms - ESA 2013,
Proceedings Article
Kollias2012Kollias, Konstantinos2013Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440
Electronic Journal Article
MegowMestre2013Megow, Nicole
Mestre, Julian
2013Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
In: 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013),
Proceedings Article
MegowV2013Megow, Nicole
Verschae, Jose
2013Dual techniques for scheduling on a machine with varying speed
In: Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), 745–756
Proceedings Article
MegowWiese-SODA2013Günther, Elisabeth
Maurer, Olaf
Megow, Nicole
Wiese, Andreas
2013A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013),
Proceedings Article
Mehlhorn2013Mehlhorn, Kurt
Neumann, A.
Schmidt, Jens M.
2013Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369
Proceedings Article
MSWClustering2013Mehlhorn, Kurt
Sagraloff, Michael
Wang, Pengming
2013From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
Electronic Journal Article
Ott2013Antoniadis, Antonios
Huang, Chien-Chung
Ott, Sebastian
Verschae, José
2013How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73
Proceedings Article
Pourmiri2013Panagiotou, Konstantinos
Pourmiri, Ali
Sauerwald, Thomas
2013Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456
Proceedings Article
Ramezani2013Elbassioni, Khaled M.
Makino, Kazuhisa
Mehlhorn, Kurt
Ramezani, Fahimeh
2013On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Proceedings Article
SaSiSt13Sanders, Peter
Singler, Johannes
van Stee, Rob
2013Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
Schmidt2013Schmidt, Jens M.2013Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535
Journal Article
Schmidt2013Schmidt, Jens M.2013Contractions, Removals and How to Certify 3-Connectivity in Linear TimeUnpublished/Draft
Schmidt2013aSchmidt, Jens M.2013A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244
Journal Article
Schmidt2013bSchmidt, Jens M.2013A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776
Proceedings Article
SpoehelPST2013Panagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning
2013Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145
Journal Article
SSS12Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin
2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
SSS13Agrawal, Manindra
Saha, Chandan
Saxena, Nitin
2013A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article
SviridenkoWiese2013Sviridenko, Maxim
Wiese, Andreas
2013Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Proceedings Article
vanStee2013van Stee, Rob2013SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125
Journal Article
VAT2013Jurkiewicz, Tomasz
Mehlhorn, Kurt
2013The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments,
Proceedings Article
VerificationCertComp12Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine
2013A Framework for the Verification of Certifying ComputationsUnpublished/Draft
Wahlstroem2013aWahlström, Magnus2013Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13),
Electronic Proceedings Article
Winzen2013Winzen, Carola2013Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926
Journal Article
Winzen2013zClementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Isopi, Marc
Panconesi, Alessandro
Pasquale, Francesco
Silvestri, Riccardo
2013Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336
Proceedings Article
Xia2013-soda-clxCai, Jin-Yi
Lu, Pinyan
Xia, Mingji
2013Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295
Proceedings Article
YSSSoftpredicates2013Yap, Chee
Sagraloff, Michael
Sharma, Vikram
2013Analytic Root Clustering: A Complete Algorithm using Soft Zero TestsUnpublished/Draft

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)