Showing 221 - 240 of 322

221

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations
Sandor P. Fekete ; Marco E. Lübbecke ; Henk Meijer ; et al.
http://arxiv.org/pdf/cs/0310034v1.pdf.

Classification F.2.2 Nonnumerical Algor... Stabbing number crossing number matching spanning tree
Academic journal
Save to List
222

Classifying scheduling policies with respect to unfairness in an M/GI/1
Adam Wierman ; The Pennsylvania State University CiteSeerX Archives
http://www.cs.caltech.edu/~adamw/papers/f111-wierman.pdf.

Categories and Subject D... Sequencing and Schedulin... G.3 [Probability and Sta... Queueing Theory C.4 [Performance of Syst... Performance Attributes G...
Academic journal
Save to List
223

Approximation Schemes for Clustering Problems (Extended Abstract)
W. Fernandez de la Vega ; Marek Karpinski ; Claire Kenyon ; et al.
http://www.cs.brown.edu/research/pubs/pdfs/2003/delaVega-2003-ASC.pdf.

F.2.2 [Nonnumerical Algo... Geometrical
Academic journal
Save to List
224

Distributed object location in a dynamic network
Kirsten Hildrum ; John D. Kubiatowicz ; Satish Rao ; et al.
http://www.ece.uc.edu/~raosa/research/grid/papers/search dyn net.pdf.

Graphs and Networks F.2.2 [Nonnumerical Algo... Routing and layout C.2.4 [Distributed syste... Distributed applications... Theory Keywords Tapestry
Academic journal
Save to List
225

On the sum-of-squares algorithm for bin packing
Janos Csirik ; David S. Johnson ; Claire Kenyon ; et al.
http://jorlin.scripts.mit.edu/docs/publications/88-BinPacking.pdf.

Categories and Subject D... F.2.2 [Nonnumerical Algo... Computations on discrete... Sequencing and schedulin... Algorithms Experimentation
Academic journal
Save to List
226

Editorial - Journal of Discrete Algorithms
Grossi R ; Sebastiani F ; Silvestri F
Journal of discrete algorithms
18 (2013): 1–2. doi:10.1016/j.jda.2012.12.008
info:cnr-pdr/source/autori:Grossi R.; Sebastiani F.; Silvestri F./titolo:Editorial-Journal of Discrete Algorithms/doi:10.1016%2Fj.jda.2012.12.008/rivista:Journal of discrete algorithms (Print)/anno:2013/pagina_da:1/pagina_a:2/intervallo_pagine:1–2/volume:18

F.2.2 Nonnumerical Algor... String processing H.3 INFORMATION STORAGE...
Academic journal
Save to List
227

Algorithms for computing approximate repetitions in musical sequences
Emilios Cambouropoulos ; Maxime Crochemore ; Costas S. Iliopoulos ; et al.
http://www.dcs.kcl.ac.uk/staff/csi/publications/CCI99ApproxRepetitionsMusic.ps.

String algorithms approximate string match... dynamic programming computer-assisted music... G.2.1 Combinatorics F.2.2 Nonnumerical Algor...
Academic journal
Save to List
228

A Subdivision-Based Algorithm for the Sparse Resultant
John F. Canny ; Ioannis Z. Emiris ; The Pennsylvania State University CiteSeerX Archives
ftp://ftp-sop.inria.fr/saga/emiris/publis/CEjacm.ps.gz

Categories and Subject D... I.1.2 Algorithms (Algebr... Analysis of algorithms).... Computations on polynomi... Geometrical problems and... Algorithms
Academic journal
Save to List
229

The power of local information in PageRank
Bressan, Marco ; Peserico, Enoch ; Pretto, Luca ; et al.
WWW 2013 - 22nd International World Wide Web Conference. :179-180

Rio de Janeiro, Brazil ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.1: Computations on... [INFO.INFO-DM]Computer S...
Conference
Save to List
230

Concurrent Maintenance of Lists
William Pugh ; The Pennsylvania State University CiteSeerX Archives
http://www.cs.umd.edu/Library/TRs/CS-TR-2222/CS-TR-2222.ps.Z.

CR Categories and Subjec... D.4.1 [Process Managemen... Concurrency E.1 [Data Structures Lists F.1.2 [Models of Computa...
Academic journal
Save to List
231

A Skip List Cookbook
William Pugh ; The Pennsylvania State University CiteSeerX Archives
http://www.cs.umd.edu/Library/TRs/CS-TR-2286.1/CS-TR-2286.1.ps.Z.

Probabilistic computatio... F.2.2 [Nonnumerical Algo... Sorting and searching G.3
Academic journal
Save to List
232

Finding non-orientable surfaces in 3-manifolds
Burton, Benjamin A. ; de Mesmay, Arnaud ; Wagner, Uli ; et al.
SoCG 2016 - 32nd International Symposium on Computational Geometry. :24-24

Boston, MA, United State... 68U05, 57M50, 68Q25 ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... [INFO.INFO-CG]Computer S...
Conference
Save to List
233

Non-Elementary Complexities for Branching VASS, MELL, and Extensions
Lazić, Ranko ; Schmitz, Sylvain ; University of Warwick [Coventry] ; et al.
Joint meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science. :61-61

Vienna, Austria Linear logic vector addition systems fast-growing complexity ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Conference
Save to List
234

The Complexity of Synthesizing Uniform Strategies
Maubert, Bastien ; Pinchinat, Sophie ; Bozzelli, Laura ; et al.
1st International Workshop on Strategic Reasoning. :8-8

Rome, Italy game theory imperfect imformation complexity ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Conference
Save to List
235

An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
Quinn, Michael J. ; Deo, Narsingh
BIT Numerical Mathematics. March 1986 26(1):35-43

Academic journal
Save to List
236

Randomized Initialization of a Wireless Multihop Network
Vlady Ravelomanana
Proceedings of the 38th Annual Hawaii International Conference on System Sciences. :324b-324b

G.3 Probability and stat... FOS: Computer and inform... Computer Science - Distr... Discrete Mathematics (cs... ACM Classification: C.2.... F.2.2 Nonnumerical algor...
Academic journal
Save to List
237

Verification of gap-order constraint abstractions of counter systems
Bozzelli, Laura ; Pinchinat, Sophie ; Universidad Politécnica de Madrid (UPM) ; et al.
Theoretical Computer Science. :36-36

Abstractions of counter... Temporal logics with Pre... Model checking Verification of infinite... Complexity and decidabil... ACM: F.: Theory of Compu...
Journal
Save to List
238

Skip list cookbook
William Pugh ; The Pennsylvania State University CiteSeerX Archives
http://drum.lib.umd.edu/bitstream/1903/544/2/CS-TR-2286.1.pdf.

CR Categories and Subjec... E.1 [Data Structures Lists F.1.2 [Models of Computa... Probabilistic computatio... F.2.2 [Nonnumerical Algo...
Academic journal
Save to List
239

A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
Olaf Beyersdorff , Sebastian Müller ; The Pennsylvania State University CiteSeerX Archives
http://www.thi.uni-hannover.de/fileadmin/mitarbeiter/beyersdorff/advice_tocl.pdf.

Categories and Subject D... F.1.3 [Complexity Measur... Relations among Complexi... F.2.2 [Nonnumerical Algo... Complexity of proof proc... F.4.1 [Mathematical Logi...
Academic journal
Save to List
240

Applied
Balint Miklos ; Eth Zürich ; The Pennsylvania State University CiteSeerX Archives
http://www.agg.ethz.ch/~miklosb/mesecina/paper/medial_axis_mesecina.pdf.

Categories and Subject D... Geometrical problems and... I.3.5 [Computational Geo... Curve surface solid
Academic journal
Save to List

Filter