The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "ITCS"( http://dblp.L3S.de/Venues/ITCS )

URL (DBLP): http://dblp.uni-trier.de/db/conf/innovations

Publication years (Num. hits)
2008-2012 (85) 2013 (163) 2014 (49) 2015 (46) 2016 (41) 2017 (62) 2018 (62) 2019 (67) 2020 (88) 2021 (91) 2022 (122) 2023 (103) 2024 (105)
Publication types (Num. hits)
inproceedings(1068) proceedings(16)
Venues (Conferences, Journals, ...)
ITCS(1084)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 1084 publication records. Showing 1084 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Baptiste Louf, Colin McDiarmid, Fiona Skerman Modularity and Graph Expansion. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Pritam Chandra, Ankit Garg, Neeraj Kayal, Kunal Mittal, Tanmay Sinha Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Tomer Ezra, Michal Feldman, Maya Schlesinger On the (In)approximability of Combinatorial Contracts. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Gregory Valiant Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Yael Kirkpatrick, Rebecca Lin Graph Threading. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Teresa Anna Steiner Differentially Private Approximate Pattern Matching. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Zhao Song 0002, Lichen Zhang 0003, Ruizhe Zhang 0001 Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Time. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani Extractors for Polynomial Sources over 2. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Kevin Pratt On Generalized Corners and Matrix Multiplication. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Charlotte Out, Nicolás Rivera, Thomas Sauerwald, John Sylvester 0001 Rumors with Changing Credibility. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Rex Fernando, Yuval Gelles, Ilan Komargodski Scalable Distributed Agreement from LWE: Byzantine Agreement, Broadcast, and Leader Election. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Roozbeh Bassirian, Bill Fefferman, Kunal Marwaha Quantum Merlin-Arthur and Proofs Without Relative Phase. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Tanmay Inamdar 0002, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan 0001, Saket Saurabh 0001 Exponential-Time Approximation Schemes via Compression. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Scott Aaronson, Harry Buhrman, William Kretschmer A Qubit, a Coin, and an Advice String Walk into a Relational Problem. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Naifeng Liu, Kevin Schewior Quickly Determining Who Won an Election. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jason D. Hartline, Aleck C. Johnsen Equivocal Blends: Prior Independent Lower Bounds. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan Geometric Covering via Extraction Theorem. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Zhili Chen, Joshua A. Grochow, Youming Qiao, Gang Tang, Chuanqi Zhang On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials III: Actions by Classical Groups. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Weihao Kong, Mingda Qiao, Rajat Sen A Combinatorial Approach to Robust PCA. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ishay Haviv The Chromatic Number of Kneser Hypergraphs via Consensus Division. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Constantinos Daskalakis, Noah Golowich, Nika Haghtalab, Abhishek Shetty Smooth Nash Equilibria: Algorithms and Complexity. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, Adi Shraibman An Improved Protocol for ExactlyN with More Than 3 Players. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jason Milionis, Ciamac C. Moallemi, Tim Roughgarden A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, Jeroen Zuiddam Discreteness of Asymptotic Tensor Ranks (Extended Abstract). Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jop Briët, Harry Buhrman, Davi Castro-Silva, Niels M. P. Neumann Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum (Extended Abstract). Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Atanas Dinev, S. Matthew Weinberg Simple and Optimal Online Contention Resolution Schemes for k-Uniform Matroids. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Euiwoong Lee, Pasin Manurangsi Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Louis Golowich, Tali Kaufman NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Monika Henzinger, Barna Saha, Martin P. Seybold, Christopher Ye On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Nico Döttling, Tamer Mour On the Black-Box Complexity of Correlation Intractability. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Noam Mazor, Rafael Pass The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity Is False. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yi-Jun Chang The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Siddharth Barman, Anand Krishna, Pooja Kulkarni, Shivika Narang Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Barak Nehoran, Mark Zhandry A Computational Separation Between Quantum No-Cloning and No-Telegraphing. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Hadley Black, Eric Blais, Nathaniel Harms Testing and Learning Convex Sets in the Ternary Hypercube. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Mayank Goswami 0001, Riko Jacob An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan 0002 One-Way Functions vs. TFNP: Simpler and Improved. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1C. Ramya, Pratik Shastri Lower Bounds for Planar Arithmetic Circuits. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Huacheng Yu, Wei Zhan Sampling, Flowers and Communication. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson 0002 The Message Complexity of Distributed Graph Optimization. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Asaf Petruschka, Shay Sapir, Elad Tzalik Color Fault-Tolerant Spanners. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Prantar Ghosh, Vihan Shah New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Adam Tauman Kalai, Preetum Nakkiran Loss Minimization Yields Multicalibration for Large Neural Networks. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Nika Haghtalab, Nicole Immorlica, Brendan Lucier, Markus Mobius, Divyarthi Mohan Communicating with Anecdotes (Extended Abstract). Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Joseph Slote Parity vs. AC0 with Simple Quantum Preprocessing. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Matthias C. Caro, Marcel Hinsche, Marios Ioannou, Alexander Nietner, Ryan Sweke Classical Verification of Quantum Learning. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Abhranil Chatterjee 0001, Mrinal Kumar 0001, Ben Lee Volk Determinants vs. Algebraic Branching Programs. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ari Karchmer Distributional PAC-Learning from Nisan's Natural Proofs. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ragesh Jaiswal, Amit Kumar 0001, Jatin Yadav FPT Approximation for Capacitated Sum of Radii. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov Homogeneous Algebraic Complexity Theory and Algebraic Formulas. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Mark Zhandry Quantum Money from Abelian Group Actions. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Iddo Tzameret, Luming Zhang Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ce Jin 0001, R. Ryan Williams, Nathaniel Young A VLSI Circuit Model Accounting for Wire Delay. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Mark Zhandry The Space-Time Cost of Purifying Quantum Computations. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Adam Bene Watts, John Bostanci Quantum Event Learning and Gentle Random Measurements. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Clément L. Canonne, Yucheng Sun Private Distribution Testing with Heterogeneous Constraints: Your Epsilon Might Not Be Mine. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Kaartik Bhushan, Venkata Koppula, Manoj Prabhakaran 0001 Homomorphic Indistinguishability Obfuscation and Its Applications. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Aaron (Louie) Putterman, Edward Pyne Pseudorandom Linear Codes Are List-Decodable to Capacity. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Pavel Hubácek, Erfan Khaniki, Neil Thapen TFNP Intersections Through the Lens of Feasible Disjunction. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Kernelization of Counting Problems. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xingjian Li 0006, Qipeng Liu 0001, Angelos Pelecanos, Takashi Yamakawa Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Huacheng Yu, Wei Zhan Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Shir Peleg, Amir Shpilka, Ben Lee Volk Tensor Reconstruction Beyond Constant Rank. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Nick Fischer, Piotr Kaliciak, Adam Polak 0001 Deterministic 3SUM-Hardness. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Prabhanjan Ananth, Yao-Ting Lin, Henry Yuen Pseudorandom Strings from Pseudorandom Quantum States. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Avrim Blum, Melissa Dutz Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Aleksandar Nikolov, Haohua Tang General Gaussian Noise Mechanisms and Their Optimality for Unbiased Mean Estimation. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Fabien Dufoulon, Michael Moorman, William K. Moses Jr., Gopal Pandurangan Time- and Communication-Efficient Overlay Network Construction via Gossip. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Haosen Ge, Hamsa Bastani, Osbert Bastani Rethinking Fairness for Human-AI Collaboration (Extended Abstract). Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Roi Livni Making Progress Based on False Discoveries. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Thomas Karam Small Sunflowers and the Structure of Slice Rank Decompositions. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Gabriel Bathie, R. Ryan Williams Towards Stronger Depth Lower Bounds. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jiawei Li Total NP Search Problems with Abundant Solutions. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Greg Bodwin, Henry L. Fleischmann Spanning Adjacency Oracles in Sublinear Time. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Eshan Chattopadhyay, Jyun-Jie Liao Recursive Error Reduction for Regular Branching Programs. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Alessandro Chiesa, Ziyi Guan, Burcu Yildiz On Parallel Repetition of PCPs. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Venkatesan Guruswami (eds.) 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  BibTeX  RDF
1Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals Proving Unsatisfiability with Hitting Formulas. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ofer Neiman, Idan Shabat On the Size Overhead of Pairwise Spanners. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yuhao Li 0002, William Pires, Robert Robere Intersection Classes in TFNP and Proof Complexity. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Minming Li, Peter Robinson 0002, Xianbin Zhu 0002 Dynamic Maximal Matching in Clique Networks. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ke Wu 0001, Elaine Shi, Hao Chung Maximizing Miner Revenue in Transaction Fee Mechanism Design. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yumou Fei, Leslie Ann Goldberg, Pinyan Lu Two-State Spin Systems with Negative Interactions. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Varsha Dani, Thomas P. Hayes, Seth Pettie, Jared Saia Fraud Detection for Random Walks. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan Electrical Flows for Polylogarithmic Competitive Oblivious Routing. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Renato Ferreira Pinto Jr., Nathaniel Harms Distribution Testing with a Confused Collector. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Maryam Aliakbarpour, Rose Silver, Thomas Steinke 0002, Jonathan R. Ullman Differentially Private Medians and Interior Points for Non-Pathological Data. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Arvind V. Mahankali, David P. Woodruff, Ziyu Zhang Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xi Chen 0001, Anindya De, Yuhao Li 0002, Shivam Nadimpalli, Rocco A. Servedio Testing Intersecting and Union-Closed Families. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Josh Alman, Ethan Turok, Hantao Yu, Hengzhi Zhang Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Keller Blackwell, Mary Wootters A Characterization of Optimal-Rate Linear Homomorphic Secret Sharing Schemes, and Applications. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Rafael M. Frongillo, Maneesha Papireddygari, Bo Waggoner An Axiomatic Characterization of CFMMs and Equivalence to Prediction Markets. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Justin Y. Chen, Piotr Indyk, David P. Woodruff Space-Optimal Profile Estimation in Data Streams with Applications to Symmetric Functions. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Aaron Bernstein, Greg Bodwin, Nicole Wein Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights? Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Romain Cosson, Laurent Massoulié Collective Tree Exploration via Potential Function Method. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Rajarshi Bhattacharjee, Gregory Dexter, Cameron Musco, Archan Ray, Sushant Sachdeva, David P. Woodruff Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra. Search on Bibsonomy ITCS The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1084 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license