Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a StashGeometric applications of a matrix-searching algorithmOn the power of randomization in on-line algorithmsAnO(ND) difference algorithm and its variationsDiameter and Treewidth in Minor-Closed Graph Families, RevisitedThe searching over separators strategy to solve some NP-hard problems in subexponential timeGeometric Representation of Graphs in Low Dimension Using Axis Parallel BoxesDistributed Matrix-Free Solution of Large Sparse Linear Systems over Finite FieldsA Note on Point Location in Delaunay Triangulations of Random PointsDynamic fractional cascadingAlgorithms for Graphs Embeddable with Few Crossings per EdgeParameterized Complexity of Eulerian Deletion Problems.Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons.Populations Can Be Essential in Tracking Dynamic Optima.ForewordA Subexponential Bound for Linear ProgrammingWeaving Patterns of Lines and Line Segments in SpaceShortest Paths for Line SegmentsSimultaneous Inner and Outer Approximation of ShapesQuasi-Optimal Upper Bounds for Simplex Range Searching and New Zone TheoremsComplexity of Secure Sets.Randomized Search TreesAlgorithms for dense graphs and networks on the random access computerApproximation Algorithms for Intersection GraphsMinimum Weakly Fundamental Cycle Bases Are Hard To FindQuantum Complexities of Ordered Searching, Sorting, and Element DistinctnessFractional cascading: I. A data structuring techniqueFractional cascading: II. ApplicationsRandomized incremental construction of Delaunay and Voronoi diagramsIncremental topological flipping works for regular triangulationsAn improved parallel algorithm for integer GCDA tight lower bound for the worst case of Bottom-Up-HeapsortA linear algorithm to find a rectangular dual of a planar triangulated graphA Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear ProgramsCompetitive snoopy cachingReactive Local Search for the Maximum Clique Problem1The pairing heap: A new form of self-adjusting heapWhy Neighbor-Joining WorksFast Minor Testing in Planar GraphsDiameter and Treewidth in Minor-Closed Graph Families
P1433
Q29013420-AA94FFB3-93C3-4AC0-B17B-147E3D45FB70Q29027819-DB048E17-CBE7-43E7-AC68-F9814A8A1AF8Q29028151-CD04CB36-D6C7-416B-B40B-62890930EFD0Q29028524-5BAD3A87-54FC-4EBD-A12B-70D609146EE0Q29031208-521CCCA8-73B6-40D8-9E09-2A444BC1EAA7Q29037496-95A33F47-549D-45C2-84B2-50BFC43A252CQ29039815-DB956C5F-2435-42AD-9FBF-0CE29DDD9B75Q29305984-E852ECCF-CBBA-463F-B6BA-C738EB85326CQ29395717-1C8FDCA1-DDC6-4EF6-BAF0-32802B126B37Q30048731-72FBCB94-94A2-4C3C-AA1A-7771A70EC966Q30053231-08EBB0DC-7565-4AE0-BDA6-9C856B47B169Q37442987-AF456CE2-B148-45D9-9E19-23629EF376D7Q37586483-C3818F94-3635-4E87-8903-AAD47F95B439Q38660675-C22D2CF4-64CC-453E-8EF6-2F22BF2444A7Q54308658-93f71da6-4c36-80e8-700b-ba3cd83daec2Q54309309-9d5a7a12-4013-02b4-19e6-8e4736181708Q54309465-e1c43a4d-4fb7-90f7-d018-15643b4c4f02Q54309488-650a1ecc-4def-3943-ed07-793c2b4e450cQ54309584-92ca9ec9-4f16-688a-0042-1e17e5c8cdc8Q54309635-49fbe8f6-4450-2e9d-d0fb-dc566738d61fQ55312596-51FB1A5F-8C3A-4404-BFAE-20A6826745D9Q55891751-658A8774-AED5-4114-8F89-7723438960A2Q55952576-4402E1B2-5A9F-4E97-93DC-06316102A370Q56019096-DCD0657B-5F77-4155-9B60-9F5CFD1D7F3CQ56020351-43513042-A49E-458E-BC41-75F69DB53493Q56039270-2754A044-4343-44B9-8D60-CCFE403D350AQ56039273-14F58B47-C0FC-4C2D-B762-AD1A111DCE63Q56039274-675683B3-5F58-4905-BA39-09A602D68769Q56047092-779E3288-2170-49BD-9EAB-F5B3DEA23E96Q56047093-A404F267-6ADC-4D37-A79A-14799D9BA0A1Q56048613-F4AAC63B-AD87-4FDC-8C26-A8CAED82A60EQ56049338-8B07CCD7-3E6D-4C50-9DAA-6BD8E4970493Q56059583-2265DA87-B3BC-4CE5-8912-EC56F416B080Q56080062-8CD282CE-B9E1-4E76-ADB2-2D7E353EE083Q56140916-E1A1B572-3BF1-44F1-B190-105E9CDD2123Q56210392-89E64E2C-CDA3-441B-83B8-7EDA1633F025Q56210997-338DC445-42DC-4DC7-B4A4-6B03A0EEF462Q56228813-1FFA3E99-682A-4687-8CD0-25B77C3C8A68Q56235104-A128C313-5AC2-46D2-98E6-3739007DE193Q56235108-FDED0CED-9A46-410D-A298-F74900EFD255
P1433
description
journal
@en
revista científica
@es
rivista scientifica
@it
vědecký časopis
@cs
wetenschappelijk tijdschrift van Springer Science+Business Media
@nl
wissenschaftliche Zeitschrift
@de
مجلة
@ar
वैज्ञानिक पत्रिका
@hi
name
Algorithmica
@ast
Algorithmica
@da
Algorithmica
@en
Algorithmica
@es
Algorithmica
@fi
Algorithmica
@fr
Algorithmica
@it
Algorithmica
@nb
Algorithmica
@nl
Algorithmica
@nn
type
label
Algorithmica
@ast
Algorithmica
@da
Algorithmica
@en
Algorithmica
@es
Algorithmica
@fi
Algorithmica
@fr
Algorithmica
@it
Algorithmica
@nb
Algorithmica
@nl
Algorithmica
@nn
prefLabel
Algorithmica
@ast
Algorithmica
@da
Algorithmica
@en
Algorithmica
@es
Algorithmica
@fi
Algorithmica
@fr
Algorithmica
@it
Algorithmica
@nb
Algorithmica
@nl
Algorithmica
@nn
P243
P3181
P1055
P1144
P1156
P1159
P1160
Algorithmica
P1277
P1476
Algorithmica
@en
P236
P243
P3181
P407
P571
1986-01-01T00:00:00Z