4 Search Results for "Bajpai, Vaibhav"

Document
DOI: 10.4230/DagRep.11.6.14
Towards Climate-Friendly Internet Research (Dagstuhl Seminar 21272)

Authors: Vaibhav Bajpai, Oliver Hohlfeld, Jon Crowcroft, and Srinivasan Keshav

Published in: Dagstuhl Reports, Volume 11, Issue 6 (2021)

Abstract
This report presents guidelines for deciding when virtual or hybrid conferences are suitable and how to design them. The report is the output from a Dagstuhl seminar where the goal was to review the current status of virtual conferences and to develop best practices for hybrid conferences. The participants provided input on the state-of-the-art of virtual conferences: what works, what does not, and what needs improvement. From this discussion, the participants discussed the requirements, implications, and guidelines for designing hybrid conferences. The participants felt that in the future, small research meetings will move entirely online whereas larger ones will be held as hybrid events.
Cite as

Vaibhav Bajpai, Oliver Hohlfeld, Jon Crowcroft, and Srinivasan Keshav. Towards Climate-Friendly Internet Research (Dagstuhl Seminar 21272). In Dagstuhl Reports, Volume 11, Issue 6, pp. 14-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{bajpai_et_al:DagRep.11.6.14,
  author =	{Bajpai, Vaibhav and Hohlfeld, Oliver and Crowcroft, Jon and Keshav, Srinivasan},
  title =	{{Towards Climate-Friendly Internet Research (Dagstuhl Seminar 21272)}},
  pages =	{14--37},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{6},
  editor =	{Bajpai, Vaibhav and Hohlfeld, Oliver and Crowcroft, Jon and Keshav, Srinivasan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.6.14},
  URN =		{urn:nbn:de:0030-drops-155780},
  doi =		{10.4230/DagRep.11.6.14},
  annote =	{Keywords: Carbon Footprint, Energy Efficient Networking, Climate Change}
}
Document
DOI: 10.4230/DagRep.8.10.41
Encouraging Reproducibility in Scientific Research of the Internet (Dagstuhl Seminar 18412)

Authors: Vaibhav Bajpai, Olivier Bonaventure, Kimberly Claffy, and Daniel Karrenberg

Published in: Dagstuhl Reports, Volume 8, Issue 10 (2019)

Abstract
Reproducibility of research in Computer Science and in the field of networking in particular is a well-recognized problem. For several reasons, including the sensitive and/or proprietary nature of some Internet measurements, the networking research community pays limited attention to the of reproducibility of results, instead tending to accept papers that appear plausible. This article summarises a 2.5 day long Dagstuhl seminar on Encouraging Reproducibility in Scientific Research of the Internet held in October 2018. The seminar discussed challenges to improving reproducibility of scientific Internet research, and developed a set of recommendations that we as a community can undertake to initiate a cultural change toward reproducibility of our work. It brought together people both from academia and industry to set expectations and formulate concrete recommendations for reproducible research. This iteration of the seminar was scoped to computer networking research, although the outcomes are likely relevant for a broader audience from multiple interdisciplinary fields.
Cite as

Vaibhav Bajpai, Olivier Bonaventure, Kimberly Claffy, and Daniel Karrenberg. Encouraging Reproducibility in Scientific Research of the Internet (Dagstuhl Seminar 18412). In Dagstuhl Reports, Volume 8, Issue 10, pp. 41-62, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@Article{bajpai_et_al:DagRep.8.10.41,
  author =	{Bajpai, Vaibhav and Bonaventure, Olivier and Claffy, Kimberly and Karrenberg, Daniel},
  title =	{{Encouraging Reproducibility in Scientific Research of the Internet (Dagstuhl Seminar 18412)}},
  pages =	{41--62},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{8},
  number =	{10},
  editor =	{Bajpai, Vaibhav and Bonaventure, Olivier and Claffy, Kimberly and Karrenberg, Daniel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.10.41},
  URN =		{urn:nbn:de:0030-drops-103471},
  doi =		{10.4230/DagRep.8.10.41},
  annote =	{Keywords: Computer Networks, Reproducibility}
}
Document
DOI: 10.4230/LIPIcs.ITCS.2019.8
A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates

Authors: Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, and Srikanth Srinivasan

Published in: LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)

Abstract
We show that there is a zero-error randomized algorithm that, when given a small constant-depth Boolean circuit C made up of gates that compute constant-degree Polynomial Threshold functions or PTFs (i.e., Boolean functions that compute signs of constant-degree polynomials), counts the number of satisfying assignments to C in significantly better than brute-force time. Formally, for any constants d,k, there is an epsilon > 0 such that the zero-error randomized algorithm counts the number of satisfying assignments to a given depth-d circuit C made up of k-PTF gates such that C has size at most n^{1+epsilon}. The algorithm runs in time 2^{n-n^{Omega(epsilon)}}. Before our result, no algorithm for beating brute-force search was known for counting the number of satisfying assignments even for a single degree-k PTF (which is a depth-1 circuit of linear size). The main new tool is the use of a learning algorithm for learning degree-1 PTFs (or Linear Threshold Functions) using comparison queries due to Kane, Lovett, Moran and Zhang (FOCS 2017). We show that their ideas fit nicely into a memoization approach that yields the #SAT algorithms.
Cite as

Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, and Srikanth Srinivasan. A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 8:1-8:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{bajpai_et_al:LIPIcs.ITCS.2019.8,
  author =	{Bajpai, Swapnam and Krishan, Vaibhav and Kush, Deepanshu and Limaye, Nutan and Srinivasan, Srikanth},
  title =	{{A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates}},
  booktitle =	{10th Innovations in Theoretical Computer Science Conference (ITCS 2019)},
  pages =	{8:1--8:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-095-8},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{124},
  editor =	{Blum, Avrim},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.8},
  URN =		{urn:nbn:de:0030-drops-101010},
  doi =		{10.4230/LIPIcs.ITCS.2019.8},
  annote =	{Keywords: SAT, Polynomial Threshold Functions, Constant-depth Boolean Circuits, Linear Decision Trees, Zero-error randomized algorithms}
}
Document
DOI: 10.4230/DagRep.6.1.15
Global Measurements: Practice and Experience (Dagstuhl Seminar 16012)

Authors: Vaibhav Bajpai, Arthur W. Berger, Philip Eardley, Jörg Ott, and Jürgen Schönwälder

Published in: Dagstuhl Reports, Volume 6, Issue 1 (2016)

Abstract
This article summarises a 2.5 day long Dagstuhl seminar on Global Measurements: Practice and Experience held in January 2016. This seminar was a followup of the seminar on Global Measurement Frameworks held in 2013, which focused on the development of global Internet measurement platforms and associated metrics. The second seminar aimed at discussing the practical experience gained with building these global Internet measurement platforms. It brought together people who are actively involved in the design and maintenance of global Internet measurement platforms and who do research on the data delivered by such platforms. Researchers in this seminar have used data derived from global Internet measurement platforms in order to manage networks or services or as input for regulatory decisions. The entire set of presentations delivered during the seminar is made publicly available at [1].
Cite as

Vaibhav Bajpai, Arthur W. Berger, Philip Eardley, Jörg Ott, and Jürgen Schönwälder. Global Measurements: Practice and Experience (Dagstuhl Seminar 16012). In Dagstuhl Reports, Volume 6, Issue 1, pp. 15-33, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{bajpai_et_al:DagRep.6.1.15,
  author =	{Bajpai, Vaibhav and Berger, Arthur W. and Eardley, Philip and Ott, J\"{o}rg and Sch\"{o}nw\"{a}lder, J\"{u}rgen},
  title =	{{Global Measurements: Practice and Experience (Dagstuhl Seminar 16012)}},
  pages =	{15--33},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{6},
  number =	{1},
  editor =	{Bajpai, Vaibhav and Berger, Arthur W. and Eardley, Philip and Ott, J\"{o}rg and Sch\"{o}nw\"{a}lder, J\"{u}rgen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.6.1.15},
  URN =		{urn:nbn:de:0030-drops-58079},
  doi =		{10.4230/DagRep.6.1.15},
  annote =	{Keywords: Internet measurements, Quality of experience, Traffic engineering}
}
  • Refine by Author
  • 3 Bajpai, Vaibhav
  • 1 Bajpai, Swapnam
  • 1 Berger, Arthur W.
  • 1 Bonaventure, Olivier
  • 1 Claffy, Kimberly
  • Show More...

  • Refine by Classification
  • 1 Networks
  • 1 Social and professional topics
  • 1 Theory of computation → Circuit complexity

  • Refine by Keyword
  • 1 Carbon Footprint
  • 1 Climate Change
  • 1 Computer Networks
  • 1 Constant-depth Boolean Circuits
  • 1 Energy Efficient Networking
  • Show More...

  • Refine by Type
  • 4 document

  • Refine by Publication Year
  • 2 2019
  • 1 2016
  • 1 2021

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact