ICALP 2009 - PDF Preprint Papers

ICALP 2009 International Colloquium on Automata

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICALP-2009 Paper

click to vote

ICALP
2009
Springer

100views Programming Languages» more ICALP 2009»

Rumor Spreading in Social Networks

2 years 2 months ago

Download lightless.org

Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc...

Flavio Chierichetti, Silvio Lattanzi, Alessandro P...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	100	Rumor Spreading in Social Networks	claim
2	76	On Cartesian Trees and Range Minimum Queries	claim
3	74	Smoothed Analysis of Balancing Networks	claim
4	70	Graph Sparsification in the Semi-streaming Model	claim
5	69	Approximating Matches Made in Heaven	claim
6	66	SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs	claim
7	62	A Survey of Stochastic Games with Limsup and Liminf Objectives	claim
8	60	LTL Path Checking Is Efficiently Parallelizable	claim
9	57	Secure Function Collection with Sublinear Storage	claim
10	56	MANETS: High Mobility Can Make Up for Low Transmission Power	claim
11	55	Popular Mixed Matchings	claim
12	54	On Finding Dense Subgraphs	claim
13	54	Elimination Graphs	claim
14	53	Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus	claim
15	53	Exact and Approximate Bandwidth	claim
16	52	Learning Halfspaces with Malicious Noise	claim
17	52	Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness	claim
18	50	Strong and Pareto Price of Anarchy in Congestion Games	claim
19	50	Counting Subgraphs via Homomorphisms	claim
20	50	Assigning Papers to Referees	claim
21	50	Tight Bounds for the Cover Time of Multiple Random Walks	claim
22	48	On a Network Generalization of the Minmax Theorem	claim
23	48	Limits and Applications of Group Algebras for Parameterized Problems	claim
24	47	On Regular Temporal Logics with Past,	claim
25	47	On Constructor Rewrite Systems and the Lambda-Calculus	claim
26	47	Bounds on the Size of Small Depth Circuits for Approximating Majority	claim
27	46	A Distributed and Oblivious Heap	claim
28	46	Weak Alternating Timed Automata	claim
29	46	Competitive Analysis of Aggregate Max in Windowed Streaming	claim
30	46	A Better Algorithm for Random k-SAT	claim
31	45	The Ehrenfeucht-Silberger Problem	claim
32	45	B-Treaps: A Uniquely Represented Alternative to B-Trees	claim
33	45	Algorithms for Secretary Problems on Graphs and Hypergraphs	claim
34	44	Forward Analysis for WSTS, Part II: Complete WSTS	claim
35	44	Efficient Methods for Selfish Network Design	claim
36	43	Towards Optimal Range Medians	claim
37	43	Multi-armed Bandits with Metric Switching Costs	claim
38	43	Approximating Markov Processes by Averaging	claim
39	42	Dynamic Succinct Ordered Trees	claim
40	42	A Decidable Characterization of Locally Testable Tree Languages	claim
41	42	Boundedness of Monadic Second-Order Formulae over Finite Words	claim
42	42	Towards a Study of Low-Complexity Graphs	claim
43	41	Decidability of the Guarded Fragment with the Transitive Closure	claim
44	41	Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems	claim
45	41	Approximating Decision Trees with Multiway Branches	claim
46	41	Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule	claim
47	41	Incompressibility through Colors and IDs	claim
48	40	Universal Succinct Representations of Trees?	claim
49	40	Superhighness and Strong Jump Traceability	claim
50	40	Unconditional Lower Bounds against Advice	claim
51	40	Mediated Population Protocols	claim
52	40	The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games	claim
53	40	Annotations in Data Streams	claim
54	39	Limiting Negations in Formulas	claim
55	39	Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs	claim
56	39	Testing Fourier Dimensionality and Sparsity	claim
57	39	The Theory of Stabilisation Monoids and Regular Cost Functions	claim
58	39	Maximum Bipartite Flow in Networks with Adaptive Channel Width	claim
59	39	Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures	claim
60	39	The Tile Complexity of Linear Assemblies	claim
61	38	Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs	claim
62	38	Semilinear Program Feasibility	claim
63	38	Improved Algorithms for Latency Minimization in Wireless Networks	claim
64	38	Proportional Response Dynamics in the Fisher Market	claim
65	38	An Explicit Formula for the Free Exponential Modality of Linear Logic	claim
66	38	Decidability of Conjugacy of Tree-Shifts of Finite Type	claim
67	38	The Number of Symbol Comparisons in QuickSort and QuickSelect	claim
68	37	Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams	claim
69	37	Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies	claim
70	37	Reachability in Stochastic Timed Games	claim
71	37	Sleep with Guilt and Work Faster to Minimize Flow Plus Energy	claim
72	37	De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results	claim
73	36	On Observing Dynamic Prioritised Actions in SOC	claim
74	36	Online Computation with Advice	claim
75	36	Fast FAST	claim
76	36	Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types	claim
77	35	Rate-Based Transition Systems for Stochastic Process Calculi	claim
78	34	Multiple Random Walks and Interacting Particle Systems	claim
79	34	A Graph Reduction Step Preserving Element-Connectivity and Applications	claim
80	34	Functional Monitoring without Monotonicity	claim
81	34	When Are Timed Automata Determinizable?	claim
82	34	Sorting and Selection with Imprecise Comparisons	claim
83	33	High Complexity Tilings with Sparse Errors	claim
84	33	Wireless Communication Is in APX	claim
85	33	Qualitative Concurrent Stochastic Games with Imperfect Information	claim
86	32	Improved Bounds for Flow Shop Scheduling	claim
87	32	Factoring Groups Efficiently	claim
88	31	External Sampling	claim
89	28	Distortion Is Fixed Parameter Tractable	claim
90	28	A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers