<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>https://ecency.com</link><image><url>https://ecency.com/logo512.png</url><title>RSS Feed</title><link>https://ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Wed, 15 Jul 2026 15:39:03 GMT</lastBuildDate><atom:link href="https://ecency.com/@binarytree/rss" rel="self" type="application/rss+xml"/><item><title><![CDATA[Data Structures And Algorithms | 2019-07-21]]></title><description><![CDATA[Data Structures And Algorithms Stack sorting with restricted stacks (1907.08142v1) Giulio Cerbai, Anders Claesson, Luca Ferrari 2019-07-18 The (classical) problem of characterizing and enumerating permutations]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-21</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-21</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Sat, 20 Jul 2019 23:30:30 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAs6qN4vEer9xGyqnCRo6thLRH6XdD2G4uibmsYXzP5qDdiBH5YJ?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-19]]></title><description><![CDATA[Data Structures And Algorithms Limits of Ordered Graphs and their Applications (1811.02023v2) Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida 2018-11-05 The emerging theory of graph limits exhibits]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-19</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-19</guid><category><![CDATA[datastructure]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Thu, 18 Jul 2019 23:30:21 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAs6Q6qQeMPYCD2Z2hiH473zFFzyyPV9iej56xP7hyHr4McdMmeN?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-18]]></title><description><![CDATA[Data Structures And Algorithms Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression (1907.07167v1) Deeksha Adil, Richard Peng, Sushant Sachdeva 2019-07-16 Linear regression in -norm is]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-18</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-18</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Wed, 17 Jul 2019 23:30:36 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAsTy3Rk7PdQy2JywpCd4y9o7EUxTqYtPPZHjhxgaALALXZK8iZk?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-17]]></title><description><![CDATA[Data Structures And Algorithms Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination (1907.06576v1) Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos 2019-07-15 We consider]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-17</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-17</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Tue, 16 Jul 2019 23:30:30 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAs9vNPb7dH2RjpXtEZqPKjbJBKJ8jLkPyPDndWmR44YjBj9dsoL?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-16]]></title><description><![CDATA[Data Structures And Algorithms On a Generalization of the Marriage Problem (1907.05870v1) Jonathan Lenchner 2019-07-12 We present a generalization of the marriage problem underlying Hall's famous Marriage]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-16</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-16</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Mon, 15 Jul 2019 23:30:15 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAsVpKrTGtpHZZBerqGFBDpNGPL3ZTEzmTAm9iYQzBeoZTT6gnz2?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-12]]></title><description><![CDATA[Data Structures And Algorithms Vertex-Fault Tolerant Complete Matching in Bipartite graphs: the Biregular Case (1907.04844v1) Sylwia Cichacz, Karol Suchan 2019-07-10 Given a family of graphs and a positive]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-12</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-12</guid><category><![CDATA[datastructure]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Thu, 11 Jul 2019 23:30:39 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAsURW9ZbLNTTMTLR2LbbqG7cMyTiBezWQ2oGghgvpczLxpqR534?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-11]]></title><description><![CDATA[Data Structures And Algorithms Better Sample -- Random Subset Sum in and its Impact on Decoding Random Linear Codes (1907.04295v1) Andre Esser, Alexander May 2019-07-09 We propose a new heuristic algorithm]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-11</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-11</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Wed, 10 Jul 2019 23:30:18 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAsVP4U2VroJYXhZb8CfLvqcSaJNhvLFjMHJgJFVBwzhGS32eagN?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-10]]></title><description><![CDATA[Data Structures And Algorithms Multi-budgeted directed cuts (1810.06848v2) Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström 2018-10-16 We study multi-budgeted variants of the]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-10</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-10</guid><category><![CDATA[datastructure]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Tue, 09 Jul 2019 23:30:12 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAs7i34V1TvRjmgQAs1doNhYiUYTUyvbxm8uZDapzvC4RHPe2ydg?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-08]]></title><description><![CDATA[Data Structures And Algorithms Locally Private k-Means Clustering (1907.02513v1) Uri Stemmer 2019-07-04 We design a new algorithm for the Euclidean -means problem that operates in the local model of]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-08</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-08</guid><category><![CDATA[datastructure]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Sun, 07 Jul 2019 23:30:15 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAs934q43889ruzFxRcdYyaL1tpJUGhopvzgEFYzNhHBLxQqJJyC?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-07]]></title><description><![CDATA[Data Structures And Algorithms Locally Private k-Means Clustering (1907.02513v1) Uri Stemmer 2019-07-04 We design a new algorithm for the Euclidean -means problem that operates in the local model of]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-07</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-07</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Sat, 06 Jul 2019 23:30:15 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAs934q43889ruzFxRcdYyaL1tpJUGhopvzgEFYzNhHBLxQqJJyC?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-06]]></title><description><![CDATA[Data Structures And Algorithms Locally Private k-Means Clustering (1907.02513v1) Uri Stemmer 2019-07-04 We design a new algorithm for the Euclidean -means problem that operates in the local model of]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-06</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-06</guid><category><![CDATA[datastructure]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Fri, 05 Jul 2019 23:30:18 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAs934q43889ruzFxRcdYyaL1tpJUGhopvzgEFYzNhHBLxQqJJyC?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-05]]></title><description><![CDATA[Data Structures And Algorithms Variance Reduction for Matrix Games (1907.02056v1) Yair Carmon, Yujia Jin, Aaron Sidford, Kevin Tian 2019-07-03 We present a randomized primal-dual algorithm that solves]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-05</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-05</guid><category><![CDATA[datastructure]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Thu, 04 Jul 2019 23:30:21 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAsUrkH2mq2gQfu4ptYdMf6oFs3zJsnnpoT9WeHeQrBFYH8mAvz2?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-04]]></title><description><![CDATA[Data Structures And Algorithms Isomorphism Problem for -graphs (1907.01495v1) Deniz Ağaoğlu 2019-07-02 An -graph is the intersection graph of connected subgraphs of a suitable subdivision of a fixed graph]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-04</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-04</guid><category><![CDATA[datastructure]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Wed, 03 Jul 2019 23:30:24 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAs7iw2fAVjqAA8zdbvwpSnDF6Gx2dEgbJZ29b8kXQZgwXc4s15Y?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-03]]></title><description><![CDATA[Data Structures And Algorithms Approximability of Discriminators Implies Diversity in GANs (1806.10586v4) Yu Bai, Tengyu Ma, Andrej Risteski 2018-06-27 While Generative Adversarial Networks (GANs) have]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-03</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-03</guid><category><![CDATA[datastructure]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Tue, 02 Jul 2019 23:30:12 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAsTYCX3StGTCqrBBmFnivCthtCPCXk1UUsfrhT1vCYUvpD3n9ZY?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-07-02]]></title><description><![CDATA[Data Structures And Algorithms Detecting Feedback Vertex Sets of Size in Time (1906.12298v1) Jason Li, Jesper Nederlof 2019-06-28 In the Feedback Vertex Set problem, one is given an undirected graph and]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-02</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-07-02</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Mon, 01 Jul 2019 23:30:15 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAs934q43889ruzFxRcdYyaL1tpJUGhopvzgEFYzNhHBLxQqJJyC?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-06-24]]></title><description><![CDATA[Data Structures And Algorithms Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards (1809.02016v2) Alessandro Arlotto, Xinchang Xie 2018-09-06 We study a dynamic and stochastic]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-06-24</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-06-24</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Sun, 23 Jun 2019 23:30:24 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAsTYCX3StGTCqrBBmFnivCthtCPCXk1UUsfrhT1vCYUvpD3n9ZY?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-06-23]]></title><description><![CDATA[Data Structures And Algorithms Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards (1809.02016v2) Alessandro Arlotto, Xinchang Xie 2018-09-06 We study a dynamic and stochastic]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-06-23</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-06-23</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Sat, 22 Jun 2019 23:30:18 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAsTYCX3StGTCqrBBmFnivCthtCPCXk1UUsfrhT1vCYUvpD3n9ZY?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-05-07]]></title><description><![CDATA[Data Structures And Algorithms Learning Some Popular Gaussian Graphical Models without Condition Number Bounds (1905.01282v1) Jonathan Kelner, Frederic Koehler, Raghu Meka, Ankur Moitra 2019-05-03 Gaussian]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-05-07</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-05-07</guid><category><![CDATA[datastructure]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Mon, 06 May 2019 23:30:15 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAsU4EP6Cvg91xQsp9J6Qr3QAPkdDtkGmfFbxr95KstWA653UvBQ?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-05-05]]></title><description><![CDATA[Data Structures And Algorithms Log Diameter Rounds Algorithms for -Vertex and -Edge Connectivity (1905.00850v1) Alexandr Andoni, Clifford Stein, Peilin Zhong 2019-05-02 Many modern parallel systems, such]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-05-05</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-05-05</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Sat, 04 May 2019 23:31:24 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAs6qZiQKYcaWBjNKEUhYe9oEa9DnmC8FwDDbhfvJj7pUgAoW62r?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures And Algorithms | 2019-05-03]]></title><description><![CDATA[Data Structures And Algorithms Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times (1810.01223v2) Max A. Deppert, Klaus Jansen 2018-10-02 We investigate the scheduling of]]></description><link>https://ecency.com/@binarytree/data-structures-and-algorithms--2019-05-03</link><guid isPermaLink="true">https://ecency.com/@binarytree/data-structures-and-algorithms--2019-05-03</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[binarytree]]></dc:creator><pubDate>Thu, 02 May 2019 23:30:24 GMT</pubDate><enclosure url="https://i.ecency.com/p/MG5aEodBkvgwX3KPxqFFVCChX1vS7wNjSbmdAtPgvs2NgpAsTYCX3StGTCqrBBmFnivCthtCPCXk1UUsfrhT1vCYUvpD3n9ZY?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>