Home
Papertalks
About
Help
Improve
Upload
Login
Register
Login Required
×
You have to login to use this feature.
Title
Abstract
Keywords
Authors
exact
AAAI 2021
AACL 2020
ACCV 2020
ACL 2020
ACL Workshops
ACM-CHIL 2020
ACML 2020
AISTATS 2020
AISTATS 2021
AKBC 2020
BMVC 2020
BMVC 2021
CHI 2020
CIKM 2020
COLING 2020
COLING Workshops 2020
COLT 2020
COLT 2021
CoRL 2020
CVPR 2020
DCASE 2020
EACL 2021
ECML PKDD 2020
EMNLP 2020
ESWC 2020
FOCI 2020
HotCloud 2020
HotEdge 2020
HotStorage 2020
ICALP 2020
ICAPS 2020
ICFP 2020
ICLR 2020
ICLR 2021
ICML 2020
ICML 2021
ICN 2020
ICWSM 2020
ICWSM 2021
IJCAI 2021
ISMIR 2020
KDD 2020
KR 2020
L@S 2020
MIDL 2020
MLHC 2020
MLSYS 2021
MSML 2020
MSR 2020
NeurIPS 2020
NeurIPS 2021
OOPSLA 2020
OpML 2020
OSDI 2020
PLDI 2020
PLDI 2021
PODC 2020
POPL 2020
RECSYS 2020
SIGCOMM 2020
SIGDIAL 2020
SIGGRAPH 2020
SIGIR 2020
SOUPS 2020
SPAA 2020
STOC 2020
UAI 2020
USENIX ATC 2020
USENIX Security 2020
WACV 2021
WOOT 2020
ICALP 2020
Arts and Music
Biology
Chemistry
Computer Science
Economics
Engineering
Geoscience
History
Law
Humanities
Mathematics
Medical Sciences
Neuroscience
Physics
Politics
Psychology
Social Sciences
All dates
Today
Last week
Last month
Last year
Reset
Hide
Hide
Hide
Sort by:
Default
Date (upload)
Date (paper)
Likes
Stars
Views
Duration
Random
Search match
207
papertalks found
08/07/2020
On polynomial recursive sequences
Michaël Cadilhac
,
Filip Mazowiecki
,
Charles Paperman
,
Michał Pilipczuk and Géraud Sénizergues
Keywords
Abstract
Paper
recursive sequences
,
expressive power
,
weighted automata
,
higher-order pushdown automata
22:50
08/07/2020
The Post Correspondence Problem and equalisers for certain free group and monoid morphisms
Laura Ciobanu and Alan Logan
Keywords
Abstract
Paper
Post Correspondence Problem
,
marked map
,
immersion
,
free group
,
free monoid
25:11
08/07/2020
On the complexity of zero gap MIP*
Hamoon Mousavi
,
Seyed Sajjad Nezhadi and Henry Yuen
Keywords
Abstract
Paper
Quantum Complexity
,
Multiprover Interactive Proofs
,
Computability Theory
24:13
08/07/2020
Quasi-majority Functional Voting on Expander Graphs
Nobutaka Shimizu and Takeharu Shiraga
Keywords
Abstract
Paper
Distributed voting
,
consensus problem
,
expander graph
,
Markov chain
22:43
08/07/2020
Quantum Distributed Complexity of Set Disjointness on a Line
Frederic Magniez
,
Ashwin Nayak
Keywords
Abstract
Paper
Quantum distributed computing
,
Set Disjointness
,
communication complexity
,
query complexity
25:38
08/07/2020
Descriptive complexity of real computation and probabilistic independence logic
Miika Hannula
,
Juha Kontinen
,
Jan Van den Bussche and Jonni Virtema
Keywords
Abstract
Paper
real arithmetic
,
Blum-Shub-Smale machines
,
independence logic
,
team semantics
,
descriptive complexity
29:15
08/07/2020
Pebble Minimization of Polyregular Functions
Nathan Lhote
Keywords
Abstract
Paper
minimization
,
pebble transducers
,
polyregular functions
,
MSO interpretations
24:27
08/07/2020
The Power of a Single Qubit: Two-way Quantum Finite Automata and the Word Problem
Zachary Remscrim
Keywords
Abstract
Paper
finite automata
,
quantum
,
word problem of a group
25:24
08/07/2020
Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints
Naor Alaluf
,
Alina Ene
,
Moran Feldman
,
Huy Nguyen and Andrew Suh
Keywords
Abstract
Paper
Submodular maximization
,
streaming algorithms
,
cardinality constraint
25:27
08/07/2020
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity
Clemens Grabmayer and Wan Fokkink
Keywords
Abstract
Paper
complete proof system
,
process algebra
,
process graphs
,
regular expressions
,
bisimilarity
26:19
08/07/2020
One-Clock Priced Timed Games are PSPACE-hard
John Fearnley
,
Rasmus Ibsen-Jensen and Rahul Savani
Keywords
Abstract
Paper
game theory
,
computational complexity
,
Priced timed games
22:04
08/07/2020
On the Fine-Grained Complexity of Parity Problems
Amir Abboud
,
Shon Feller
,
Oren Weimann
Keywords
Abstract
Paper
All-pairs shortest paths
,
Fine-grained complexity
,
Diameter
,
Distance product
,
Min-plus convolution
,
Parity problems
24:00
08/07/2020
Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem
Ofer Magen
,
Shiri Chechik
Keywords
Abstract
Paper
Fault tolerance
,
Replacement Paths
,
Combinatorial algorithms
,
Conditional lower bounds
25:12
08/07/2020
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion
Daniel Lokshtanov
,
Pranabendu Misra
,
Fahad Panolan
and
Geevarghese Philip
,
Saket Saurabh
Keywords
Abstract
Paper
Approximation Algorithms
,
Graph Algorithms
,
Split Vertex Deletion
27:40
08/07/2020
Modal Intuitionistic Logics as Dialgebraic Logics
Jim de Groot and Dirk Pattinson
Keywords
Abstract
Paper
dialgebras
,
coalgebraic logic
,
modal logic
20:54
08/07/2020
Breaking the Barrier of 2 for the Storage Allocation Problem
Tobias Mömke and Andreas Wiese
Keywords
Abstract
Paper
Approximation Algorithms
,
Resource Allocation
,
Dynamic Programming
23:08
08/07/2020
The Adversarial Stackelberg Value in Quantitative Games
Emmanuel Filiot
,
Raffaella Gentilini and Jean-Francois Raskin
Keywords
Abstract
Paper
Non-zero sum games
,
reactive synthesis
,
adversarial Stackelberg
26:04
08/07/2020
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs
Anindya De
,
Sanjeev Khanna
,
Huan Li
,
Hesam Nikpey
Keywords
Abstract
Paper
Efficient PTAS
,
Makespan Minimization
,
Scheduling
,
Stochastic Load Balancing
,
Poisson Distribution
22:28
08/07/2020
A Recipe for Quantum Graphical Languages
Titouan Carette and Emmanuel Jeandel
Keywords
Abstract
Paper
Categorical Quantum Mechanics
,
Quantum Computing
,
Category Theory
18:21
08/07/2020
The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem.
Shaddin Dughmi
Keywords
Abstract
Paper
Contention Resolution
,
Secretary Problems
,
Matroids
24:49
08/07/2020
An Approach to Regular Separability in Vector Addition Systems
Wojciech Czerwiński and Georg Zetzsche
Keywords
Abstract
Paper
vector addition systems
,
decidability
,
separability problem
22:12
08/07/2020
Space-efficient Query Evaluation over Probabilistic Event Streams
Rajeev Alur
,
Yu Chen
,
Kishor Jothimurugan
,
Sanjeev Khanna
Keywords
Abstract
Paper
Query processing over streams
,
Streaming algorithms
,
Probabilistic streams
22:51
08/07/2020
Counting perfect matchings and the eight-vertex model
Jin-Yi Cai and Tianyu Liu
Keywords
Abstract
Paper
Approximate complexity
,
the eight-vertex model
,
counting perfect matchings
23:49
08/07/2020
The Complexity of Dynamic Data Race Prediction
Umang Mathur and Andreas Pavlogiannis and Mahesh Viswanathan
Keywords
Abstract
Paper
Complexity
,
Data Race Prediction
22:51
08/07/2020
The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name
Gianluca Curzi
,
Michele Pagani
Keywords
Abstract
Paper
Full abstraction
,
Observational equivalence
,
Bisimilarity
,
Probabilistic lambda calculus
,
Separation
23:57
08/07/2020
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width
Michał Wrona
Keywords
Abstract
Paper
constraint satisfaction problems
,
bounded width
,
local consistency
,
bounded relational width
,
finitely bounded homogeneous structures
,
bounded strict width
24:55
08/07/2020
The Surprising Power of Constant Depth Algebraic Proofs
Russell Impagliazzo
,
Sasank Mouli and Toniann Pitassi
Keywords
Abstract
Paper
Proof Complexity
,
Polynomial Calculus
,
bounded depth
,
Algebraic proofs
,
AC0 [p]-Frege
25:36
08/07/2020
Temporal Constraint Satisfaction Problems in Fixed-Point Logic
Manuel Bodirsky
,
Wied Pakusa
,
and Jakub Rydval
Keywords
Abstract
Paper
fixed-point logic
,
Maltsev conditions
,
temporal constraint satisfaction problems
23:00
08/07/2020
A dichotomy for bounded degree graph homomorphisms with nonnegative weights
Artsiom Hovarau
,
Jin-Yi Cai
,
Martin Dyer
Keywords
Abstract
Paper
Graph homomorphism
,
Complexity dichotomy
,
Counting problems
24:17
08/07/2020
Near-optimal Algorithm for Constructing Greedy Consensus Tree
Hongxun Wu
Keywords
Abstract
Paper
phylogenetic trees
,
greedy consensus trees
,
splay tree
24:41
08/07/2020
The Strahler Number of a Parity Game
Laure Daviaud
,
Marcin Jurdzinski
,
K. S. Thejaswini
Keywords
Abstract
Paper
parity game
,
attractor decomposition
,
progress measure
,
universal tree
,
Strahler number
22:30
08/07/2020
Descriptive complexity on non-Polish spaces II
Mathieu Hoyrup
Keywords
Abstract
Paper
Represented space
,
Computable analysis
,
Descriptive set theory
,
Scott topology
24:52
08/07/2020
Timed games and deterministic separability
Lorenzo Clemente
,
Sławomir Lasota and Radosław Piórkowski
Keywords
Abstract
Paper
Timed automata
,
separability problems
,
timed games
19:19
08/07/2020
New Extremal bounds for Reachability and Strong-Connectivity Preservers under failures
Diptarka Chakraborty and Keerti Choudhary
Keywords
Abstract
Paper
Preservers
,
Strong-connectivity
,
Reachability
,
Fault-tolerant
,
Graph sparsification
23:58
08/07/2020
d-to-1 Hardness of Coloring 3-colorable Graphs with O(1) colors
Venkatesan Guruswami
,
Sai Sandeep
Keywords
Abstract
Paper
graph coloring
,
hardness of approximation
25:10
08/07/2020
On Packing Low-Diameter Spanning Trees
Julia Chuzhoy
,
Merav Parter
,
Zihan Tan
Keywords
Abstract
Paper
Spanning tree
,
packing
,
edge-connectivity
23:24
08/07/2020
Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming
Timothy Chan
,
Jacob Cooper
,
Martin Koutecký
,
Dan Král and Kristýna Pekárková
Keywords
Abstract
Paper
Matroid algorithms
,
width parameters
,
integer programming
,
fixed parameter tractability
,
branch-width
,
branch-depth
19:57
08/07/2020
New Fault Tolerant Subset Preservers
Greg Bodwin
,
Keerti Choudhary
,
Merav Parter and Noa Shahar
Keywords
Abstract
Paper
Subset Preservers
,
Distances
,
Fault-tolerance
24:33
08/07/2020
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games
Dimitris Fotakis
,
Vardis Kandiros
,
Thanasis Lianeas
and
Nikos Mouzakis
,
Panagiotis Patsilinakos and Stratis Skoulakis
Keywords
Abstract
Paper
PLS-completeness
,
Local-Max-Cut
,
Weighted Congestion Games
,
Equilibrium Computation
23:23
08/07/2020
Minimum cut in O(m log² n) time
Pawel Gawrychowski
,
Shay Mozes and Oren Weimann
Keywords
Abstract
Paper
Minimum cut
,
Minimum 2-respecting cut
22:48
«
1
2
3
4
5
6
»