Found 189 Documents (Results 1–100)
Real-time sensor selection for time-varying networks with guaranteed performance. (English) Zbl 1537.93303
Algebraic inverse fast multipole method: a fast direct solver that is better than HODLR based fast direct solver. (English) Zbl 07811315
An explicitly-sparse representation for oscillatory kernels with wave atom-like functions. (English) Zbl 07811308
A tabu search with geometry-based sparsification methods for angular traveling salesman problems. (English) Zbl 1536.90173
Sparse higher order Čech filtrations. (English) Zbl 07927877
Chambers, Erin W. (ed.) et al., 39th international symposium on computational geometry, SoCG 2023, Dallas, Texas, USA, June 12–15, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 258, Article 20, 17 p. (2023).
MSC:
68U05
Vertex sparsification for edge connectivity in polynomial time. (English) Zbl 07918404
Kalai, Yael Tauman (ed.), 14th innovations in theoretical computer science conference, ITCS 2023, January 10–13, 2023, MIT, Cambridge, Massachusetts, USA. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 251, Article 83, 15 p. (2023).
MSC:
68Qxx
Sublinear algorithms for \((1.5+\epsilon)\)-approximate matching. (English) Zbl 07844588
Saha, Barna (ed.) et al., Proceedings of the 55th annual ACM SIGACT symposium on theory of computing, STOC ’23, Orlando, FL, USA, June 20–23, 2023. New York, NY: Association for Computing Machinery (ACM). 254-266 (2023).
MSC:
68Qxx
Spectral hypergraph sparsification via chaining. (English) Zbl 07844584
Saha, Barna (ed.) et al., Proceedings of the 55th annual ACM SIGACT symposium on theory of computing, STOC ’23, Orlando, FL, USA, June 20–23, 2023. New York, NY: Association for Computing Machinery (ACM). 207-218 (2023).
MSC:
68Qxx
Chaining, group leverage score overestimates, and fast spectral hypergraph sparsification. (English) Zbl 07844583
Saha, Barna (ed.) et al., Proceedings of the 55th annual ACM SIGACT symposium on theory of computing, STOC ’23, Orlando, FL, USA, June 20–23, 2023. New York, NY: Association for Computing Machinery (ACM). 196-206 (2023).
MSC:
68Qxx
Distributed symmetry breaking on power graphs via sparsification. (English) Zbl 07824321
Oshman, Rotem (ed.) et al., Proceedings of the 42nd ACM symposium on principles of distributed computing, PODC ’23, Orlando, FL, USA, June 19–23, 2023. New York, NY: Association for Computing Machinery (ACM). 157-167 (2023).
Multi-priority graph sparsification. (English) Zbl 07781720
Hsieh, Sun-Yuan (ed.) et al., Combinatorial algorithms. 34th international workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13889, 1-12 (2023).
Graph sparsification, spectral sketches, and faster resistance computation via short cycle decompositions. (English) Zbl 07780703
Differentially private graph publishing through noise-graph addition. (English) Zbl 1534.68055
Torra, Vicenç (ed.) et al., Modeling decisions for artificial intelligence. 20th international conference, MDAI 2023, Umeå, Sweden, June 19–22, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13890, 253-264 (2023).
MSC:
68P27
Communication-efficient distributed graph clustering and sparsification under duplication models. (English) Zbl 07745720
Mavronicolas, Marios (ed.), Algorithms and complexity. 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13898, 383-398 (2023).
MSC:
68Wxx
The algebraic structure of the densification and the sparsification tasks for CSPs. (English) Zbl 1522.68242
Faster cut sparsification of weighted graphs. (English) Zbl 07870271
Bojańczyk, Mikołaj (ed.) et al., 49th EATCS international conference on automata, languages, and programming, ICALP 2022, Paris, France, July 4–8, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 229, Article 61, 19 p. (2022).
Pairwise reachability oracles and preservers under failures. (English) Zbl 07870245
Bojańczyk, Mikołaj (ed.) et al., 49th EATCS international conference on automata, languages, and programming, ICALP 2022, Paris, France, July 4–8, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 229, Article 35, 16 p. (2022).
Single-source shortest \(p\)-disjoint paths: fast computation and sparse preservers. (English) Zbl 07836579
Berenbrink, Petra (ed.) et al., 39th international symposium on theoretical aspects of computer science, STACS 2022, Marseille, France, virtual conference, March 15–18, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 219, Article 12, 21 p. (2022).
MSC:
68Qxx
Domain sparsification of discrete distributions using entropic independence. (English) Zbl 07829237
Braverman, Mark (ed.), 13th innovations in theoretical computer science conference, ITCS 2022, Berkeley, CA, USA, January 31 – February 3, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 215, Article 5, 23 p. (2022).
MSC:
68Qxx
The Laplacian paradigm in the broadcast congested clique. (English) Zbl 07824281
Milani, Alessia (ed.) et al., Proceedings of the 41st ACM symposium on principles of distributed computing, PODC ’22, Salerno, Italy, July 25–29, 2022. New York, NY: Association for Computing Machinery (ACM). 335-344 (2022).
Breaking the \(n^k\) barrier for minimum \(k\)-cut on simple graphs. (English) Zbl 07774326
Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 131-136 (2022).
MSC:
68Qxx
Quasipolynomial multicut-mimicking networks and kernels for multiway cut problems. (English) Zbl 07758409
MSC:
68-XX
Bounds on the spectral sparsification of symmetric and off-diagonal nonnegative real matrices. (English) Zbl 1482.05202
Fully dynamic approximation of LIS in polylogarithmic time. (English) Zbl 07765200
Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 654-667 (2021).
MSC:
68Qxx
Towards tight bounds for spectral sparsification of hypergraphs. (English) Zbl 07765196
Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 598-611 (2021).
MSC:
68Qxx
Deterministic mincut in almost-linear time. (English) Zbl 07765179
Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 384-395 (2021).
MSC:
68Qxx
Additive sparsification of CSPs. (English) Zbl 07740930
Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 75, 15 p. (2021).
MSC:
68Wxx
Derandomization beyond connectivity: undirected Laplacian systems in nearly logarithmic space. (English) Zbl 1494.68097
Learning to sparsify travelling salesman problem instances. (English) Zbl 07493643
Stuckey, Peter J. (ed.), Integration of constraint programming, artificial intelligence, and operations research. 18th international conference, CPAIOR 2021, Vienna, Austria, July 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12735, 410-426 (2021).
Graph sparsification for derandomizing massively parallel computation with low space. (English) Zbl 07475095
A distributed algorithm for spectral sparsification of graphs with applications to data clustering. (English) Zbl 1483.68259
Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 403-413 (2021).
Near-optimal discrete optimization for experimental design: a regret minimization approach. (English) Zbl 1459.90172
A framework for designing space-efficient dictionaries for parameterized and order-preserving matching. (English) Zbl 1477.68080
Sparsification lower bounds for list \(H\)-coloring. (English) Zbl 07765416
Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 58, 17 p. (2020).
MSC:
68Wxx
A simple algorithm for minimum cuts in near-linear time. (English) Zbl 07759280
Albers, Susanne (ed.), 17th Scandinavian symposium and workshops on algorithm theory, SWAT 2020, Tórshavn, Faroe Islands, June 22–24, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 162, Article 12, 18 p. (2020).
MSC:
68Wxx
Palette sparsification beyond \((\Delta +1)\) vertex coloring. (English) Zbl 07758308
Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 6, 22 p. (2020).
Augmenting the algebraic connectivity of graphs. (English) Zbl 07651209
Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 70, 22 p. (2020).
MSC:
68Wxx
Fault tolerant subgraphs with applications in kernelization. (English) Zbl 07650395
Vidick, Thomas (ed.), 11th innovations in theoretical computer science conference, ITCS 2020, Seattle, Washington, USA, January 12–14, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 151, Article 47, 22 p. (2020).
MSC:
68Qxx
Online row sampling. (English) Zbl 1477.68536
Decision list compression by mild random restrictions. (English) Zbl 07298245
Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 247-254 (2020).
MSC:
68Qxx
Complete solution of tropical vector inequalities using matrix sparsification. (English) Zbl 1538.15020
Randomized near-neighbor graphs, giant components and applications in data science. (English) Zbl 1446.60013
Sparsification of binary CSPs. (English) Zbl 1432.68173
Refined vertex sparsifiers of planar graphs. (English) Zbl 1439.68017
Reviewer: Vladimír Lacko (Košice)
Sparsification scale-spaces. (English) Zbl 07808240
Lellmann, Jan (ed.) et al., Scale space and variational methods in computer vision. 7th international conference, SSVM 2019, Hofgeismar, Germany, June 30 – July 4, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11603, 303-314 (2019).
MSC:
68U10
From DNF compression to sunflower theorems via regularity. (English) Zbl 07564405
Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 5, 14 p. (2019).
MSC:
68Q25
Optimal short cycle decomposition in almost linear time. (English) Zbl 07561582
Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 89, 14 p. (2019).
Sparsification of binary CSPs. (English) Zbl 07559126
Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 17, 8 p. (2019).
Hamiltonian sparsification and gap-simulation. (English) Zbl 1542.68062
Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 2, 21 p. (2019).
Best-case and worst-case sparsifiability of Boolean CSPs. (English) Zbl 1520.68177
Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 15, 13 p. (2019).
When integration sparsification fails: banded Galerkin discretizations for Hermite functions, rational Chebyshev functions and sinh-mapped Fourier functions on an infinite domain, and Chebyshev methods for solutions with \(C^\infty\) endpoint singularities. (English) Zbl 1540.65504
Flows in almost linear time via adaptive preconditioning. (English) Zbl 1434.68679
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 902-913 (2019).
DNF sparsification beyond sunflowers. (English) Zbl 1433.68176
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 454-460 (2019).
Stein’s method for stationary distributions of Markov chains and application to Ising models. (English) Zbl 1441.60021
Approximating matrices and convex bodies. (English) Zbl 1432.15017
Reviewer: Gabriela Cristescu (Arad)
Revisiting the sparsification technique in Kannan’s embedding attack on LWE. (English) Zbl 1518.94098
Su, Chunhua (ed.) et al., Information security practice and experience. 14th international conference, ISPEC 2018, Tokyo, Japan, September 25–27, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11125, 440-452 (2018).
MSC:
94A60
Spanning tree congestion and computation of generalized Győri-Lovász partition. (English) Zbl 1499.68259
Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 32, 14 p. (2018).
Edge estimation with independent set oracles. (English) Zbl 1462.68132
Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 38, 21 p. (2018).
Optimal data reduction for graph coloring using low-degree polynomials. (English) Zbl 1443.68132
Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 22, 12 p. (2018).
Network sparsification for Steiner problems on planar and bounded-genus graphs. (English) Zbl 1454.68114
Cut sparsifiers for balanced digraphs. (English) Zbl 1522.05164
Epstein, Leah (ed.) et al., Approximation and online algorithms. 16th international workshop, WAOA 2018, Helsinki, Finland, August 23–24, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11312, 277-294 (2018).
Solution of a multidimensional tropical optimization problem using matrix sparsification. (English. Russian original) Zbl 1401.90144
Vestn. St. Petersbg. Univ., Math. 51, No. 1, 66-76 (2018); translation from Vestn. St-Peterbg. Univ., Ser. I, Mat. Mekh. Astron. 5(63), No. 1, 86-99 (2018).
Complete algebraic solution of multidimensional optimization problems in tropical semifield. (English) Zbl 1412.90143
MSC:
90C30
Sparsification and subexponential approximation. (English) Zbl 1408.68068
Reviewer: Sevag Gharibian (Paderborn)
Shape simplification through graph sparsification. (English) Zbl 1489.68381
Foggia, Pasquale (ed.) et al., Graph-based representations in pattern recognition. 11th IAPR-TC-15 international workshop, GbRPR 2017, Anacapri, Italy, May 16–18, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10310, 13-22 (2017).
Density independent algorithms for sparsifying \(k\)-step random walks. (English) Zbl 1467.05255
Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 20th international workshop, APPROX 2017 and 21st international workshop, RANDOM 2017, Berkeley, CA, USA, August 16–18, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 81, Article 14, 17 p. (2017).
Sparsification enables predicting kissing hairpin pseudoknot structures of long RNAs in practice. (English) Zbl 1443.92140
Schwartz, Russell (ed.) et al., 17th international workshop on algorithms in bioinformatics, WABI 2017, Boston, MA, USA, August 21–23, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 88, Article 12, 13 p. (2017).
Improved guarantees for vertex sparsification in planar graphs. (English) Zbl 1442.68171
Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 44, 14 p. (2017).
The impact of landscape sparsification on modelling and analysis of the invasion process. (English) Zbl 1436.92017
Iliopoulos, Costas S. (ed.) et al., 16th international symposium on experimental algorithms, SEA 2017, London, UK, June 21–23, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 75, Article 32, 16 p. (2017).
Filter Results by …
Document Type
- Journal Articles (112)
- Collection Articles (77)
all
top 5
Author
- Jansen, Bart M. P. (9)
- Peng, Richard (8)
- Pieterse, Astrid (8)
- Krauthgamer, Robert (7)
- Hon, Wing-Kai (6)
- Shah, Rahul (6)
- Spielman, Daniel Alan (6)
- Ganguly, Arnab (5)
- Thankachan, Sharma V. (5)
- Goranci, Gramoz (4)
- Krivulin, Nikolai K. (4)
- Levin, Alex (4)
- Lovett, Shachar (4)
- Sidford, Aaron (4)
- Woodruff, David P. (4)
- Zhang, Jiapeng (4)
- Chen, Hubie (3)
- Cohen, Michael B. (3)
- de Vos, Tijn (3)
- Forster, Sebastian (3)
- Kapralov, Michael (3)
- Kelner, Jonathan A. (3)
- Koutis, Ioannis (3)
- Lee, Yin Tat (3)
- Peebles, John (3)
- Peng, Pan (3)
- Rao, Anup B. (3)
- Rauch Henzinger, Monika (3)
- Sabelfeld, Karl Karlovich (3)
- Sachdeva, Sushant (3)
- Srivastava, Nikhil (3)
- Sun, He (3)
- Živný, Stanislav (3)
- Alon, Noga (2)
- Batson, Joshua D. (2)
- Boutsidis, Christos (2)
- Butti, Silvia (2)
- Cheung, Yun Kuen (2)
- Dell, Holger (2)
- Drineas, Petros (2)
- Durfee, David (2)
- Ergür, Alperen Ali (2)
- Fung, Wai Shing (2)
- Hariharan, Ramesh (2)
- Harvey, Nicholas J. A. (2)
- Jabbari, Hosna (2)
- Kyng, Rasmus (2)
- Lattanzi, Silvio (2)
- Li, Jason (2)
- Lo, On-Hei Solomon (2)
- Musco, Cameron (2)
- Newman, Ilan I. (2)
- Pachocki, Jakub W. (2)
- Panigrahi, Debmalya (2)
- Parter, Merav (2)
- Rabinovich, Yuri (2)
- Sadakane, Kunihiko (2)
- Sawlani, Saurabh (2)
- Schmidt, Jens M. (2)
- van Melkebeek, Dieter (2)
- Vempala, Santosh S. (2)
- Villagra, Marcos (2)
- Wahlström, Magnus (2)
- Will, Sebastian (2)
- Wu, Kewen (2)
- Yang, Yilin (2)
- Zhu, Zeyuan Allen (2)
- Aharonov, Dorit (1)
- Ahmed, Reyan (1)
- Ajwani, Deepak (1)
- Aloqalaa, Daniyah A. (1)
- Ambikasaran, Sivaram (1)
- Anari, Nima (1)
- Andoni, Alexandr (1)
- Argha, Ahmadreza (1)
- Arora, Sanjeev (1)
- Assadi, Sepehr (1)
- Aubrun, Guillaume (1)
- Backofen, Rolf (1)
- Bai, Shi (1)
- Barbu, Tudor (1)
- Beame, Paul W. (1)
- Bhardwaj, Nalin (1)
- Bhattacharya, Sayan (1)
- Biasotti, Silvia (1)
- Bilò, Davide (1)
- Bodwin, Greg (1)
- Bonchi, Francesco (1)
- Bonnet, Edouard (1)
- Boyd, John Philip (1)
- Bresler, Guy (1)
- Brodzki, Jacek (1)
- Buchet, Mickaël (1)
- Cao, Yanchuang (1)
- Cárdenas, Marcelo (1)
- Carroll, Paula (1)
- Cavagnini, Rossana (1)
- Celler, Branko G. (1)
- Chakraborty, Diptarka (1)
- Chandran, L. Sunil (1)
- and 260 more Authors
all
top 5
Serial
- SIAM J. Comput. (15)
- Algorithmica (8)
- SIAM J. Discrete Math. (5)
- J. ACM (5)
- ACM Trans. Algorithms (5)
- Inf. Process. Lett. (4)
- SIAM J. Sci. Comput. (4)
- Theor. Comput. Sci. (3)
- Math. Program. (3)
- J. Comput. Phys. (2)
- Math. Comput. Simul. (2)
- SIAM J. Optim. (2)
- Monte Carlo Methods Appl. (2)
- ACM Trans. Comput. Theory (2)
- Acta Inf. (1)
- Discrete Appl. Math. (1)
- IMA J. Numer. Anal. (1)
- Int. J. Control (1)
- J. Math. Biol. (1)
- Adv. Math. (1)
- Automatica (1)
- Inf. Sci. (1)
- J. Appl. Probab. (1)
- J. Comb. Theory, Ser. B (1)
- J. Comput. Syst. Sci. (1)
- Networks (1)
- Syst. Control Lett. (1)
- Chin. Ann. Math., Ser. B (1)
- J. Symb. Comput. (1)
- Discrete Comput. Geom. (1)
- SIAM J. Matrix Anal. Appl. (1)
- Int. J. Comput. Geom. Appl. (1)
- Ann. Appl. Probab. (1)
- Comput. Geom. (1)
- Int. Math. Res. Not. (1)
- Appl. Math., Praha (1)
- Int. J. Comput. Math. (1)
- SIAM Rev. (1)
- Bull. Am. Math. Soc., New Ser. (1)
- Ir. Math. Soc. Bull. (1)
- Vestn. St. Petersbg. Univ., Math. (1)
- Commun. Numer. Methods Eng. (1)
- Constraints (1)
- Theory Comput. Syst. (1)
- Positivity (1)
- Soft Comput. (1)
- Netw., Comput. Neural Syst. (1)
- Rev. Mat. Complut. (1)
- Data Min. Knowl. Discov. (1)
- Appl. Sci. (1)
- J. Discrete Algorithms (1)
- Syst. Eng. Electron. (1)
- J. Noncommut. Geom. (1)
- Electron. J. Stat. (1)
- Found. Trends Theor. Comput. Sci. (1)
- J. Comput. Appl. (1)
- Discrete Math. Algorithms Appl. (1)
- Sci. Sin., Math. (1)
- Theory Comput. (1)
- Inf. Inference (1)
- Comput. Sci. Rev. (1)
- J. Log. Algebr. Methods Program. (1)
- Arnold Math. J. (1)
- CGT, Comput. Geom. Topol. (1)
all
top 3
Software
- GitHub (2)
- Graphs (2)
- Gurobi (2)
- Lippmann_Schwinger (2)
- Mathematica (2)
- Mfold (2)
- SpectralNet (2)
- TSPLIB (2)
- Algorithm 971 (1)
- BKZ (1)
- BoomerAMG (1)
- CGAL (1)
- CGS (1)
- COMPleib (1)
- CONTRAfold (1)
- CPLEX (1)
- CoSaMP (1)
- DLMF (1)
- Eigen (1)
- FHT (1)
- FastGaussQuadrature (1)
- H2Pack (1)
- HODLRlib (1)
- IPknot (1)
- LAMG (1)
- LKH (1)
- MUMMER (1)
- Maple (1)
- Matlab (1)
- NetworkX (1)
- PRMLT (1)
- PySCIPOpt (1)
- RAPPOR (1)
- RCV1 (1)
- SCIP (1)
- SDPT3 (1)
- SFO (1)
- SFSDP (1)
- SNAP (1)
- Scikit (1)
- SeDuMi (1)
- ShortLoop (1)
- SparseCoLO (1)
- SparseMatrix (1)
- SuLQ (1)
- TensorLy (1)
- ViennaRNA (1)
- YALMIP (1)
- aplore3 (1)
- complib (1)
- mctoolbox (1)
- t-SNE (1)
