Conference on Web and Internet Economics

Last updated

Conference on Web and Internet Economics (WINE) (prior to 2013, The Workshop on Internet & Network Economics) is an interdisciplinary workshop devoted to the analysis of algorithmic and economic problems arising in the Internet and the World Wide Web. The submissions are peer reviewed and the proceedings of the conference is published by Springer-Verlag. The conference has been held every year since 2005. Previous sessions include:

  1. WINE 2005: Hong Kong, China : Proceedings: Lecture Notes in Computer Science 3828 Springer 2005, ISBN   3-540-30900-4
  2. WINE 2006: Patras, Greece : Proceedings: Lecture Notes in Computer Science 4286 Springer 2006, ISBN   3-540-68138-8
  3. WINE 2007: San Diego, CA, USA : Proceedings: Lecture Notes in Computer Science 4858 Springer 2007, ISBN   978-3-540-77104-3
  4. WINE 2008: Shanghai, China : Proceedings: Lecture Notes in Computer Science 5385 Springer 2008, ISBN   978-3-540-92184-4
  5. WINE 2009: Rome, Italy : Proceedings: Lecture Notes in Computer Science 5929 Springer 2009, ISBN   978-3-642-10840-2
  6. WINE 2010: Stanford, CA, USA : Proceedings: Lecture Notes in Computer Science 6484 Springer 2010, ISBN   978-3-642-17571-8
  7. WINE 2011: Singapore : Proceedings: Lecture Notes in Computer Science 7090 Springer 2011, ISBN   978-3-642-25509-0
  8. WINE 2012: Liverpool, UK : Proceedings: Lecture Notes in Computer Science 7695 Springer 2012, ISBN   978-3-642-35310-9
  9. WINE 2013: Cambridge, MA, USA : Proceedings: Lecture Notes in Computer Science 8289 Springer 2013, ISBN   978-3-642-45046-4
  10. WINE 2014: Beijing, China : Proceedings: Lecture Notes in Computer Science 8877 Springer 2014, ISBN   978-3-319-13128-3
  11. WINE 2015: Amsterdam, the Netherlands : Proceedings: Lecture Notes in Computer Science 9470 Springer 2015, ISBN   978-3-662-48994-9
  12. WINE 2016: Montreal, Canada : Proceedings: Lecture Notes in Computer Science 10123 Springer 2016, ISBN   978-3-662-54109-8
  13. WINE 2017: Bangalore, India : Proceedings: Lecture Notes in Computer Science 10660 Springer 2017, ISBN   978-3-319-71924-5
  14. WINE 2018: Oxford, UK : Proceedings: Lecture Notes in Computer Science 11316 Springer 2018, ISBN   978-3-030-04611-8
  15. WINE 2019: New York, NY, USA : Proceedings: Lecture Notes in Computer Science 11920 Springer 2019, ISBN   978-3-030-35388-9
  16. WINE 2020: Beijing, China : Proceedings: Lecture Notes in Computer Science 12495 Springer 2020, ISBN   978-3-030-64945-6
  17. WINE 2021: Potsdam, Germany : Proceedings: Lecture Notes in Computer Science 13112 Springer 2022, ISBN   978-3-030-94675-3
  18. WINE 2022: Troy, NY, USA : Proceedings: Lecture Notes in Computer Science 13778 Springer 2022, ISBN   978-3-031-22831-5
  19. WINE 2023: Shanghai, China : Proceedings: Lecture Notes in Computer Science 14413 Springer 2024, ISBN   978-3-031-48973-0

Sources

Related Research Articles

<span class="mw-page-title-main">Egon Börger</span> German computer scientist (born 1930)

Egon Börger is a German-born computer scientist based in Italy.

A bigraph can be modelled as the superposition of a graph and a set of trees.

In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable. It generalizes the Boolean satisfiability problem (SAT) to more complex formulas involving real numbers, integers, and/or various data structures such as lists, arrays, bit vectors, and strings. The name is derived from the fact that these expressions are interpreted within ("modulo") a certain formal theory in first-order logic with equality. SMT solvers are tools that aim to solve the SMT problem for a practical subset of inputs. SMT solvers such as Z3 and cvc5 have been used as a building block for a wide range of applications across computer science, including in automated theorem proving, program analysis, program verification, and software testing.

In computer science, the International Conference on Computer-Aided Verification (CAV) is an annual academic conference on the theory and practice of computer-aided formal analysis of software and hardware systems, broadly known as formal methods. Among the important results originally published in CAV are techniques in model checking, such as Counterexample-Guided Abstraction Refinement (CEGAR) and partial order reduction. It is often ranked among the top conferences in computer science.

WoLLIC, the Workshop on Logic, Language, Information and Computation is an academic conference in the field of pure and applied logic and theoretical computer science. WoLLIC has been organised annually since 1994, typically in June or July; the conference is scientifically sponsored by the Association for Logic, Language and Information, the Association for Symbolic Logic, the European Association for Theoretical Computer Science and the European Association for Computer Science Logic.

CICLing is an annual conference on computational linguistics (CL) and natural language processing (NLP). The first CICLing conference was held in 2000 in Mexico City. The conference is attended by one to two hundred of NLP and CL researchers and students every year. As of 2017, it is ranked within the top 20 sources on computational linguistics by Google Scholar. Past CICLing conferences have been held in Mexico, Korea, Israel, Romania, Japan, India, Greece, Nepal, Egypt, Turkey, Hungary, and Vietnam; the 2019 event was held in France.

The International Semantic Web Conference (ISWC) is a series of academic conferences and the premier international forum for the Semantic Web, Linked Data and Knowledge Graph Community. Here, scientists, industry specialists, and practitioners meet to discuss the future of practical, scalable, user-friendly, and game changing solutions. Its proceedings are published in the Lecture Notes in Computer Science by Springer-Verlag.

The Extended Semantic Web Conference, formerly known as the European Semantic Web Conference, is a yearly international academic conference on the topic of the Semantic Web. The event began in 2004, as the European Semantic Web Symposium. The goal of the event is "to bring together researchers and practitioners dealing with different aspects of semantics on the Web".

In cryptography, the white-box model refers to an extreme attack scenario, in which an adversary has full unrestricted access to a cryptographic implementation, most commonly of a block cipher such as the Advanced Encryption Standard (AES). A variety of security goals may be posed, the most fundamental being "unbreakability", requiring that any (bounded) attacker should not be able to extract the secret key hardcoded in the implementation, while at the same time the implementation must be fully functional. In contrast, the black-box model only provides an oracle access to the analyzed cryptographic primitive. There is also a model in-between, the so-called gray-box model, which corresponds to additional information leakage from the implementation, more commonly referred to as side-channel leakage.

The International Conference on Service Oriented Computing, short ICSOC, is an annual conference providing an outstanding forum for academics, industry researchers, developers, and practitioners to report and share groundbreaking work in service-oriented computing. ICSOC has an 'A' rating from the Excellence in Research in Australia (ERA). Calls for Papers are regularly published on WikiCFP and on the conference website. The conference is also listed in Elsevier's Global Events List.

The International Conference on Business Process Management is an academic conference organized annually by the BPM community. The conference was first organized in 2003 Eindhoven, Netherlands. Since then the conference has been organized annually. The conference is the premium forum for researchers, practitioners and developers in the field of Business Process Management (BPM). The conference typically attracts over 300 participants from all over the world.

<span class="mw-page-title-main">EvoStar</span> International evolutionary computation event

EvoStar, or Evo*, is an international scientific event devoted to evolutionary computation held in Europe. Its structure has evolved over time and it currently comprises four conferences: EuroGP the annual conference on Genetic Programming, EvoApplications, the International Conference on the Applications of Evolutionary Computation, EvoCOP, European Conference on Evolutionary Computation in Combinatorial Optimisation, and EvoMUSART, the International Conference on Computational Intelligence in Music, Sound, Art and Design. According to a 2016 study EvoApplications is a Q1 conference, while EuroGP and EvoCOP are both Q2. In 2021, EuroGP, EvoApplications and EvoCOP obtained a CORE rank B.

Dmitry Khovratovich is a Russian cryptographer, currently a Lead Cryptographer for the Dusk Network, researcher for the Ethereum Foundation, and member of the International Association for Cryptologic Research.

<span class="mw-page-title-main">The MICCAI Society</span>

The MICCAI Society is a professional organization for scientists in the areas of Medical Image Computing and Computer Assisted Interventions. Due to the multidisciplinary nature of these fields, the society brings together researchers from several scientific disciplines. including computer science, robotics, physics, and medicine. The society is best known for its annual flagship event, The MICCAI Conference, which facilitates the publication and presentation of original research on MICCAI-related topics. However, the society provides endorsements and sponsorships for several scientific events each year.

<span class="mw-page-title-main">Parallel Problem Solving from Nature</span> Research conference

Parallel Problem Solving from Nature, or PPSN, is a research conference focusing on the topic of natural computing.

Hartmut Ehrig was a German computer scientist and professor of theoretical computer science and formal specification. He was a pioneer in algebraic specification of abstract data types, and in graph grammars.

Table extraction is the process of recognizing and separating a table from a large document, possibly also recognizing individual rows, columns or elements. It may be regarded as a special form of information extraction.

Nathalie Japkowicz is a Canadian computer scientist specializing in machine learning. She is a professor and department chair of computer science at the American University College of Arts and Sciences.

In computer science and mathematical logic, Cooperating Validity Checker (CVC) is a family of satisfiability modulo theories (SMT) solvers. The latest major versions of CVC are CVC4 and CVC5 ; earlier versions include CVC, CVC Lite, and CVC3. Both CVC4 and cvc5 support the SMT-LIB and TPTP input formats for solving SMT problems, and the SyGuS-IF format for program synthesis. Both CVC4 and cvc5 can output proofs that can be independently checked in the LFSC format, cvc5 additionally supports the Alethe and Lean 4 formats. cvc5 has bindings for C++, Python, and Java.

In the context of computer science, the C Bounded Model Checker (CBMC) is a bounded model checker for C programs. It was the first such tool.