Computer Science

49507 papers in Computer Science

Explore Subcategories

Information Theory
1601 Papers
Artificial Intelligence
1580 Papers
Cryptography and Security
1290 Papers
Data Structures and Algorithms
1258 Papers
Networking
1126 Papers
Discrete Mathematics
1039 Papers
Distributed Computing
981 Papers
Logic in Computer Science
972 Papers
Software Engineering
935 Papers
Machine Learning
932 Papers
Computers and Society
915 Papers
Computational Complexity
861 Papers
TITLE
DATE
VIEWS
Quantifying Homology Classes
By Chao Chen, Daniel Freedman · ArXiv: 0802.2865
2008-02-21
0
On Geometric Spanners of Euclidean and Unit Disk Graphs
By Iyad A. Kanj, Ljubomir Perkovic · ArXiv: 0802.2864
2008-02-21
0
Compatibility of Shelah and Stupps and Muchniks iteration with fragments of monadic second order logic
By Dietrich Kuske · ArXiv: 0802.2862
2008-02-21
1
A Theory for Valiants Matchcircuits (Extended Abstract)
By Angsheng Li, Mingji Xia · ArXiv: 0802.2860
2008-02-21
0
Convergence Thresholds of Newtons Method for Monotone Polynomial Equations
By Javier Esparza, Stefan Kiefer, Michael Luttenberger · ArXiv: 0802.2856
2008-02-29
0
Computing Minimum Spanning Trees with Uncertainty
By Thomas Erlebach, Michael Hoffmann, Danny Krizanc · ArXiv: 0802.2855
2008-02-21
0
Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps
By Jean-Franc{c}ois Dufourd (LSIIT) · ArXiv: 0802.2853
2008-02-21
0
Tight Bounds for Blind Search on the Integers
By Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener · ArXiv: 0802.2852
2008-02-21
0
An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines
By ** - **Pinyan Lu (루 핀얀)** – Institute for Theoretical Computer Science, Tsinghua University, Beijing · ArXiv: 0802.2851
2008-02-21
0
On Dynamic Breadth-First Search in External-Memory
By Ulrich Meyer · ArXiv: 0802.2847
2008-02-21
0
Geodesic Frechet Distance Inside a Simple Polygon
By Atlas F. Cook IV, Carola Wenk · ArXiv: 0802.2846
2008-05-21
0
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
By Eric Colin De Verdi`ere (LIENS), Alex, er Schrijver (CWI) · ArXiv: 0802.2845
2008-02-21
0
Analytic aspects of the shuffle product
By Marni Mishna, Mike Zabrocki · ArXiv: 0802.2844
2008-02-21
0
Stackelberg Network Pricing Games
By Patrick Briest, Martin Hoefer, Piotr Krysta · ArXiv: 0802.2841
2008-02-21
0
On Termination for Faulty Channel Machines
By Patricia Bouyer (LSV), Nicolas Markey (LSV), Jo"el Ouaknine · ArXiv: 0802.2839
2016-07-07
0
Factoring Polynomials over Finite Fields using Balance Test
By Ch, an Saha · ArXiv: 0802.2838
2008-02-21
0
Trimmed Moebius Inversion and Graphs of Bounded Degree
By Andreas Bj"orklund, Thore Husfeldt, Petteri Kaski (HIIT) · ArXiv: 0802.2834
2008-02-21
0
Limit complexities revisited
By Laurent Bienvenu (LIF), Andrej Muchnik, Alex · ArXiv: 0802.2833
2008-02-21
0
Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental
By Zvi Lotker, Boaz Patt-Shamir, Dror Rawitz · ArXiv: 0802.2832
2008-02-21
0
Equilibria, Fixed Points, and Complexity Classes
By Mihalis Yannakakis · ArXiv: 0802.2831
2008-02-21
0
Understanding maximal repetitions in strings
By Maxime Crochemore (IGM), Lucian Ilie · ArXiv: 0802.2829
2008-02-21
0
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
By Johan M. M. Van Rooij, Hans L. Bodlaender · ArXiv: 0802.2827
2008-02-21
0
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
By Thomas Thierauf, Fabian Wagner · ArXiv: 0802.2825
2008-02-21
2
On the decomposition of k-valued rational relations
By Jacques Sakarovitch (LTCI), Rodrigo De Souza (LTCI) · ArXiv: 0802.2823
2008-02-21
0
Covering Directed Graphs by In-trees
By Naoyuki Kamiyama, Naoki Katoh · ArXiv: 0802.2755
2008-02-21
0
Authentication over Noisy Channels
By Lifeng Lai, Hesham El Gamal, H. Vincent Poor · ArXiv: 0802.2701
2008-02-20
0
On Characteristic Polynomials of the Family of Cobweb Posets
By Ewa Krot-Sieniawska · ArXiv: 0802.2696
2008-02-21
0
A Simple Distributed Antenna Processing Scheme for Cooperative Diversity
By Yijia Fan, Abdulkareem Adinoyi, John S Thompson · ArXiv: 0802.2684
2008-02-20
0
The complexity of planar graph choosability
By Shai Gutner · ArXiv: 0802.2668
2008-02-20
0
Pure Exploration for Multi-Armed Bandit Problems
By Sebastien Bubeck (INRIA Futurs), Remi Munos (INRIA Futurs), Gilles Stoltz (DMA · ArXiv: 0802.2655
2010-07-26
0
«« « 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 » »»