„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation
  Datta, Pratish ; Dutta, Ratna ; Mukhopadhyay, Sourav
• Improving and Extending the Testing of Distributions for Shape-Restricted Properties
  Fischer, E. ; Lachish, O. ; Vasudev, Y.
• An $$O(n \log n)$$ O ( n log n ) Time Algorithm for Computing the Path-Length Distance Between Trees
  Bryant, David ; Scornavacca, Celine
• Non-clairvoyantly Scheduling to Minimize Convex Functions
  Fox, Kyle ; Im, Sungjin ; Kulkarni, Janardhan ; Moseley, Benjamin
• A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs
  Khosla, Megha ; Anand, Avishek
• Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
  Gawrychowski, Paweł ; Merkurev, Oleg ; Shur, Arseny M. ; Uznański, Przemysław
• Two Approaches to Building Time-Windowed Geometric Data Structures
  Chan, Timothy M. ; Hershberger, John ; Pratt, Simon
• Primal–Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems
  Angelopoulos, Spyros ; Lucarelli, Giorgio ; Nguyen Kim, Thang
• Estimation of AT and GC content distributions of nucleotide substitution rates in bacterial core genomes
  Bohlin, Jon ; Rose, Brittany ; Pettersson, John H.-O
• Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
  Berbeglia, Gerardo ; Joret, Gwenaël
• Succinct Non-overlapping Indexing
  Ganguly, Arnab ; Shah, Rahul ; Thankachan, Sharma V.
• Weak Coverage of a Rectangular Barrier
  Dobrev, Stefan ; Kranakis, Evangelos ; Krizanc, Danny ; Lafond, Manuel ; Maňuch, Ján ; Narayanan, Lata ; Opatrny, Jaroslav ; Stacho, Ladislav
• Mim-Width II. The Feedback Vertex Set Problem
  Jaffke, Lars ; Kwon, O-joung ; Telle, Jan Arne
• A new emigrant utilization strategy for parallel artificial bee colony algorithm
  Aslan, Selcuk
• Enhancement of fraternal K-median algorithm with CNN for high dropout probabilities to evolve optimal time-complexity
  Nagaraj, Balakrishnan ; Arunkumar, Rajendran ; Nisi, K. ; Vijayakumar, Ponnusamy
• 14th International Symposium on Parameterized and Exact Computation (IPEC 2019)
  Jansen, Bart M. P. ; Telle, Jan Arne 2019 Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
• An adaptive super-twisting sliding mode algorithm for robust control of a biotechnological process
  Bouyahia, Semcheddine ; Semcheddine, Samia ; Talbi, Billel ; Boutalbi, Oussama ; Terchi, Younes
• Quantum commitments from complexity assumptions
  Chailloux, André ; Kerenidis, Iordanis ; Rosgen, Bill
• Selfish Load Balancing and Atomic Congestion Games
  Suri, Subhash ; Toth, Csaba D. ; Zhou, Yunhong
• Analysis of evolutionary patterns of genes in Campylobacter jejuni and C. coli
  Snipen, Lars ; Wassenaar, Trudy M. ; Altermann, Eric ; Olson, Jonathan ; Kathariou, Sophia ; Lagesen, Karin ; Takamiya, Monica ; Knøchel, Susanne ; Ussery, David W. ; Meinersmann, Richard J.