default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 324 matches
- 2015
- Christoph Knieke, Michaela Huhn:
Semantic Foundation and Validation of Live Activity Diagrams. Nord. J. Comput. 15(2): 112-140 (2015) - Mohammad Reza Mousavi, Twan Basten, Michel A. Reniers, Michel Chaudron:
Timed-Gamma and its Coordination Language. Nord. J. Comput. 15(2): 75-111 (2015) - George B. Purdy, Justin W. Smith:
On Finding Ordinary or Monochromatic Intersection Points. Nord. J. Comput. 15(2): 141-153 (2015) - Natarajan Shankar, K. Subramani, Pavlos Eirinakis:
Identifying Negative Cost Cycles in Strongly Polynomial Space. Nord. J. Comput. 15(2): 154-171 (2015) - 2013
- Maarit Harsu, Tibor Bakota, István Siket, Kai Koskimies, Tarja Systä:
Code Clones: Good, Bad, or Ugly? Nord. J. Comput. 15(1): 3-17 (2013) - Zoltán Herczeg, Gábor Lóki, Tamás Szirbucz, Ákos Kiss:
Validating JavaScript Guidelines across Multiple Web Browsers. Nord. J. Comput. 15(1): 18-31 (2013) - Jari Peltonen:
Guest Editor's Foreword. Nord. J. Comput. 15(1): 1-2 (2013) - Markku Sakkinen, Philippe Lahire, Ciprian-Bogdan Chirila:
Towards Fully-Fledged Reverse Inheritance in Eiffel. Nord. J. Comput. 15(1): 32-52 (2013) - Mikko Tiusanen, Antti Valmari:
Good to Know about the Efficiency of State Space Methods. Nord. J. Comput. 15(1): 53-74 (2013) - 2008
- Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko:
Approximation-based Tree Regular Model-Checking. Nord. J. Comput. 14(3): 216-241 (2008) - Cyril Carrez, Lotte Johansen, Pawel Cieslak, Stefan Hänsgen:
Service Engineering with the SIMS Design and Validation Tools. Nord. J. Comput. 14(4): 245-263 (2008) - Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis, Konrad Schlude:
On the Complexity of Variations of Equal Sum Subsets. Nord. J. Comput. 14(3): 151-172 (2008) - Ebba Þóra Hvannberg:
Guest Editor's Foreword. Nord. J. Comput. 14(4): 243-244 (2008) - Evangelos Kranakis, Danny Krizanc, Sunil M. Shende:
Tracking Mobile Users in Cellular Networks using Timing Information. Nord. J. Comput. 14(3): 202-215 (2008) - Samuel Lahtinen, Kai Koskimies:
A Model-Based Approach to Reflective Command Interfaces. Nord. J. Comput. 14(4): 264-281 (2008) - Kenneth Lind, Rogardt Heldal:
Estimation of Real-Time Software Component Size. Nord. J. Comput. 14(4): 282-300 (2008) - Parastoo Mohagheghi, Vegard Dehlen, Tor Neple:
A Metamodel and Supporting Process and Tool for Specifying Quality Models in Model-Based Software Development. Nord. J. Comput. 14(4): 301-320 (2008) - Mikko Raatikainen, Varvana Myllärniemi, Tomi Männistö:
Featback: Method for Enhancing Management of Agile Development. Nord. J. Comput. 14(4): 321-337 (2008) - Outi Räihä, Kai Koskimies, Erkki Mäkinen, Tarja Systä:
Pattern-Based Genetic Model Refinements in MDA. Nord. J. Comput. 14(4): 338-355 (2008) - Qiwen Xu, Naijun Zhan:
Formalising Scheduling Theories in Duration Calculus. Nord. J. Comput. 14(3): 173-201 (2008) - 2007
- Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, Aletta Nylén:
Using Forward Reachability Analysis for Verification of Timed Petri Nets. Nord. J. Comput. 14(1-2): 1-42 (2007) - Anat Bremler-Barr, Leah Epstein:
Path layout on tree networks: Bounds in different label switching models. Nord. J. Comput. 14(1-2): 109-125 (2007) - Pinar Heggernes, Dieter Kratsch:
Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord. J. Comput. 14(1-2): 87-108 (2007) - Vitus S. W. Lam:
A Formalism for Reasoning about UML Activity Diagrams. Nord. J. Comput. 14(1-2): 43-64 (2007) - Meena Mahajan, Raghavan Rama, Vijayakumar Sundarrajan:
Block Sorting: A Characterization and some Heuristics. Nord. J. Comput. 14(1-2): 126-150 (2007) - Ka Lok Man:
Formal Specification and Analysis of Hardware Systems in Timed Chi. Nord. J. Comput. 14(1-2): 65-86 (2007) - 2006
- Alexandru Berlea:
Online Evaluation of Regular Tree Queries. Nord. J. Comput. 13(4): 240-265 (2006) - Maksym Bortin, Einar Broch Johnsen, Christoph Lüth:
Structured Formal Development in Isabelle. Nord. J. Comput. 13(1-2): 2-21 (2006) - Ingo Brückner, Björn Metzler, Heike Wehrheim:
Optimizing Slicing of Formal Specifications by Deductive Verification. Nord. J. Comput. 13(1-2): 22-45 (2006) - Pauli Byckling, Petri Gerdt, Ludwik Kuzniarz, Jorma Sajaniemi:
Increasing Comprehensibility of Object Models: Making the Roles of Attributes Explicit in UML Diagrams. Nord. J. Comput. 13(3): 149-161 (2006)
skipping 294 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-13 03:20 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint